Cited by 21Quantum many-body systemsQuantum Information and CryptographyQuantum Computing Algorithms and Architecture

The quantum speed limit

Open access
Giovannetti, Vittorio, Lloyd, Seth, Maccone, Lorenzo·2003·SPIE Proceedings

Abstract

How fast can a quantum system evolve? We answer this question focusing on the role of entanglement and interactions among subsystems. In particular, we analyze how the order of the interactions shapes the dynamics.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1117/12.507486

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Giovannetti, Lloyd, and Maccone numerically established that for time-independent Hamiltonians the quantum speed limit time is τ_QSL = max(ΔH L, (2/π)⟨H⟩ L^2).

    “For time-independent Hamiltonians Giovannetti, Lloyd, and Maccone [71][72][73] established numerically that the quantum speed limit time has to be given by τ QSL = max ∆H L (ρ 0 , ρ τ ) , 2 π H L 2 (ρ 0 , ρ τ ) .(34)”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [5]5. V. Giovannetti, S. Lloyd, and L. Maccone Eprint quant-ph/0210197 , 2002. · arXiv
  2. [6]6. V. Giovannetti, S. Lloyd, and L. Maccone Eprint quant-ph/0206001 , 2002. · arXiv

Cited by

Sorted by citations

Authors
Giovannetti, V., Lloyd, S., & Maccone, L.
Affiliations
Massachusetts Institute of Technology (US)
Venue
SPIE Proceedings
Publisher
SPIE
Published
2003-05-16
Volume
5111
Pages
1
ISSN
0277-786X (ISSN-L)
OpenAlex
W2156326557
Cited by
21
References
1
Citations by year
2025: 2 · 2024: 1 · 2023: 1 · 2022: 2 · 2019: 1 · 2018: 1 · 2017: 3 · 2016: 2 · 2014: 1 · 2013: 1 · 2012: 1
FWCI
5.59
Type
conference paper
Language
en
Open access
Locations
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • Scuola Normale Superiore di Pisa (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
quantum speed limit, quantum dynamics, entanglement, subsystem interaction, interaction order, quantum evolution

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.

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