Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1801.04349

Evolution-Time Dependence in Near-Adiabatic Quantum Evolutions

Lucas T. Brady, Wim van Dam

Published Jan 12, 2018• 0 citations
arXivHTMLPDF

Abstract

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 total evolution-time $τ$, and our goal is to determine how the final state of the system depends on $τ$. If the system is initialized in a non-degenerate ground state, the adiabatic theorem says that in the limit of large $τ$, the system will stay in the ground state. We examine the near-adiabatic limit where the system evolves slowly enough that most but not all of the final state is in the ground state, and we find that the probability of leaving the ground state oscillates in $τ$ with a frequency determined by the integral of the spectral gap along the trajectory of the Hamiltonian, so long as the gap is big. If the gap becomes exceedingly small, the final probability is the sum of oscillatory behavior determined by the integrals of the gap before and after the small gap. We confirm these analytic predictions with numerical evidence from barrier tunneling problems in the context of quantum adiabatic optimization.

DOI
10.48550/arxiv.1801.04349

Related papers

Chapter 9: Optimization with the adiabatic theorem

Giacomo Nannicini

The adiabatic theorem is a powerful result concerning the evolution of quantum mechanical systems. Intuitively, it states the following: suppose we want to study the evolution of a quantum mechanical system governed by a given Hamiltonian \(\mathcal H\) (Def. 6.1), and the initial state of the system is the eigenstate of \(\mathcal H\) corresponding to its lowest eigenvalue. The laws of quantum physics tell us that the evolution of the system over time follows the Schrüdinger equation, Eq. (6.1). Suppose now that the Hamiltonian is not fixed, but rather, it changes very slowly over time, so that the evolution of the system is described by the differential equation \(i\,\frac{\mathrm{d} | \psi(t) \rangle}{\mathrm{d}t} = \mathcal{H}(t) | \psi(t) \rangle\), and \(\mathcal{H}(t)\) is slowly changing. If, for any value of the time parameter \(t\), there is always a gap between the lowest eigenvalue of \(\mathcal{H}(t)\) and all other eigenvalues, then the adiabatic theorem asserts that the state of the system always remains in an eigenstate with the lowest eigenvalue throughout the evolution. One specific case of interest in this chapter occurs when the time-dependent Hamiltonian \(\mathcal{H}(t)\) varies from an initial (time-independent) Hamiltonian \(\mathcal{H}_{\mathrm{I}}\) to a final Hamiltonian \(\mathcal{H}_{\mathrm{F}}\). If the change happens slowly, and the initial state of the system is an eigenstate of \(\mathcal{H}_{\mathrm{I}}\) with minimum eigenvalue, the adiabatic theorem asserts that the evolution eventually leads to the eigenstate with minimum eigenvalue of the final Hamiltonian \(\mathcal{H}_{\mathrm{F}}\). This result can be used for optimization: imagine that the initial Hamiltonian encodes an easy problem for which we can construct the eigenstate with minimum eigenvalue, and the final Hamiltonian encodes a difficult optimization problem whose solution is given by the eigenstate with minimum eigenvalue. By the adiabatic theorem, evolving the eigenstate of the initial Hamiltonian while slowly changing the Hamiltonian into the final one leads to the solution of the difficult optimization problem. Of course we need to know how slowly \(\mathcal{H}_{\mathrm{I}}\) should be changed into \(\mathcal{H}_{\mathrm{F}}\). The adiabatic theorem is at the heart of the quantum approximate optimization algorithm (QAOA), a framework that has been widely used to implement optimization algorithms on existing quantum hardware, because it has low requirements of quantum resources–although it does not guarantee improvements over classical algorithms in general. In this chapter we first discuss the adiabatic theorem, and then give an overview of QAOA.

Society for Industrial and Applied Mathematics eBooks•Dec 17, 2025•0 citations

Adiabatic Quantum Computation

Friederike Anna Dziemba

