相关论文: Condition for the adiabatic approximation

In this thesis, it is presented a set of results in adiabatic dynamics (closed and open system) and transitionless quantum driving that promote some advances in our understanding on quantum control and Hamiltonian inverse engineering. In…

In this paper, we discuss the compatibility between the rotating-wave and the adiabatic approximations for controlled quantum systems. Although the paper focuses on applications to two-level quantum systems, the main results apply in higher…

Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…

The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved…

A condition on the Hamiltonian of a time-dependent quantum mechanical system is derived which, if satisfied, implies optimal adiabaticity (defined below). The condition is expressed in terms of the Hamiltonian and in terms of the evolution…

We introduce the idea of using adiabatic rotation to generate superpositions of a large class of quantum states. For quantum computing this is an interesting alternative to the well-studied "straight line" adiabatic evolution. In ways that…

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…

We provide necessary and sufficient conditions for the partial transposition of bipartite harmonic quantum states to be nonnegative. The conditions are formulated as an infinite series of inequalities for the moments of the state under…

Recently, Marzlin and Sanders (2004) demonstrated an inconsistency when the adiabatic approximation was applied to specific, "inverse" time-evolving systems. Following that, Tong et al. (2005) showed that the widely used traditional…

We consider quantum dynamics for which the strict adiabatic approximation fails but which do not escape too far from the adiabatic limit. To treat these systems we introduce a generalisation of the time dependent wave operator theory which…

We analyze the problem of optimal adiabatic passage through a quantum critical point. We show that to minimize the number of defects the tuning parameter should be changed as a power-law in time. The optimal power is proportional to the…

The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in $1/T$, based on the lowest non-zero derivative of the…

The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to…

Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or…

The arguments employed in quant-ph/0111009, to claim that the quantum algorithm in quant-ph/0110136 does not work, are so general that were they true then the adiabatic theorem itself would have been wrong. As a matter of fact, those…

We propose a variational principle to compute a quantum adiabatic brachistochrone (QAB) for open systems. Using the notion of "adiabatic speed" based on the energy gaps, we derive a Lagrangian associated to the functional measuring the time…

The simulation of adiabatic evolution has deep connections with Adiabatic Quantum Computation, the Quantum Approximate Optimization Algorithm and adiabatic state preparation. Here we address the error analysis problem in quantum simulation…

Quantum annealing (QA) is an algorithm to find the ground state of the problem Hamiltonian by using an adiabatic time evolution. An approach to evaluate adiabaticity in the experiment by applying spectroscopic techniques has recently been…

Digitizing an adiabatic evolution is a strategy able to combine the good performance of gate-based quantum processors with the advantages of adiabatic algorithms, providing then a hybrid model for efficient quantum information processing.…

Adiabaticity of quantum evolution is important in many settings. One example is the adiabatic quantum computation. Nevertheless, up to now, there is no effective method to test the adiabaticity of the evolution when the eigenenergies of the…