Related papers: Adiabatic approximation with exponential accuracy …
We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010)], and on the formulation of the degenerate adiabatic theorem, along with its…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
The preparation of a given quantum state on a quantum computing register is a typically demanding operation, requiring a number of elementary gates that scales exponentially with the size of the problem. Using the adiabatic theorem for…
In adiabatic quantum computing finding the dependence of the gap of the Hamiltonian as a function of the parameter varied during the adiabatic sweep is crucial in order to optimize the speed of the computation. Inspired by this challenge,…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
The adiabatic approximation exhibits wide applicability in quantum mechanics, providing a simple approach for nontransitional dynamics in quantum systems governed by slowly varying time-dependent Hamiltonians. However, the standard…
The adiabatic theorem is a fundamental result established in the early days of quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time…
Adiabatic quantum computing is a framework for quantum computing that is superficially very different to the standard circuit model. However, it can be shown that the two models are computationally equivalent. The key to the proof is a…
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential…
In this paper,we present a rigorous demonstration and discussion of the quantum adiabatic theorem for systems having a non degenerate continuous spectrum. A new strategy is initiated by defining a kind of gap, "a virtual gap", for the…
We show that in a quantum adiabatic evolution, even though the adiabatic approximation is valid, the total phase of the final state indicated by the adiabatic theorem may evidently differ from the actual total phase. This invalidates the…
By stating the adiabatic theorem of quantum mechanics in a clear and rigorous way, we establish a necessary condition and a sufficient condition for its validity, where the latter is obtained employing our recently developed adiabatic…
The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $\tau$ is upper bounded by $C/\tau$ for some positive…
The use of the adiabatic approximation in practical applications, as in adiabatic quantum computation, demands an assessment of the errors made in finite-time evolutions. Aiming at such scenarios, we derive bounds relating error and…
Optimal truncations of asymptotic expansions are known to yield approximations to adiabatic quantum evolutions that are accurate up to exponentially small errors. In this paper, we rigorously determine the leading order non--adiabatic…
Recently there have been some controversies about the criterion of the adiabatic approximation. It is shown that an approximate diagonalization of the effective Hamiltonian in the second quantized formulation gives rise to a reliable and…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al.,…
Let the adiabatic invariant of action variable in slow-fast Hamiltonian system with two degrees of freedom have two limiting values along the trajectories as time tends to infinity. The difference of two limits is exponentially small in…