Experimental implementation of a fixed-point duality quantum search algorithm in the nuclear magnetic resonance quantum system

In this work, we demonstrated a fixed-point quantum search algorithm in the nuclear magnetic resonance (NMR) system. We constructed the pulse sequences for the pivotal operations in the quantum search protocol. The experimental results agree well with the theoretical predictions. The generalization of the scheme to the arbitrary number of qubits has also been given.     

A quantum search algorithm of two-dimensional convex hull

Despite the rapid development of quantum research in recent years, there is very little research in computational geometry. In this paper, to achieve the convex hull of a point set in a quantum system, a quantum convex hull algorithm based on the quantum maximum or minimum searching algorithm (QUSSMA) is proposed. Firstly, the novel enhanced quantum representation of digital images is employed to represent a group of point set, and then the QUSSMA algorithm and vector operation are used to search the convex hull of the point set. In addition, the algorithm is simulated and compared with the classical algorithm. It is concluded that the quantum algorithm accelerates the classical algorithm when the ${M}_{p}$ value of the convex hull point is under a certain condition.     

A realizable quantum encryption algorithm for qubits

A realizable quantum encryption algorithm for qubits is presented by employing bit-wise quantum computation. System extension and bit-swapping are introduced into the encryption process, which makes the ciphertext space expanded greatly. The security of the proposed algorithm is analysed in detail and the schematic physical implementation is also provided. It is shown that the algorithm, which can prevent quantum attack strategy as well as classical attack strategy, is effective to protect qubits. Finally, we extend our algorithm to encrypt classical binary bits and quantum entanglements.     

Variational quantum simulation of thermal statistical states on a superconducting quantum processer

Quantum computers promise to solve finite-temperature properties of quantum many-body systems, which is generally challenging for classical computers due to high computational complexities. Here, we report experimental preparations of Gibbs states and excited states of Heisenberg $XX$ and $XXZ$ models by using a 5-qubit programmable superconducting processor. In the experiments, we apply a hybrid quantum-classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits. We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits, which enable us to prepare excited states at arbitrary energy density. We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error. Based on numerical results, we further show that the time complexity of our approach scales polynomially in the number of qubits, revealing its potential in solving large-scale problems.     

清华物理系量子信息研究的新进展

在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验.     

A hybrid quantum encoding algorithm of vector quantization for image compression

Many classical encoding algorithms of vector quantization (VQ) of image compression that can obtain global optimal solution have computational complexity O(N). A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45\sqrt{N} times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than \sqrt{N} for most images, and it is more efficient than the pure quantum algorithm.     

Realizing number recognition with simulated quantum semi-restricted Boltzmann machine

Quantum machine learning based on quantum algorithms may achieve an exponential speedup over classical algorithms in dealing with some problems such as clustering. In this paper, we use the method of training the lower bound of the average log likelihood function on the quantum Boltzmann machine (QBM) to recognize the handwritten number datasets and compare the training results with classical models. We find that, when the QBM is semi-restricted, the training results get better with fewer computing resources. This shows that it is necessary to design a targeted algorithm to speed up computation and save resources.     

核磁共振量子信息处理研究的新进展

过去的二十年中,量子信息相关研究取得了显著的进展,重要的理论和实验工作不断涌现.与其他量子信息处理系统相比,基于自旋动力学的核磁共振系统,不仅具有丰富而且成熟的控制技术,还拥有相干时间长、脉冲操控精确、保真度高等优点.这也是核磁共振体量子系统能够精确操控多达12比特的量子系统的原因.因此,核磁共振量子处理器在量子信息领域一直扮演着重要角色.本文介绍核磁共振量子计算的基本原理和一些新研究进展.研究的新进展主要包括量子噪声注入技术、量子机器学习在核磁共振平台上的实验演示、高能物理和拓扑序的量子模拟以及核磁共振量子云平台等.最后讨论了液态核磁共振的发展前景和发展瓶颈,并对未来发展方向提出展望.     

Design of quantum VQ iteration and quantum VQ encoding algorithm taking O（√N） steps for data compression

Vector quantization (VQ) is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take $O(N)$ steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes $O(\sqrt N )$ steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor's factorization algorithm and Grover's algorithm. Entanglement state is generated and used, by contrast the state in Grover's algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.     

Simulated quantum computation of global minima

Finding the optimal solution to a complex optimisation problem is of great importance in practically all fields of science, technology, technical design and econometrics. We demonstrate that a modified Grover's quantum algorithm can be applied to real problems of finding a global minimum using modest numbers of quantum bits. Calculations of the global minimum of simple test functions and Lennard-Jones clusters have been carried out on a quantum computer simulator using a modified Grover's algorithm. The number of function evaluations N reduced from O(N) in classical simulation to O(N ^1/2) in quantum simulation. We also show how the Grover's quantum algorithm can be combined with the classical Pivot method for global optimisation to treat larger systems.     

量子卷积码的编译码方法

