Related papers: The Adiabatic Theorem for Quantum Systems with Spe…
Many areas of physics rely upon adiabatic state transfer protocols, allowing a quantum state to be moved between different physical systems for storage and retrieval or state manipulation. However, these state-transfer protocols suffer from…
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…
Adiabatic quantum computing is a powerful framework for state preparation, while its evolution time often scales quadratically in the inverse Hamiltonian spectral gap, leading to sub-optimal computational complexity. In this work, we…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
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…
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…
We derive an adiabatic theory for a stochastic differential equation, $ \varepsilon\, \mathrm{d} X(s) = L_1(s) X(s)\, \mathrm{d} s + \sqrt{\varepsilon} L_2(s) X(s) \, \mathrm{d} B_s, $ under a condition that instantaneous stationary states…
We prove that, for a quantum system that undergoes a strong perturbation, the solution of the leading order equation of the strong field approximation (M.Frasca, Phys. Rev. A, {\bf 45}, 43 (1992)) can be derived by the adiabatic…
We indicate that there are points to keep in mind in utilizing quantum states prepared by the adiabatic quantum computation. Even if an instantaneous expectation value of a physical quantity for the adiabatically prepared quantum state is…
Since the discovery of adiabatic quantum computing, a need has arisen for rigorously proven bounds for the error in the adiabatic approximation. We present in this paper, a rigorous and elementary derivation of upper and lower bounds on the…
Quantum adiabatic evolution is a dynamical evolution of a quantum system under slow external driving. According to the quantum adiabatic theorem, no transitions occur between non-degenerate instantaneous eigen-energy levels in such a…
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…
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…
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…
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…
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…
Quantum thermodynamics aims at investigating both the emergence and the limits of the laws of thermodynamics from a quantum mechanical microscopic approach. In this scenario, thermodynamic processes with no heat exchange, namely, adiabatic…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing…
Quantum systems with chaotic classical counterparts cannot be treated by perturbative techniques or any kind of adiabatic approximations. This is so, in spite of the quantum suppression of classical chaos. We explicitly calculate the…