Related papers: Bounds for the adiabatic approximation with applic…
In the conventional quantum mechanics (i.e., hermitian QM) the adia- batic theorem for systems subjected to time periodic fields holds only for bound systems and not for open ones (where ionization and dissociation take place) [D. W. Hone,…
The adiabatic theorem states that an initial eigenstate of a slowly varying Hamiltonian remains close to an instantaneous eigenstate of the Hamiltonian at a later time. We show that a perfunctory application of this statement is problematic…
We expand upon the standard quantum adiabatic theorem, examining the time-dependence of quantum evolution in the near-adiabatic limit. We examine a Hamiltonian that evolves along some fixed trajectory from $\hat{H}_0$ to $\hat{H}_1$ in a…
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the…
We analyze the ground state entanglement in a quantum adiabatic evolution algorithm designed to solve the NP-complete Exact Cover problem. The entropy of entanglement seems to obey linear and universal scaling at the point where the mass…
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…
Validity conditions for the adiabatic approximation are useful tools to understand and predict the quantum dynamics. Remarkably, the resonance phenomenon in oscillating quantum systems has challenged the adiabatic theorem. In this scenario,…
We present an analysis of the adiabatic approximation to understand when it applies, in view of the recent criticisms and studies for the validity of the adiabatic theorem. We point out that this approximation is just the leading order of a…
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors,…
Adiabatic quantum computation starts from embedding a computational problem into a Hamiltonian whose ground state encodes the solution to the problem. This problem Hamiltonian, $H_{\rm p}$, is normally chosen to be diagonal in the…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…
Nonadiabatic holonomic quantum computation has been proposed as a method to implement quantum logic gates with robustness comparable to that of adiabatic holonomic gates but with shorter execution times. In this paper, we establish an…
We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…
We investigate the influence of random errors in external control parameters on the stability of holonomic quantum computation in the case of arbitrary loops and adiabatic connections. A simple expression is obtained for the case of small…
We study the adiabatic approximation of the dynamics of a bipartite quantum system with respect to one of the components, when the coupling between its two components is perturbative. We show that the density matrix of the considered…
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…
We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiabatic Theorem…
Adiabatic approximation for quantum evolution is investigated quantitatively with addressing its dependence on the Berry connections. We find that, in the adiabatic limit, the adiabatic fidelity may uniformly converge to unit or diverge…
The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by the…
The first proof of the quantum adiabatic theorem was given as early as 1928. Today, this theorem is increasingly applied in a many-body context, e.g. in quantum annealing and in studies of topological properties of matter. In this setup,…