对于量子卷积码理论的研究旨在保护长距离通信中的量子信息序列. 定义了量子态的多项式表示形式,根据Calderbank-Shor-Steane(CSS)型量子码的构造方法,给出了CSS型量子卷积码的一种新的编译码方法,描述了编译码网络. 该方法将码字基态变换为信息多项式与生成多项式的乘积,然后用量子态上的多项式乘法操作实现编译码网络. 最后借鉴经典卷积码的译码思想,给出了具有线性复杂度的量子Viterbi算法. 关键词： 量子信息 量子卷积码 编译码 纠错算法     

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

~~Implementation of a multiple round quantum dense coding using nuclear magnetic resonance1. Bennett, C. H., Wiesner, S. J., Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states, Phys. Rev. Lett., 1992, 69(20): 2881-2884. 2. Mattle, K., Weinfurter, H., Kwiat, P. G. et al., Dense coding in experimental quantum communication, Phys. Rev. Lett., 1996, 76(25): 4656-4659. 3. Fang, X. M., Zhu, X. W., Feng, M. et al., Experimental implementation of dens…     

Implementation of a multiple round quantum dense coding using nuclear magnetic resonance

A multiple round quantum dense coding scheme based on the quantum phase estimation algorithm is proposed and implemented in a three qubit nuclear magnetic resonance (NMR) quantum computer. Using anm+1 qubit system, Bod can transmit one of 2 ^m+1 messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob form rounds. The information capacity is enhanced tom+1 bits as compared tom bits in a classical scheme. The scheme has been demonstrated in NMR system, and the experimental results show a good agreement between theory and experiment.     

Optimized quantum singular value thresholding algorithm based on a hybrid quantum computer

Quantum singular value thresholding (QSVT) algorithm, as a core module of many mathematical models, seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors. The existing all-qubit QSVT algorithm demands lots of ancillary qubits, remaining a huge challenge for realization on nearterm intermediate-scale quantum computers. In this paper, we propose a hybrid QSVT (HQSVT) algorithm utilizing both discrete variables (DVs) and continuous variables (CVs). In our algorithm, raw data vectors are encoded into a qubit system and the following data processing is fulfilled by hybrid quantum operations. Our algorithm requires O[log(MN)] qubits with O(1) qumodes and totally performs O(1) operations, which significantly reduces the space and runtime consumption.     

量子算法核磁共振实现脉冲序列设计程序问题研究

从两量子位核磁共振量子处理器物理模型出发,利用Raedt小组提出的自旋-1/2代数理论,根据量子控制非门的定义及Grover量子算法原理,介绍了量子控制非门的4种不同脉冲序列及两量子位Grover量子算法的两种不同脉冲序列的设计过程,通过数值求解含时薛定谔方程模拟量子控制非门和两量子位Grover量子算法,等价于执行量子控制非门和两量子位Grover量子算法运算,演示和分析量子控制非门及两量子位Grover量子算法核磁共振脉冲序列设计呈现的量子程序问题.     

Linear optical realization of unambiguous quantum state comparison

In this paper, we propose an experimental scheme for unambiguous quantum state comparison assisted by linear optical manipulations, twin-photons produced from parametric down-conversion, and postselection from the coincidence measurement. In this scheme the preparation of the general two mixed qubit states with arbitrary prior probabilities and the realization of the optimal POVMs for unambiguous quantum state comparison are presented. This proposal is feasible by current experimental technology, and may be used in single-qubit quantum fingerprinting.     

Quantum factorization of 143 on a dipolar-coupling nuclear magnetic resonance system

Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and its experimental realization to factor the number 143 on a liquid-crystal NMR quantum processor with dipole-dipole couplings. We believe this to be the largest number factored in quantum-computation realizations, which shows the practical importance of adiabatic quantum algorithms.     

Non-local quantum functions and the distributed Deutsch-Jozsa algorithm

Non-local implementations of quantum gates are a vital part of quantum networks. We find an optimal non-local implementation of quantum functions, the quantum gate equivalent of a switch statement. Then, we apply this result to the Deutsch-Jozsa problem, obtaining a distributed Deutsch-Jozsa algorithm and we show the relative efficiency improvement. As an application, we find a non-cooperative game based upon the original Deutsch-Jozsa problem where a classical agent has at most a 50% probability of winning, while a quantum agent can win every time.     

Variational quantum support vector machine based on Hadamard test

Classical machine learning algorithms seem to be totally incapable of processing tremendous amounts of data, while quantum machine learning algorithms could deal with big data with ease and provide exponential acceleration over classical counterparts. Meanwhile, variational quantum algorithms are widely proposed to solve relevant computational problems on noisy, intermediate-scale quantum devices. In this paper, we apply variational quantum algorithms to quantum support vector machines and demonstrate a proof-of-principle numerical experiment of this algorithm. In addition, in the classification stage, fewer qubits, shorter circuit depth, and simpler measurement requirements show its superiority over the former algorithms.     

Efficient quantum secure communication with a publicly known key

This paper presents a simple way for an eavesdropper to eavesdrop freely the secret message in the experimental realization of quantum communication protocol proposed by Beige et al （2002 Acta Phys. Pol. A 101 357）. Moreover, it introduces an efficient quantum secure communication protocol based on a publicly known key with decoy photons and two biased bases by modifying the original protocol. The total efficiency of this new protocol is double that of the original one. With a low noise quantum channel, this protocol can be used for transmitting a secret message. At present, this protocol is good for generating a private key efficiently,