Related papers: Validity of Quantum Adiabatic Theorem
Quantum adiabaticity is the evolution of a quantum system that remains close to an instantaneous eigenstate of a time-dependent Hamiltonian. Using Floquet formalism, we derive a rigorous sufficient condition for adiabaticity in closed,…
A novel and readily understandable derivation of the Golden Rule of time dependent perturbation theory is presented. The derivation is based on adiabatic turning on of the perturbation as used, for instance, in some formal developments of…
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…
We study under what conditions the quantum adiabaticity is maintained in a closed many-body system consisting of a one-dimensional fluid and an impurity particle dragged through the latter by an external force. We employ an effective theory…
Quantum computation by the adiabatic theorem requires a slowly varying Hamiltonian with respect to the spectral gap. We show that the Landau-Zener-St\"uckelberg oscillation phenomenon, that naturally occurs in quantum two level systems…
Quantum annealing is a generic name of quantum algorithms to use quantum-mechanical fluctuations to search for the solution of optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum…
Quantum annealing is guaranteed to find the ground state of optimization problems in the adiabatic limit. Recent work [Phys. Rev. X 6, 031010 (2016)] has found that for some barrier tunneling problems, quantum annealing can be run much…
Adiabaticity is a cornerstone of many promising approaches to quantum control, computing, and simulation. In practice, however, there is always a trade-off. Although the deleterious effects of noise can be diminished by running a control…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
The adiabatic theorem addresses the dynamics of a target instantaneous eigenstate of a time-dependent Hamiltonian. We use a Feshbach P-Q partitioning technique to derive a closed one-component integro-differential equation. The resultant…
An exact uncertainty principle, formulated as the assumption that a classical ensemble is subject to random momentum fluctuations of a strength which is determined by and scales inversely with uncertainty in position, leads from the…
We define for quantum many-body systems a quasi-adiabatic continuation of quantum states. The continuation is valid when the Hamiltonian has a gap, or else has a sufficiently small low-energy density of states, and thus is away from a…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
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…
Adiabatic evolution is an emergent design principle for time modulated metamaterials, often inspired by insights from topological quantum computing such as braiding operations. However, the pursuit of classical adiabatic metamaterials is…
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…
Quantum annealing (QA) is a promising approach for not only solving combinatorial optimization problems but also simulating quantum many-body systems such as those in condensed matter physics. However, non-adiabatic transitions constitute a…
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…
Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an 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…