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:2502.06534 · The European Physical Journal D

Practical limitations of the switching theorem for adiabatic state preparation

Thomas D. Cohen, Andrew Li, Hyunwoo Oh, Maneesha Sushama Pradeep

Published Apr 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Abstract The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in 1/ T , based on the lowest nonzero derivative of the Hamiltonian and its eigenvalues at the endpoints. Modifications at the endpoints in practical implementations can modify this scaling behavior, suggesting opportunities for error reduction by altering endpoint behavior while keeping intermediate evolution largely unchanged. Such modifications can significantly reduce errors for long evolution times, but they may also require exceedingly long timescales to reach the hyperadiabatic regime, limiting their practicality. This paper explores the transition between the adiabatic and hyperadiabatic regimes in simple low-dimensional Hamiltonians, highlighting the impact of modifications of the endpoints on approaching the asymptotic behavior described by the switching theorem. Graphical abstract

DOI
10.1140/epjd/s10053-026-01148-5

Related papers

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

A Note on the Switching Adiabatic Theorem

Alexander Elgart, George A. Hagedorn

We derive a nearly optimal upper bound on the running time in the adiabatic theorem for a switching family of Hamiltonians. We assume the switching Hamiltonian is in the Gevrey class Gα as a function of time, and we show that the error in adiabatic approximation remains small for running times of order g−2 | ln g | α. Here g denotes the minimal spectral gap between the eigenvalue(s) of interest and the rest of the spectrum of the instantaneous Hamiltonian.

•Jan 1, 2012•48 citations

Error reduction in quantum annealing using boundary cancellation: Only the end matters

Lorenzo Campos Venuti, Daniel A. Lidar

The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $\ensuremath{\tau}$ is upper bounded by $C/\ensuremath{\tau}$ for some positive constant $C$. It has been known for decades that this error can be reduced to ${C}_{k}/{\ensuremath{\tau}}^{k+1}$ if the Hamiltonian has vanishing derivatives up to order $k$ at the beginning and end of the evolution. Here we extend this result to open systems described by a time-dependent Liouvillian superoperator. We find that the same results holds provided the Liouvillian has vanishing derivatives up to order $k$ only at the end of the evolution. This asymmetry is ascribable to the arrow of time inherent in open system evolution. We further investigate whether it is possible to satisfy the required assumptions by controlling only the system, as required for realistic implementations. Surprisingly, we find the answer to be affirmative. We establish this rigorously in the setting of the Davies-Lindblad adiabatic master equation, and numerically in the setting of two different time-dependent Redfield-type master equations we derive. The results are shown to be stable with respect to imperfections in the preparation. Finally, we prove that the results hold also in a fully Hamiltonian model.

arXiv:1806.06310•Physical Review A•Aug 13, 2018•19 citations

A note on the switching adiabatic theorem

Alexander Elgart, George A. Hagedorn

We derive a nearly optimal upper bound on the running time in the adiabatic theorem for a switching family of Hamiltonians. We assume the switching Hamiltonian is in the Gevrey class Gα as a function of time, and we show that the error in adiabatic approximation remains small for running times of order g−2 |ln g |6α. Here g denotes the minimal spectral gap between the eigenvalue(s) of interest and the rest of the spectrum of the instantaneous Hamiltonian.

arXiv:1204.2318•Journal of Mathematical Physics•Sep 18, 2012•45 citations

Alternative adiabatic quantum dynamics with algorithmic applications

Joseph Cunningham, Jérémie Roland

In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the adiabatic theorem. We propose several alternative processes that achieve the same goal, but can easily be implemented on a gate-based quantum computer without the overhead of simulating time-dependent Hamiltonian evolution. We give a general framework for deriving `adiabatic' theorems for these processes. As an application, we give various algorithms for solving the Quantum Linear Systems Problem (QLSP) with optimal scaling in the condition number. One of these algorithms was previously developed in [Cunningham, Roland 2024] and another can be seen as a randomised version of the discrete adiabatic algorithm of [Costa et al. 2022]. We also describe versions of Trotterisation in our framework, which allows several results from [An et al. 2025] to be reproduced in a randomised setting. In particular, bounds on the Trotter error in terms of the fidelity are obtained that are asymptotically better than the standard bounds.

quant-pharXiv:2605.30110•May 29, 2026•0 citations

Evolution-Time Dependence in Near-Adiabatic Quantum Evolutions

Lucas T. Brady, Wim van Dam

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.

arXiv:1801.04349•Jan 12, 2018•0 citations
Abstract The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in 1/ T , based on the lowest nonzero derivative of the Hamiltonian and its eigenvalues at the endpoints. Modifications at the endpoints in practical implementations can modify this scaling behavior, suggesting opportunities for error reduction by altering endpoint behavior while keeping intermediate evolution largely unchanged. Such modifications can significantly reduce errors for long evolution times, but they may also require exceedingly long timescales to reach the hyperadiabatic regime, limiting their practicality. This paper explores the transition between the adiabatic and hyperadiabatic regimes in simple low-dimensional Hamiltonians, highlighting the impact of modifications of the endpoints on approaching the asymptotic behavior described by the switching theorem. Graphical abstract
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.
The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $\ensuremath{\tau}$ is upper bounded by $C/\ensuremath{\tau}$ for some positive constant CCC. It has been known for decades that this error can be reduced to ${C}_{k}/{\ensuremath{\tau}}^{k+1}$ if the Hamiltonian has vanishing derivatives up to order kkk at the beginning and end of the evolution. Here we extend this result to open systems described by a time-dependent Liouvillian superoperator. We find that the same results holds provided the Liouvillian has vanishing derivatives up to order kkk only at the end of the evolution. This asymmetry is ascribable to the arrow of time inherent in open system evolution. We further investigate whether it is possible to satisfy the required assumptions by controlling only the system, as required for realistic implementations. Surprisingly, we find the answer to be affirmative. We establish this rigorously in the setting of the Davies-Lindblad adiabatic master equation, and numerically in the setting of two different time-dependent Redfield-type master equations we derive. The results are shown to be stable with respect to imperfections in the preparation. Finally, we prove that the results hold also in a fully Hamiltonian model.
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the adiabatic theorem. We propose several alternative processes that achieve the same goal, but can easily be implemented on a gate-based quantum computer without the overhead of simulating time-dependent Hamiltonian evolution. We give a general framework for deriving `adiabatic' theorems for these processes. As an application, we give various algorithms for solving the Quantum Linear Systems Problem (QLSP) with optimal scaling in the condition number. One of these algorithms was previously developed in [Cunningham, Roland 2024] and another can be seen as a randomised version of the discrete adiabatic algorithm of [Costa et al. 2022]. We also describe versions of Trotterisation in our framework, which allows several results from [An et al. 2025] to be reproduced in a randomised setting. In particular, bounds on the Trotter error in terms of the fidelity are obtained that are asymptotically better than the standard bounds.
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.