Cited by 125Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Superadiabatic Controlled Evolutions and Universal Quantum Computation

Open access
Santos, Alan C., Sarandy, Marcelo S.·2015·Scientific Reports

Abstract

Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement universal quantum computation. Our method is based on the realization of piecewise controlled superadiabatic evolutions. Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians. In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates. Concerning the energy cost of the superadiabatic implementation, we show that it is dictated by the quantum speed limit, providing an upper bound for the corresponding adiabatic counterparts.

AI snapshot

Written from the paper’s full text.

TL;DR

The paper proposes a superadiabatic shortcut to controlled adiabatic evolutions for universal quantum computation, using simple time-independent counter-diabatic Hamiltonians. It shows that gate times are no longer constrained by the adiabatic theorem and are instead limited by the quantum speed limit and an associated energy cost.

Key findings

  • Universal quantum gates can be implemented through piecewise controlled superadiabatic evolutions, including fast rotation gates and arbitrary n-qubit controlled gates, with the counter-diabatic Hamiltonian given by a time-independent operator in Eq. (23).
  • The superadiabatic implementation allows the total evolution time τ to be reduced to an arbitrarily small value, with the QSL bound reducing to Eq. (27); saturation is achieved for either τ → 0 or ω → 0, implying τω → 0.
  • The energetic cost Σ(τ) of superadiabatic evolutions supersedes the corresponding adiabatic cost Σ0(τ), and for qubit rotation gates it increases inversely proportional to the total evolution time.
  • For controlled gates, the sum in the energetic-cost expression runs over 1 to 4 projectors on the subsystem, and the energetic cost ΣCG to implement controlled gates is stated to be [formula omitted in provided text].

Methods

  • Theoretical quantum-information design: builds on controlled adiabatic evolutions (CAE) and adiabatic quantum circuits, then applies superadiabatic theory and counter-diabatic driving to implement quantum gates.
  • Derives eigenstates and eigenvalues of piecewise adiabatic Hamiltonians, constructs counter-diabatic Hamiltonians, and proves that for arbitrary n-controlled gates the shortcut Hamiltonian is time-independent.
  • Analyzes speed and cost using the generalized Margolus-Levitin quantum speed limit from Deffner and Lutz, the Bures metric for pure states, and the Hilbert-Schmidt norm for energetic cost.

Limitations

  • The paper states that implications under decoherence and a fault-tolerance analysis of superadiabatic circuits are challenges of immediate interest, and that experimental proposals for superadiabatic circuits are left for future research.
  • The paper states that superadiabatic implementations require knowledge of the eigenvalues and eigenstates of the adiabatic Hamiltonian, though for n-controlled gates this reduces to a single-qubit Hamiltonian independent of circuit complexity.
  • Evident from the text: the scheme is theoretical and no experimental demonstration is reported; the adiabatic CAE implementation is probabilistic with probability enhanced to one only in the limit θ0 → π, while the superadiabatic shortcut is deterministic only if decoherence effects can be avoided.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/srep15775

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 10 cited sources checked · 0 supported · 0 flagged

  • Findingreasoning

    The addition of a counter-diabatic Hamiltonian implies the QSL bound Eq. (26).

    “More specifically, the addition of a counter-diabatic Hamiltonian implies into the QSL bound”
    Quote in the paperSubstantial claim
    • The authors state this as an assumption: The quantum system is closed for the quantum speed limit analysis.
  • Findingreasoning

    For an arbitrary n-controlled quantum gate, the counter-diabatic Hamiltonians associated with shortcuts to adiabatic evolutions driven by Hξ(s) are time-independent operators given by Eq. (23).

    “Hence, the implementation any n-controlled gate is achieved through a time-independent counter-diabatic Hamiltonian.”
    Quote in the paperSubstantial claim
  • Findingown data

    The energetic cost Σ(τ) increases inversely proportional to the total time of evolution.

    “We illustrate the behavior of Σ(τ) in Fig. 1, where it is apparent that the energetic cost increases inversely proportional to the total time of evolution.”
    Quote in the paperSubstantial claim
  • Findingnone given

    The cost of performing superadiabatic evolutions requires knowledge of the eigenvalues and eigenstates of Hl(t).

    “Note that the cost of performing superadiabatic evolutions requires the knowledge of the eigenvalues and eigenstates of Hl(t).”
    Quote in the paperSubstantial claim
  • Findingreasoning

    Piecewise controlled superadiabatic evolutions can be obtained by simple time-independent counter-diabatic Hamiltonians.

    “Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians.”
    Quote in the paperSubstantial claim
  • May combine two claims. 5
  • Classified as probably not a substantial claim. 2
  • May combine two claims.

    Findingreasoning

    Saturation of Eq. (27) is achieved for either τ → 0 or ω → 0, with both cases implying τω → 0.

    “In particular, saturation of Eq. (27) is achieved for either τ → 0 or ω → 0, with both cases implying in τω → 0.”
    Quote in the paperSubstantial claim
    • The authors state this as an assumption: The quantum system is closed for the quantum speed limit analysis.
  • May combine two claims.

    Findingreasoning

    H(s) exhibits doubly degenerate levels, with states associated with levels E+ = ωħ and E− = −ωħ.

    “Thus, H(s) exhibits doubly degenerate levels, with and associated with levels E+ = ωħ and E− = −ωħ, respectively.”
    Quote in the paperSubstantial claim
  • Classified as probably not a substantial claim.

    Premisecitation

    The adiabatic theorem ensures transitionless evolution if the system is prepared in an eigenstate of the Hamiltonian at t = 0 and the Hamiltonian is sufficiently slowly varying.

    “In particular, if the system is prepared in an eigenstate of the Hamiltonian H at a time t = 0, it will evolve to the corresponding instantaneous eigenstate at later times. This transitionless evolution is ensured by the adiabatic theorem, which is one of the oldest and most explored tools in quantum mechanics123.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [123]

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning

    Fast rotation gates and arbitrary n-qubit controlled gates can be implemented and used to design different sets of universal quantum gates.

    “In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Premisecitation

    CAE are used to perform one-qubit and two-qubit gates, allowing for universality through the set of one-qubit rotations joint with an entangling two-qubit gate.

    “In turn, CAE are used to perform one-qubit and two-qubit gates, allowing for universality through the set of one-qubit rotations joint with an entangling two-qubit gate2526.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [2526]

      Not checked in the free run.

  • Classified as probably not a substantial claim. May combine two claims.

    Premisecitation

    AQC has been proved universal for quantum computing, equivalent to the standard circuit model up to polynomial resource-overhead.

    “More generally, AQC has been proved to be universal for quantum computing, being equivalent to the standard circuit model of quantum computation up to polynomial resource-overhead15.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [15] Aharonov, D. et al. Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Journal of Computing 37, 166 (2007). source

      Not checked in the free run.

