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

Optimal Control at the Quantum Speed Limit

Open access
Caneva, T., Murphy, M., Calarco, T., Fazio, R., Montangero, S., Giovannetti, V., Santoro, G. E.·2009·Physical Review Letters

Abstract

Optimal control theory is a promising candidate for a drastic improvement of the performance of quantum information tasks. We explore its ultimate limit in paradigmatic cases, and demonstrate that it coincides with the maximum speed limit allowed by quantum evolution.

Verified 2026-10-06 · 12 references not checked yet

AI snapshot

Written from the paper’s full text.

TL;DR

The paper shows that Krotov quantum optimal control can reach the quantum speed limit: infidelity converges to zero only when the fixed total time \(T\) exceeds a critical \(T_{\mathrm{QSL}}\), and this threshold agrees with dynamical bounds in Landau-Zener and spin-chain state-transfer models. It suggests optimal control can operationally characterize quantum speed limits in complex systems.

Key findings

  • In the Landau-Zener model, Krotov infidelity does not converge to zero for \(T < T_{\mathrm{QSL}} \approx 1.5688\) (units of \(\hbar/\omega\)), while for \(T\) above this value it decreases exponentially; the second-derivative criterion crosses zero near \(T \approx 1.58\), matching the time-independent Bhattacharyya estimate with no fitting parameters.
  • For Heisenberg spin-chain state transfer, infidelity converges to zero only above a critical time; the numerical \(T^*_{\mathrm{QSL}}\) scales linearly with chain length \(N\) (intercept \(b \sim 1.53\)), and for \(N=101\), target infidelity \(I^* = 5 \times 10^{-5}\) at \(n=10^5\) iterations gives \(T=56.66 \approx T^*_{\mathrm{QSL}}\) versus \(T=68.97\).
  • Spin-chain optimal control improves the transfer time over the adiabatic approach of Ref. [18] by up to two orders of magnitude and is faster than Ref. [19] for Ising coupling, using only single-site local pulses whereas Ref. [19] used global pulses.
  • The numerical spin-chain \(T^*_{\mathrm{QSL}}\) exceeds the analytical QSL estimate by a factor \(\eta \approx 3\), attributed to difficulty in formulating the QSL for the many-body problem; both estimators scale linearly with \(N\).

Methods

  • Uses the Krotov recursive optimal-control algorithm to minimize infidelity \(I = 1 - |\langle \psi(T)|\psi_G\rangle|^2\) for fixed duration \(T\), starting from initial guess control pulses and analyzing convergence as a function of iteration number \(n\) and \(T\).
  • Applies the approach to two models: a Landau-Zener Hamiltonian with control \(\Gamma(t)\), preparing the instantaneous ground state and targeting the ground state with \(\Gamma(T)=-\Gamma(0)\); and a one-dimensional Heisenberg spin chain with parabolic magnetic potential controls \(C(t)\) and \(d(t)\), transferring \(|0\rangle\) to \(|N-1\rangle\) in the single-spin-up sector.
  • Compares numerical \(T_{\mathrm{QSL}}\) estimates with dynamical bounds: the Bhattacharyya bound for the Landau-Zener case, and time-averaged energy-spread bounds \(\Delta E_1\), \(\Delta E_2\) for the spin chain, with \(T_{\mathrm{QSL}}/(N-1) \ge \max\{\pi/(2\Delta E_1); \pi/(2\Delta E_2)\}\).

Limitations

  • The paper states that for the spin-chain model the sign of the second derivative of infidelity cannot be used as a reliable signature of \(T_{\mathrm{QSL}}\), so the numerical estimate uses the smallest \(T\) achieving a target infidelity threshold \(I^*\) in a fixed number of iterations; the result does not depend significantly on \(I^*\) and \(n\).
  • The paper attributes the factor \(\eta \approx 3\) discrepancy between numerical and analytical spin-chain QSL estimates to the difficulty in formulating the quantum speed limit for the many-body problem.
  • Evident from the text: the findings are demonstrated in two paradigmatic models with Krotov optimal control and fixed \(T\), not as a general proof for arbitrary systems or control constraints; the Landau-Zener analytical estimate also assumes the dynamics can be effectively described by a time-independent Hamiltonian for most of the evolution.

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

Integrity signals

Registry

Crossref · 10.1103/physrevlett.103.240501

Cites

