Related papers: A note on the switching adiabatic theorem
A controlled-phase gate was demonstrated in superconducting Xmon transmon qubits with fidelity reaching 99.4%, relying on the adiabatic interaction between the |11> and |02> states. Here we explain the theoretical concepts behind this…
A novel switching differentiator that has considerably simple form is proposed. Under the assumption that time-derivatives of the signal are norm-bounded, it is shown that estimation errors are convergent to the zeros asymptotically. The…
We develop a theoretical description of non-Hermitian time evolution that accounts for the break- down of the adiabatic theorem. We obtain closed-form expressions for the time-dependent state amplitudes, involving the complex eigen-energies…
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…
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…
We show that recent results on adiabatic theory for interacting gapped many-body systems on finite lattices remain valid in the thermodynamic limit. More precisely, we prove a generalised super-adiabatic theorem for the automorphism group…
We establish adiabatic theorems with and without spectral gap condition for general -- typically dissipative -- linear operators $A(t): D(A(t)) \subset X \to X$ with time-independent domains $D(A(t)) = D$ in some Banach space $X$. Compared…
Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…
The quantum adiabatic theorem states that if a quantum system starts in an eigenstate of the Hamiltonian, and this Hamiltonian varies sufficiently slowly, the system stays in this eigenstate. We investigate experimentally the conditions…
Marzlin and Sanders \cite{marzlin} have shown rigorously that the adiabatic approximation can be very inaccurate when applied to a Hamiltonian $H(t)$ that generates the evolution $U^{\dagger} (t)$ even if it gives an excellent approximation…
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 map adiabatic quantum evolution on the classical Hamiltonian dynamics of a 1D gas (Pechukas gas) and simulate the latter numerically. This approach turns out to be both insightful and numerically efficient, as seen from our example of a…
We study the slowly varying, non-autonomous quantum dynamics of a translation invariant spin or fermion system on the lattice $\mathbb Z^d$. This system is assumed to be initially in thermal equilibrium, and we consider realizations of…
We establish adiabatic theorems with and without spectral gap condition for general -- typically dissipative -- linear operators $A(t): D(A(t)) \subset X \to X$ with time-dependent domains $D(A(t))$ in some Banach space $X$. In these…
In this letter we give a systematic derivation and justification of the semiclassical model for the slow degrees of freedom in adiabatic slow-fast systems first found by Littlejohn and Flynn [5]. The classical Hamiltonian obtains a…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
We explore the relationship between two figures of merit for an adiabatic quantum computation process: the success probability $P$ and the minimum gap $\Delta_{min}$ between the ground and first excited states, investigating to what extent…
Most investigations devoted to the conditions for adiabatic quantum computing are based on the first-order correction ${\bra{\Psi_{\rm ground}(t)}\dot H(t)\ket{\Psi_{\rm excited}(t)} /\Delta E^2(t)\ll1}$. However, it is demonstrated that…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
We introduce a perturbative approach to solving the time dependent Schroedinger equation, named adiabatic perturbation theory (APT), whose zeroth order term is the quantum adiabatic approximation. The small parameter in the power series…