Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor

Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover's search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, using the local adiabatic evolution, the algorithms given by J. Roland and N.J. Cerf for Grover's search [J. Roland, N.J. Cerf, Quantum search by local adiabatic evolution, Phys. Rev. A 65 (2002) 042308] and by Saurya Das, Randy Kobes, and Gabor Kunstatter for the Deutsch-Jozsa algorithm [S. Das, R. Kobes, G. Kunstatter, Adiabatic quantum computation and Deutsh's algorithm, Phys. Rev. A 65 (2002) 062301], yield a complexity of order N (where N=2(n) and n is the number of qubits). In this paper, we report the experimental implementation of these local adiabatic evolution algorithms on a 2-qubit quantum information processor, by Nuclear Magnetic Resonance.     

A quantum search algorithm based on partial adiabatic evolution

This paper presents and implements a specified partial adiabatic search algorithm on a quantum circuit. It studies the minimum energy gap between the first excited state and the ground state of the system Hamiltonian and it finds that,in the case of M = 1,the algorithm has the same performance as the local adiabatic algorithm. However,the algorithm evolves globally only within a small interval,which implies that it keeps the advantages of global adiabatic algorithms without losing the speedup of the local adiabatic search algorithm.     

Implementation of quantum search scheme by adiabatic passage in a cavity--laser--atom system

This paper proposes a scheme for implementing the adiabatic quantum search algorithm of different marked items in an unsorted list of N items with atoms in a cavity driven by lasers. N identical three-level atoms are trapped in a single-mode cavity. Each atom is driven by a set of three pulsed laser fields. In each atom, the same level represents a database entry. Two of the atoms are marked differently. The marked atom has an energy gap between its two ground states. The two different marked states can be sought out respectively starting from an initial entangled state by controlling the ratio of three pulse amplitudes. Moreover, the mechanism, based on adiabatic passage, constitutes a decoherence-free method in the sense that spontaneous emission and cavity damping are avoided since the dynamics follows the dark state. Furthermore, this paper extends the algorithm with m (m>2) atoms marked in an ideal situation. Any different marked state can be sought out.     

On Models of Nonlinear Evolution Paths in Adiabatic Quantum Algorithms

In this paper,we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector Hamiltonians on the corresponding ground state.If the overlap between the initial state and final state of the quantum system is not equal to zero,both of these models can provide a constant time speedup over the usual adiabatic algorithms by increasing some another corresponding "complexity".But when the initial state has a zero overlap with the solution state in the problem,the second model leads to an infinite time complexity of the algorithm for whatever interpolating functions being applied while the first one can still provide a constant running time.However,inspired by a related reference,a variant of the first model can be constructed which also fails for the problem when the overlap is exactly equal to zero if we want to make up the "intrinsic" fault of the second model - an increase in energy.Two concrete theorems are given to serve as explanations why neither of these two models can improve the usual adiabatic evolution algorithms for the phenomenon above.These just tell us what should be noted when using certain nonlinear evolution paths in adiabatic quantum algorithms for some special kind of problems.     

On a Nonlinear Model in Adiabatic Evolutions

In this paper, we study a kind of nonlinear model of adiabatic evolution in quantum search problem. As will be seen here, for this problem, there always exists a possibility that this nonlinear model can successfully solve the problem, while the linear model can not. Also in the same setting, when the overlap between the initial state and the final stare is sufficiently large, a simple linear adiabatic evolution can achieve O(1) time efficiency, but infinite time complexity for the nonlinear model of adiabatic evolution is needed. This tells us, it is not always a wise choice to use nonlinear interpolations in adiabatic algorithms. Sometimes, simple linear adiabatic evolutions may be sufficient for using.     

Transitionless driving on local adiabatic quantum search algorithm

We apply the transitionless driving on the local adiabatic quantum search algorithm to speed up the adiabatic process.By studying quantum dynamics of the adiabatic search algorithm with the equivalent two-level system, we derive the transitionless driving Hamiltonian for the local adiabatic quantum search algorithm. We found that when adding a transitionless quantum driving term H_D(t) on the local adiabatic quantum search algorithm, the success rate is 1 exactly with arbitrary evolution time by solving the time-dependent Schr odinger equation in eigen-picture. Moreover, we show the reason for the drastic decrease of the evolution time is that the driving Hamiltonian increases the lowest eigenvalues to a maximum of ON~(1/2).     

On the Role of Prior Probability in Adiabatic Quantum Algorithms

In this paper, we study the role of prior probability on the efficiency of quantum local adiabatic search algorithm. The following aspects for prior probability are found here: firstly, only the probabilities of marked states affect the running time of the adiabatic evolution; secondly, the prior probability can be used for improving the efficiency of the adiabatic algorithm; thirdly, like the usual quantum adiabatic evolution, the running time for the case of multiple solution states where the number of marked elements are smaller enough than the size of the set assigned that contains them can be significantly bigger than that of the case where the assigned set only contains all the marked states.     

Unstructured Adiabatic Quantum Search

In the adiabatic quantum computation model, a computational procedure is described by the continuous time evolution of a time dependent Hamiltonian. We apply this method to the Grover's problem, i.e., searching a marked item in an unstructured database. Classically, the problem can be solved only in a running time of order O(N) (where N is the number of items in the database), whereas in the quantum model a speed up of order has been obtained. We show that in the adiabatic quantum model, by a suitable choice of the time-dependent Hamiltonian, it is possible to do the calculation in constant time, independent of the the number of items in the database. However, in this case the initial time-complexity of is replaced by the complexity of implementing the driving Hamiltonian.     

Symmetry-Protected Quantum Adiabatic Evolution in Spontaneous Symmetry-Breaking Transitions

Quantum adiabatic evolution describes the dynamical evolution of a slowly driven Hamiltonian. In most systems undergoing spontaneous symmetry-breaking transitions, the symmetry-protected quantum adiabatic evolution can still appear, even when the two lowest eigenstates become degenerate. Here, a general derivation to revisit the symmetry-dependent transition and the symmetry-dependent adiabatic condition (SDAC) is given. Further, based on the SDAC, an adiabatic-parameter-fixed sweeping scheme is used for achieving fast adiabatic evolution, which is more efficient than the linear sweeping scheme. In the limit of small adiabatic parameter, an analytic inequality is obtained for the ground state fidelity only dependent on the adiabatic parameter. The general statements are then demonstrated via two typical systems. Besides, the robustness of the symmetry-dependent adiabatic evolution against weak symmetry-breaking sources is studied. The findings can be tested via the techniques in quantum annealing and may provide promising applications in practical quantum technologies.     

绝热演化中一般量子态的几何相位

在绝热演化中的几何相位（即Berry相位）被推广到包括非本征态的一般量子态.这个新的几何相位同时适用于线性量子系统和非线性量子系统.它对于后者尤其重要因为非线性量子系统的绝热演化不能通过本征态的线性叠加来描述.在线性量子系统中,新定义的几何相位是各个本征态Berry相位的权重平均.     

利用暗本征态的绝热演化实现非几何条件相位移动:一种实现量子计算的新方法

利用绝热演化，文章提出一种新的方法以实现量子相位门，这种相位移动既非源于动力学过程，也非源于几何操纵，它来源于暗态本身的演化，基于绝热演化的优点，这种量子逻辑门对实验参量的起伏不敏感，与几何相位门相比，这种相位门更简单，并且保真度可得到进一步提高。文章对这种相位门做一简述。     

A Necessary Condition for Quantum Adiabaticity Applied to the Adiabatic Grover Search

Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. Recently a practicable necessary condition well suited for many-body systems has been proved. Here we tailor this condition for estimating run times of adiabatic quantum algorithms. As an illustration, the condition is applied to the adiabatic algorithm for searching in an unstructured database (adiabatic Grover search algorithm). We find that the thus obtained lower bound on the run time of this algorithm reproduces \( \sqrt{N} \) scaling (with N being the number of database entries) of the explicitly known optimum run time. This is in contrast to the poor performance of the known sufficient adiabatic conditions, which guarantee adiabaticity only for a run time on the order of O(N), which does not constitute any speedup over the classical database search. This observation highlights the merits of the new adiabatic condition and its potential relevance to adiabatic quantum computing.     

Maximum Speed of Quantum Evolution

In this paper, we discuss the question of the minimum time needed for any state of a given quantum system to evolve into a distinct (orthogonal) state. This problem is relevant to deriving physical limits in quantum computation and quantum information processing. Here, we consider both cases of nonadiabatic and adiabatic evolution and we derive the Hamiltonians corresponding to the minimum time evolution predicted by the Margolus–Levitin theorem.     

An Exact Quantum Search Algorithm with Arbitrary Database

In standard Grover’s algorithm for quantum searching, the probability of finding a marked state is not exactly 1, and some modified versions of Grover’s algorithm that search a marked state from an evenly distributed database with full successful rate have been presented. In this article, we present a generalized quantum search algorithm that searches M marked states from an arbitrary distributed N-item quantum database with a zero theoretical failure rate, where N is not necessary to be the power of 2. We analyze the general properties of our search algorithm, we find that our algorithm has periodicity with a period of 2J + 1, and it is effective with certainty for J + (2J + 1)m times of iteration, where m is an arbitrary nonnegative number.     

Adiabatic approximation in PT-symmetric quantum mechanics

In this paper, we present a quantitative sufficient condition for adiabatic approximation in PT-symmetric quantum mechanics, which yields that a state of the PT-symmetric quantum system at any time will remain approximately in the m-th eigenstate up to a multiplicative phase factor whenever it is initially in the m-th eigenstate of the Hamiltonian. In addition, we estimate the approximation errors by the distance and the fidelity between the exact solution and the adiabatic approximate solution to the time evolution equation, respectively.     

Quantum Algorithm for Hilbert's Tenth Problem

We explore in the framework of Quantum Computation the notion of Computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to the Turing halting problem and is known to be mathematically noncomputable, is proposed where quantum continuous variables and quantum adiabatic evolution are employed. If this algorithm could be physically implemented, as much as it is valid in principle—that is, if certain Hamiltonian and its ground state can be physically constructed according to the proposal—quantum computability would surpass classical computability as delimited by the Church—Turing thesis. It is thus argued that computability, and with it the limits of Mathematics, ought to be determined not solely by Mathematics itself but also by Physical Principles.     

费米超流气体的非线性Landau-Zener 隧穿

在平均场近似下,通过对相平面和不动点的分析, 研究了非线性两能级系统中费米超流气体的Landau-Zener 隧穿现象. 研究发现,费米子间的相互作用能够显著地影响量子隧穿. 当相互作用参数c小于临界值c^*时,在绝热极限下隧穿仍然满足量子绝热定理, 而大于这一临界值时,量子绝热定理不再满足. 最后通过和线性情况比较,得到了c*时隧穿率与扫描速率间满足的指数关系.     

Deterministic Motion of the Controversial Piston in the Thermodynamic Limit

We consider the evolution of a system composed of N non-interacting point particles of mass m in a cylindrical container divided into two regions by a movable adiabatic wall (the adiabatic piston). We study the thermodynamic limit for the piston where the area A of the cross-section, the mass M of the piston, and the number N of particles go to infinity keeping A/M and N/M fixed. The length of the container is a fixed parameter which can be either finite or infinite. In this thermodynamic limit we show that the motion of the piston is deterministic and the evolution is adiabatic. Moreover if the length of the container is infinite, we show that the piston evolves toward a stationary state with velocity approximately proportional to the pressure difference. If the length of the container is finite, introducing a simplifying assumption we show that the system evolves with either weak or strong damping toward a well-defined state of mechanical equilibrium where the pressures are the same, but the temperatures different. Numerical simulations are presented to illustrate possible evolutions and to check the validity of the assumption.     

How do quantum numbers generally vary in the adiabatic transformation of an ideal gas？

We continue to analyse the known law of adiabatic transformation for an ideal gas PV^5/3 = Constant, where P is the pressure and V is the volume, and following the approach of non-relativistic quantum mechanics which we suggested in a previous work (Yarman et al. 2010 Int. J. Phys. Sci. 5 1524). We explicitly determine the constant for the general parallelepiped geometry of a container. We also disclose how the quantum numbers associated with molecules of an ideal gas vary through an arbitrary adiabatic transformation. Physical implications of the results obtained are discussed.     

非绝热效应对暗态的影响

研究了微腔中量单模驻波场与三能级Ｖ型暗原子相互作用的绝热动力学及其非绝热修正，详细分析了它对两激发态之间粒子数转化的影响，并由此讨论了体系绝热演化的条件