Quantum Phase Gates for Trapped Ions via Adiabatic Passage

We propose a scheme to produce quantum phase gates for trapped ions. Taking advantage of the adiabatic evolution, the operation is insensitive to small fluctuations of experimental parameters. Furthermore, the spontaneous emission is suppressed since the ions have no probability of being populated in the electronic excited states.     

Adiabatic Quantum Gates

We discuss the logic implementation of quantum gates in the framework of the quantum adiabatic method, which uses the language of ground states, spectral gaps and Hamiltonians instead of the standard unitary transformation language.     

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.     

Adiabatic Theorems for Quantum Resonances

We study the adiabatic time evolution of quantum resonances over time scales which are small compared to the lifetime of the resonances. We consider three typical examples of resonances: The first one is that of shape resonances corresponding, for example, to the state of a quantum-mechanical particle in a potential well whose shape changes over time scales small compared to the escape time of the particle from the well. Our approach to studying the adiabatic evolution of shape resonances is based on a precise form of the time-energy uncertainty relation and the usual adiabatic theorem in quantum mechanics. The second example concerns resonances that appear as isolated complex eigenvalues of spectrally deformed Hamiltonians, such as those encountered in the N-body Stark effect. Our approach to study such resonances is based on the Balslev-Combes theory of dilatation-analytic Hamiltonians and an adiabatic theorem for nonnormal generators of time evolution. Our third example concerns resonances arising from eigenvalues embedded in the continuous spectrum when a perturbation is turned on, such as those encountered when a small system is coupled to an infinitely extended, dispersive medium. Our approach to this class of examples is based on an extension of adiabatic theorems without a spectral gap condition. We finally comment on resonance crossings, which can be studied using the last approach.     

Quantum State Transfer via Adiabatic Passage

我们采用周期极化KTP晶体为非线性介质，通过光学参量振荡器运转于阈值以下的简并参量振荡过程，产生了单模正交压缩真空态光场，在泵浦功率为123mW，Local光功率为842uW，晶体温度为32．1摄氏度时我们使用平衡零拍探测法测得输出场噪声功率低于散粒噪声基准3．41dB。     

Long-Range Interaction Enhanced Adiabatic Quantum Computers

A quantum computer is not necessarily alone, e.g., thousands and millions of quantum computers are simultaneously working together for adiabatic quantum computers based on nuclear spins.Long-range interaction is inevitable between these nuclear spin qubits.Here we investigate the effect of long-range dipolar interaction between different adiabatic quantum computers.Our analytical and numerical results show that the dipolar interaction can enhance the final fidelity in adiabatic quantum computati...     

Adiabatic Elimination in Quantum Stochastic Models

We consider a physical system with a coupling to bosonic reservoirs via a quantum stochastic differential equation. We study the limit of this model as the coupling strength tends to infinity. We show that in this limit the solution to the quantum stochastic differential equation converges strongly to the solution of a limit quantum stochastic differential equation. In the limiting dynamics the excited states are removed and the ground states couple directly to the reservoirs.     

利用绝热过程实现量子信息转移

基于绝热过程,仅需一个真空腔即可分别实现未知单原子态、双原子纠缠态及GHZ态的转移.在这些方案中,量子信息都存储在原子的基态,且系统仅在暗态空间中演化,原子激发态上无布居,这使得原子的自发辐射效应大大受到抑制.相比之前的方案,这些方案所需资源更少,操作更简单.另外,还讨论了其在实验上实现的可行性.     

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.     

Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm

We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of L gates we can construct a quantum adiabatic algorithm with time complexity of O(L). Additionally, our construction shows that one may exponentially speed up some quantum adiabatic algorithms by properly choosing an evolution path.     

Quantum Adiabatic Evolution for Pattern Recognition Problem

Quantum pattern recognition algorithm for two-qubit systems has been implemented by quantum adiabatic evolution.We will estimate required running time for this algorithm by means of an analytical solution of timedependent Hamiltonian since the time complexity of adiabatic quantum evolution is a limitation on the quantum computing.These results can be useful for experimental implementation.     

Sufficient Condition for Validity of Quantum Adiabatic Theorem

In this paper,we attempt to give a sufficient condition of guaranteeing the validity of the proof of the quantum adiabatic theorem.The new sufficient condition can clearly remove the inconsistency and the counterexample of the quantum adiabatic theorem pointed out by Marzlin and Sanders.     

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.     

An Alternative Adiabatic Quantum Algorithm for the Hamiltonian Cycle Problem

We put forward an alternative quantum algorithm for finding Hamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a von Neumann measurement on the final state, one may determine whether there is a Hamiltonian cycle in the graph and pick out a cycle if there is any. Although the proposed algorithm provides a quadratic speedup, it gives an alternative algorithm based on adiabatic quantum computation, which is of interest because of its inherent robustness.     

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.