13 of 25 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

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

  • Findingown data
    § Optimal Control at the Quantum Speed Limit · p. 4

    For the spin-chain model, the energy spread ∆E2(t) is almost constant except near the final time, where large oscillations occur corresponding to deceleration of the spin wave.

    “The energy spread is almost constant save near the final time, where large oscillations are present, corresponding to the deceleration of the spinwave.”
    Quote in the paperNot a substantial claim
  • Findingown data
    § Optimal Control at the Quantum Speed Limit · p. 4

    For the spin-chain model, the average energy spreading ∆E2(t) is larger for smaller transfer time T, allowing for a higher average excitation velocity.

    “The average energy spreading ∆ E 2 ( t ) is larger for smaller time transfer T allowing for a higher average excitation velocity.”
    Quote in the paperSubstantial claim
  • Findingown data
    § Optimal Control at the Quantum Speed Limit · p. 2

    For the Landau-Zener model, when T is at or above T_QSL, the infidelity decreases exponentially with the number of Krotov iterations.

    “On the contrary, by progressively increasing T towards and above T QSL , the curvature changes sign and the infidelity in the large iteration limit decreases exponentially , as confirmed by the fit in Fig. 1.”
    Quote in the paperSubstantial claim
  • Findingcitation
    § Optimal Control at the Quantum Speed Limit · p. 2

    For the Landau-Zener model, the initial guess pulse Γ_gs(t) being almost constantly zero for most of the central part of the evolution is preserved by the recursive optimization of optimal control.

    “Remarkably, the peculiar feature of the initial guess Γ gs ( t ) of being almost constantly zero for most of the central part of the evolution is preserved by the recursive optimization of OC [2]”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [2] V. F. Krotov, Global Methods in Optimal Control Theory (Marcel Dekker, New York, 1996).

      Not checked in the free run.

  • Findingown data
    § Optimal Control at the Quantum Speed Limit · p. 3

    For the spin-chain model, the infidelity converges to zero only for transfer times T above a critical time T_QSL.

    “In particular, as shown in Fig. 3 (left) the infidelity appears to converge to zero only for values of T that are above a certain critical time T QSL .”
    Quote in the paperSubstantial claim
  • May combine two claims. 4
  • May combine two claims.

    Findingown data
    § Optimal Control at the Quantum Speed Limit · p. 4

    For the spin-chain model, both the numerical T*_QSL and the analytical QSL estimate are linearly dependent on N, but the numerical results show an improvement over the theoretical prediction by a factor of η ≈ 3.

    “The results are reported in Fig.4 (right) where the two quantities are compared: both estimators are linearly dependent on N , but the numerical results show an improvement over the theoretical prediction by a factor of η ≈ 3”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingcitation
    § Optimal Control at the Quantum Speed Limit · p. 4

    The optimal control method uses only single-site local pulses, whereas the method in Ref. [19] used global pulses operating jointly on the whole chain.

    “Interestingly enough, however, our method only uses single-site local pulses while in Ref. [19] this was achieved using global pulses that operate jointly on the whole chain.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [19] N. Khaneja and S. J. Glaser, Phys. Rev. A 66 , 060301(R) (2002). source

      Not checked in the free run.

  • May combine two claims.

    Study design and conductnone given
    § Optimal Control at the Quantum Speed Limit · p. 3

    For the spin-chain model, a numerical estimate T*_QSL can be obtained as the smallest time T that achieves the target infidelity threshold I* in a fixed number of iterations n, and the result does not depend significantly on I* and n.

    “Nonetheless, a numerical estimate T ∗ QSL for such quantity can been obtained by considering the smallest time T which allows us to achieve the target infidelity threshold I ∗ in a fixed number of algorithm iterations n (the result does not depend significantly on the value of I ∗ and n ).”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data
    § Optimal Control at the Quantum Speed Limit · p. 4

    Optimal control finds a solution x_opt(t) that initially accelerates the spin excitation, then transfers it with constant velocity up to the end of the chain, where deceleration occurs.

    “The picture that arises is that OC finds a solution x opt ( t ) that initially accelerates the spin excitation, and then transfers it with constant velocity up to the end of the chain, where deceleration occurs.”
    Quote in the paperNot a substantial claim
4 of 4
  • The authors state this as an assumption.

    For the Landau-Zener model, the dynamics for most of the evolution can be approximated by the time-independent Hamiltonian H0 = H[Γ=0].

    “assuming H 0 = H [Γ = 0] as the Hamiltonian.”
    “for most of the evolution time the dynamics can be effectively described by a time-independent Hamiltonian”
1 of 1

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?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Caneva, T., Murphy, M., Calarco, T., Fazio, R., Montangero, S., Giovannetti, V., & Santoro, G. E.
Affiliations
  • Scuola Internazionale Superiore di Studi Avanzati (IT)
  • Universität Ulm (DE)
  • Scuola Normale Superiore (IT)
  • The Abdus Salam International Centre for Theoretical Physics (ICTP) (IT)
Venue
Physical Review Letters
Published
2009-12-07
Volume
103
Issue
24
Pages
240501-240501
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2160409148
Cited by
509
References
25
Citations by year
2026: 22 · 2025: 41 · 2024: 47 · 2023: 41 · 2022: 46 · 2021: 32 · 2020: 36 · 2019: 32 · 2018: 26 · 2017: 29 · 2016: 35 · 2015: 34 · 2014: 29 · 2013: 18 · 2012: 15
FWCI
14.80
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • PubMed (publishedVersion)
  • SDL (submittedVersion)
  • Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) (submittedVersion)
  • Scuola Normale Superiore di Pisa (submittedVersion, cc-by)
  • Padua Research Archive (University of Padova) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
optimal control, quantum speed limit, quantum control, quantum information processing, quantum dynamics

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