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

The DOI matches its Crossref record; 13 of the 25 references it cites were found in a registry or an index, and 12 are not checked yet; none of the 6 sources its claims cite is checked for support yet.

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.

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

Overview

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.

Verification

Claims the paper makes

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

Show all 19 claims

  • It may state two separate claims as one. 4
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?

Citations

Cites

Flagged first, then by citations

Show all 25 references

Cited by

Sorted by citations

Items 201–300 of 508

Metadata

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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › 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.

A language model drew the claims from the paper on 2026-10-06, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-06 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

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