6 of 6
  • The paper relies on this without support.

    Decoherence effects can be avoided so that the superadiabatic gates are deterministically implemented.

    “Moreover, the gates will be deterministically implemented with probability one as long as decoherence effects can be avoided.”
  • The authors state this as an assumption.

    The quantum system is closed for the quantum speed limit analysis.

    “We will consider a closed quantum system evolving between arbitrary pure states and .”
2 of 2

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Santos and Sarandy showed that shortcuts to adiabaticity for quantum gates can perform operations faster, at increasing energetic cost.

    “This natural conclusion has recently been shown more explicitly by Santos and Sarandy [97]-wherein by developing shortcuts to adiabaticity that achieve quantum gates, they showed that these operations can be performed faster, however this is accompanied by an increasing energetic cost.”

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. Wang, W., Cao, H., Lu, L. & Yu, B. An upper bound for the generalized adiabatic approximation error with a superposition initial state. Sci China - Phys. Mech. Astron. 58, 030001 (2015).
  2. Nielsen, M. A. & Chuang, I. L. Quantum computation and quantum information. Cambridge University Press, Cambridge (2000).
  3. Mandelstam, L. & Tamm, I. G. The uncertainty relation between energy and time in non-relativistic quantum mechanics. J. Phys. (Moscow) 9, 249 (1945).
  4. Shi Y. Y. Both Toffoli and Controlled-NOT need little help to do universal quantum computation. Quantum Inf. Comp. 3, 84 (2003).

Cited by

Sorted by citations

Authors
Santos, A. C., & Sarandy, M. S.
Affiliations
  • Universidade Federal Fluminense (BR)
  • University of Southern California (US)
Corresponding author
  • Santos, Alan C.
  • Sarandy, Marcelo S.
Venue
Scientific Reports
Published
2015-10-29
Volume
5
Issue
1
Pages
15775-15775
ISSN
2045-2322 (ISSN-L)
OpenAlex
W2276020317
Cited by
125
References
41
Citations by year
2026: 4 · 2025: 8 · 2024: 4 · 2023: 11 · 2022: 13 · 2021: 11 · 2020: 8 · 2019: 17 · 2018: 15 · 2017: 17 · 2016: 17
FWCI
16.01
Type
journal article
Language
en
Open access
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • arXiv (Cornell University) (publishedVersion)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (cc-by)
  • Greater South Information System
Funders
  • University of Southern California
  • Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
  • Conselho Nacional de Desenvolvimento Científico e Tecnológico
  • Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro
  • Instituto Nacional de Ciência e Tecnologia de Informação Quântica
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
shortcuts to adiabaticity, universal quantum computation, quantum gates, quantum speed limit, quantum control

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-06.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-06.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review