The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to projection operators keeping the statement valid for Hamiltonians with degenerate ground spaces. Yet the main focus of this work lies in studying the efficiency of quantum circuit simulations by adabatic quantum computation. The standard Hamiltonian construction by Kitaev is based on a path graph reflecting the $L$ computation steps and influencing the scaling of the necessary evolution time by its spectral gap of $\mathcal{O}\left(\frac{1}{L^2}\right)$. Aspiring to an improved running time we generalize Kitaev's Hamiltonian to so-called standard graph Hamiltonians based on graph families with a different spectral gap. In this generalized construction the first two time derivatives of the Hamiltonian and the fraction of initial vertices appear as additional parameters of running time. In a first step the time derivatives can be proven to be constant. Expansion results from spectral graph theory however impose a trade-off between the spectral gap and the fraction of initial vertices as well as the fraction of final vertices which corresponds to the probability for obtaining the correct computational output. Graphs with spectral gap $\mathcal{O}\left(\frac{1}{L^k}\right)$, $k<2$, turn out to contradict very likely, graphs with $k<1$ even for sure at least one of the efficiency criterias for running time, output probability or Hamiltonian implementation. The above results may also be obstacles for a possible quantum PCP-theorem in complexity theory claiming the local Hamiltonian problem with constant gap to be QMA-complete since the very same Kitaev Hamiltonian is constructed in the QMA-hardness proof for the Local Hamiltonian problem.

arXiv:1610.04708•Oct 15, 2016•1 citation

Asymptotic errors in adiabatic evolution

Thomas D. Cohen, Hyunwoo Oh

The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved Hamiltonian. Understanding corrections to the adiabatic result that arise when the evolution of the Hamiltonian is slow, but not arbitrarily slow, has become increasingly important, especially since adiabatic evolution has been proposed as a method of state preparation in quantum computing. This paper identifies two regimes, an adiabatic regime in which corrections are generically small and can depend on details of the evolution throughout the path and a hyperadiabatic regime in which the error is given by a form similar to an asymptotic expansion in the inverse of the evolution time with the coefficients depending principally on the behavior at the endpoints. However, the error in this hyperadiabatic regime is neither given by a true asymptotic series nor solely dependent on the endpoints: The coefficients combine the contributions from both endpoints, with relative phase factors that depend on the average spectral gaps along the trajectory, multiplied by the evolution time. The central result of this paper is to identify a quantity, referred to as the typical error, which is obtained by appropriately averaging the error over evolution times that are small compared to the evolution time itself. This typical error is characterized by an asymptotic series and depends solely on the endpoints of the evolution, remaining independent of the details of the intermediate evolution.

arXiv:2501.10641•Physical Review A•Apr 11, 2025•0 citations

Adiabatic approximation with better than exponential accuracy for many-body systems and quantum computation

Daniel A. Lidar, A. T. Rezakhani, Alioscia Hamma

We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real time axis, that some number of its time-derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is non-degenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time-derivative of the Hamiltonian, divided by the cube of the minimal gap.

•Aug 20, 2008•4 citations

Time Scale for Adiabaticity Breakdown in Driven Many-Body Systems and Orthogonality Catastrophe

Oleg Valentinovich Lychkovskiy, Oleksandr Gamayun, Vadim Cheianov

The adiabatic theorem is a fundamental result in quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time slowly enough. The theorem has an impressive record of applications ranging from foundations of quantum field theory to computational molecular dynamics. In light of this success it is remarkable that a practicable quantitative understanding of what "slowly enough" means is limited to a modest set of systems mostly having a small Hilbert space. Here we show how this gap can be bridged for a broad natural class of physical systems, namely, many-body systems where a small move in the parameter space induces an orthogonality catastrophe. In this class, the conditions for adiabaticity are derived from the scaling properties of the parameter-dependent ground state without a reference to the excitation spectrum. This finding constitutes a major simplification of a complex problem, which otherwise requires solving nonautonomous time evolution in a large Hilbert space.

