Related papers: Adiabatic Theorem for Quantum Spin Systems
The condition for adiabatic approximation are of basic importance for the applications of the adiabatic theorem. The traditional quantitative condition was found to be necessary but not sufficient, but we do not know its physical meaning…
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…
We investigate why, in quantum many-body systems, the adiabatic fidelity and the overlap between the initial state and instantaneous ground states often yield nearly identical values. Our analysis suggests that this phenomenon results from…
We consider the simplest example of a nonstationary quantum system which is quantum mechanical oscillator with varying frequency and $\lambda \phi^4$ self-interaction. We calculate loop corrections to the Keldysh, retarded/advanced…
Stimulated Raman Adiabatic Passage, a very efficient technique for manipulating a quantum system based on the adiabatic theorem, is analyzed in the case where the manipulated physical system is interacting with a spin bath. Exploitation of…
We prove an adiabatic theorem for the non-autonomous Gross-Pitaevskii equation in the case of a weak trap. More precisely, we assume that the external potential decays suitably at infinity and admits exactly one bound state.
We discuss the emergence of nonadiabatic behavior in the dynamics of the order parameter in a low-dimensional quantum many-body system subject to a linear ramp of one of its parameters. While performing a ramp within a gapped phase seems to…
We illustrate the adiabatic quantum computing solution of the knapsack problem with both integer profits and weights. For problems with $n$ objects (or items) and integer capacity $c$, we give specific examples using both an Ising class…
We treat a quantum mechanical system with certain general properties which are expected to be common in macroscopic quantum systems. Starting from a PURE initial state (which may not describe an equilibrium) in which energy is mildly…
The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze 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 apply the method of transitionless quantum driving for time-dependent quantum systems to spin systems. For a given Hamiltonian, the driving Hamiltonian is constructed so that the adiabatic states of the original system obey the…
We review our approach to the second law of thermodynamics, viewed as a theorem asserting the growth of the mean (Gibbs-von Neumann) entropy of quantum spin systems undergoing automorphic (unitary) adiabatic transformations. Non-automorphic…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
For ergodic adiabatic quantum systems, we study the evolution of energy distribution as the system evolves in time. Starting from the von Neumann equation for the density operator, we obtain the quantum analogue of the Smoluchowski equation…
In a quantum system with a smoothly and slowly varying Hamiltonian, which approaches a constant operator at times $t\to \pm \infty$, the transition probabilities between adiabatic states are exponentially small. They are characterized by an…
Quantum control could be implemented by varying the system Hamiltonian. According to adiabatic theorem, a slowly changing Hamiltonian can approximately keep the system at the ground state during the evolution if the initial state is a…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
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 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…