arXiv:1611.00663•Physical Review Letters•Nov 13, 2017•44 citations

Adiabatic approximation with exponential accuracy for many-body systems and quantum computation

Daniel A. Lidar, Ali T. Rezakhani, Alioscia Hamma

We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real-time axis, that some number of its time derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is nondegenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time derivative of the Hamiltonian divided by the cube of the minimal gap.

arXiv:0808.2697•Journal of Mathematical Physics•Oct 1, 2009•166 citations
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 H^0\hat{H}_0H^0​ to H^1\hat{H}_1H^1​ in a total evolution-time τττ, and our goal is to determine how the final state of the system depends on τττ. If the system is initialized in a non-degenerate ground state, the adiabatic theorem says that in the limit of large τττ, the system will stay in the ground state. We examine the near-adiabatic limit where the system evolves slowly enough that most but not all of the final state is in the ground state, and we find that the probability of leaving the ground state oscillates in τττ with a frequency determined by the integral of the spectral gap along the trajectory of the Hamiltonian, so long as the gap is big. If the gap becomes exceedingly small, the final probability is the sum of oscillatory behavior determined by the integrals of the gap before and after the small gap. We confirm these analytic predictions with numerical evidence from barrier tunneling problems in the context of quantum adiabatic optimization.
The adiabatic theorem is a powerful result concerning the evolution of quantum mechanical systems. Intuitively, it states the following: suppose we want to study the evolution of a quantum mechanical system governed by a given Hamiltonian H\mathcal HH (Def. 6.1), and the initial state of the system is the eigenstate of H\mathcal HH corresponding to its lowest eigenvalue. The laws of quantum physics tell us that the evolution of the system over time follows the Schrüdinger equation, Eq. (6.1). Suppose now that the Hamiltonian is not fixed, but rather, it changes very slowly over time, so that the evolution of the system is described by the differential equation i d∣ψ(t)⟩dt=H(t)∣ψ(t)⟩i\,\frac{\mathrm{d} | \psi(t) \rangle}{\mathrm{d}t} = \mathcal{H}(t) | \psi(t) \rangleidtd∣ψ(t)⟩​=H(t)∣ψ(t)⟩, and H(t)\mathcal{H}(t)H(t) is slowly changing. If, for any value of the time parameter ttt, there is always a gap between the lowest eigenvalue of H(t)\mathcal{H}(t)H(t) and all other eigenvalues, then the adiabatic theorem asserts that the state of the system always remains in an eigenstate with the lowest eigenvalue throughout the evolution. One specific case of interest in this chapter occurs when the time-dependent Hamiltonian H(t)\mathcal{H}(t)H(t) varies from an initial (time-independent) Hamiltonian HI\mathcal{H}_{\mathrm{I}}HI​ to a final Hamiltonian HF\mathcal{H}_{\mathrm{F}}HF​. If the change happens slowly, and the initial state of the system is an eigenstate of HI\mathcal{H}_{\mathrm{I}}HI​ with minimum eigenvalue, the adiabatic theorem asserts that the evolution eventually leads to the eigenstate with minimum eigenvalue of the final Hamiltonian HF\mathcal{H}_{\mathrm{F}}HF​. This result can be used for optimization: imagine that the initial Hamiltonian encodes an easy problem for which we can construct the eigenstate with minimum eigenvalue, and the final Hamiltonian encodes a difficult optimization problem whose solution is given by the eigenstate with minimum eigenvalue. By the adiabatic theorem, evolving the eigenstate of the initial Hamiltonian while slowly changing the Hamiltonian into the final one leads to the solution of the difficult optimization problem. Of course we need to know how slowly HI\mathcal{H}_{\mathrm{I}}HI​ should be changed into HF\mathcal{H}_{\mathrm{F}}HF​. The adiabatic theorem is at the heart of the quantum approximate optimization algorithm (QAOA), a framework that has been widely used to implement optimization algorithms on existing quantum hardware, because it has low requirements of quantum resources–although it does not guarantee improvements over classical algorithms in general. In this chapter we first discuss the adiabatic theorem, and then give an overview of QAOA.
The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to projection operators keeping the statement valid for Hamiltonians with degenerate ground spaces. Yet the main focus of this work lies in studying the efficiency of quantum circuit simulations by adabatic quantum computation. The standard Hamiltonian construction by Kitaev is based on a path graph reflecting the LLL computation steps and influencing the scaling of the necessary evolution time by its spectral gap of O(1L2)\mathcal{O}\left(\frac{1}{L^2}\right)O(L21​). Aspiring to an improved running time we generalize Kitaev's Hamiltonian to so-called standard graph Hamiltonians based on graph families with a different spectral gap. In this generalized construction the first two time derivatives of the Hamiltonian and the fraction of initial vertices appear as additional parameters of running time. In a first step the time derivatives can be proven to be constant. Expansion results from spectral graph theory however impose a trade-off between the spectral gap and the fraction of initial vertices as well as the fraction of final vertices which corresponds to the probability for obtaining the correct computational output. Graphs with spectral gap O(1Lk)\mathcal{O}\left(\frac{1}{L^k}\right)O(Lk1​), k<2k<2k<2, turn out to contradict very likely, graphs with k<1k<1k<1 even for sure at least one of the efficiency criterias for running time, output probability or Hamiltonian implementation. The above results may also be obstacles for a possible quantum PCP-theorem in complexity theory claiming the local Hamiltonian problem with constant gap to be QMA-complete since the very same Kitaev Hamiltonian is constructed in the QMA-hardness proof for the Local Hamiltonian problem.
The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved Hamiltonian. Understanding corrections to the adiabatic result that arise when the evolution of the Hamiltonian is slow, but not arbitrarily slow, has become increasingly important, especially since adiabatic evolution has been proposed as a method of state preparation in quantum computing. This paper identifies two regimes, an adiabatic regime in which corrections are generically small and can depend on details of the evolution throughout the path and a hyperadiabatic regime in which the error is given by a form similar to an asymptotic expansion in the inverse of the evolution time with the coefficients depending principally on the behavior at the endpoints. However, the error in this hyperadiabatic regime is neither given by a true asymptotic series nor solely dependent on the endpoints: The coefficients combine the contributions from both endpoints, with relative phase factors that depend on the average spectral gaps along the trajectory, multiplied by the evolution time. The central result of this paper is to identify a quantity, referred to as the typical error, which is obtained by appropriately averaging the error over evolution times that are small compared to the evolution time itself. This typical error is characterized by an asymptotic series and depends solely on the endpoints of the evolution, remaining independent of the details of the intermediate evolution.
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real time axis, that some number of its time-derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is non-degenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time-derivative of the Hamiltonian, divided by the cube of the minimal gap.
The adiabatic theorem is a fundamental result in quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time slowly enough. The theorem has an impressive record of applications ranging from foundations of quantum field theory to computational molecular dynamics. In light of this success it is remarkable that a practicable quantitative understanding of what "slowly enough" means is limited to a modest set of systems mostly having a small Hilbert space. Here we show how this gap can be bridged for a broad natural class of physical systems, namely, many-body systems where a small move in the parameter space induces an orthogonality catastrophe. In this class, the conditions for adiabaticity are derived from the scaling properties of the parameter-dependent ground state without a reference to the excitation spectrum. This finding constitutes a major simplification of a complex problem, which otherwise requires solving nonautonomous time evolution in a large Hilbert space.
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. Assuming that the Hamiltonian is analytic in a finite strip around the real-time axis, that some number of its time derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is nondegenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time derivative of the Hamiltonian divided by the cube of the minimal gap.