Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 78 of the 89 references it cites were found in a registry or an index; 37 of the 67 sources its claims cite were checked for support.

Tight, robust, and feasible quantum speed limits for open dynamics

Open access

Abstract

Starting from a geometric perspective, we derive a quantum speed limit for arbitrary open quantum evolution, which could be Markovian or non-Markovian, providing a fundamental bound on the time taken for the most general quantum dynamics. Our methods rely on measuring angles and distances between (mixed) states represented as generalized Bloch vectors. We study the properties of our bound and present its form for closed and open evolution, with the latter in both Lindblad form and in terms of a memory kernel. Our speed limit is provably robust under composition and mixing, features that largely improve the effectiveness of quantum speed limits for open evolution of mixed states. We also demonstrate that our bound is easier to compute and measure than other quantum speed limits for open evolution, and that it is tighter than the previous bounds for almost all open processes. Finally, we discuss the usefulness of quantum speed limits and their impact in current research.

Overview

CoChat Summary

TL;DR

The paper derives a geometric quantum speed limit (QSL) for arbitrary open quantum dynamics using generalized Bloch vectors and the Hilbert-Schmidt norm, yielding a bound that is robust under composition and mixing. It argues this bound is tighter and more feasible than several existing open-dynamics QSLs for almost all processes.

Key findings

  • The proposed bound is \(T_D = \|\rho-\sigma\| / \overline{\|\dot{\rho}_t\|}\), where the numerator is the Hilbert-Schmidt norm between initial and final states and the denominator is the orbit-averaged speed.
  • The bound is robust under composition and under mixing: it is invariant under pure depolarization when the dynamics satisfies \(\dot{\rho}'_t = \dot{\rho}_t\), including unitary and unital maps, and more generally for completely positive maps with a fixed point.
  • Analytically, \(T_D\) is tighter than Sun’s, Del Campo’s, and Deffner’s bounds for all allowed \(\rho,\sigma\) (Deffner’s under the condition that one state is pure). Numerically, it outperforms Mondal’s bound in 94% of 5000 sampled orbits, with average difference \(0.56 \pm 0.28\) (the text also reports \(0.57 \pm 0.28\) earlier).
  • Feasibility is improved because the distance depends only on the overlap \(\mathrm{tr}[\rho\sigma]\), measurable via controlled-SWAP, and the speed can be estimated from finite-time increments using Eq. (12).

Methods

  • Theoretical derivation: states are represented as generalized Bloch vectors; the distance \(D(\rho,\sigma)=\|r-s\|_2=\sqrt{d/(d-1)}\|\rho-\sigma\|_{\mathrm{HS}}\) is used to derive the QSL from the inequality between geodesic distance and path length.
  • The paper analyzes the bound’s form for unitary evolution, Lindblad dynamics (pure dephasing, pure depolarization, purity change), memory-kernel/Nakajima-Zwanzig dynamics, and underlying system-environment unitary evolution.
  • Numerical comparison: 5000 orbits sampled from Haar-random total Hamiltonians \(H\), environment states \(\gamma_E\), and initial system states \(\rho_0\), with system/environment dimensions uniformly sampled between 2 and 10 and \(\tau=1\); additionally, \(3\times10^6\) initial/final states from Bures and Ginibre ensembles are used to compare with Deffner’s bound.

Limitations

  • The paper states that an attainable speed limit for arbitrary processes is yet to be found.
  • The derivation lower-bounds the true geodesic distance by the Euclidean straight-line distance in the generalized Bloch ball, so the bound intrinsically underestimates the actual optimal evolution time; using triangle inequalities or temporal discretization for memory kernels further reduces tightness.
  • The comparison with Mondal’s bound is numerical and sampled, not exhaustive; the text also notes that Pires’s infinite family of bounds is disregarded from direct comparison.

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

Integrity signals

Registry

Crossref · 10.22331/q-2019-08-05-168

Cites

78 of 78 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Figure 1 Distance on the space of states. Mixed states ρ and σ are represented by their generalized Bloch vectors r and s . In order to simplify the evaluation of the distance D between states we approximate the state space with such ( d 2 -1) -dimensional ball. Accordingly, for the case of unitary evolution ( a ) we choose to measure the distance between ρ and σ as the length of the arc of great circle that connects r and s , given by the product between the generalized Bloch angle Θ between the two vectors, and their length ‖ r ‖ 2 . For the case of arbitrary non-unitary evolution ( b ), we use, instead, the norm of the displacement vector r -s , since the shortest path that connects the two states is given by the straight line (hyper-spheres here schematically represented as 2-spheres).
Figure 1 Distance on the space of states. Mixed states ρ and σ are represented by their generalized Bloch vectors r and s . In order to simplify the evaluation of the distance D between states we approximate the state space with such ( d 2 -1) -dimensional ball. Accordingly, for the case of unitary evolution ( a ) we choose to measure the distance between ρ and σ as the length of the arc of great circle that connects r and s , given by the product between the generalized Bloch angle Θ between the two vectors, and their length ‖ r ‖ 2 . For the case of arbitrary non-unitary evolution ( b ), we use, instead, the norm of the displacement vector r -s , since the shortest path that connects the two states is given by the straight line (hyper-spheres here schematically represented as 2-spheres).CC-BY · From the PDF
Figure 2 Robustness of T D under pure depolarization. Bound T D , expressed in Eq. (4) , is invariant under the effect of a pure depolarization channel D ϵ : ρ → ρ ′ = ϵρ + 1 -ϵ d 1 , applied to initial and final state, as long as the dynamics satisfies ˙ ρ ′ t = ϵ ˙ ρ t . In this figure r and s are the generalized Bloch vectors associated with some initial and final states ρ and σ , respectively. Accordingly, ϵ r = r ′ and ϵ s = s ′ represent the initial and final states under the effect of the pure depolarization channel D ϵ , while r t and ϵ r t represent the evolved states ρ t and ρ ′ t , respectively. In terms of the GBV, the condition for robustness can be expressed as ˙ r ′ t = ϵ ˙ r t . ( a ) Unitary evolution trivially satisfies this condition, since it preserves the length of the GBV. ( b ) More generally, all unital maps, i.e., maps that preserve the identity, also satisfy the condition for invariance. In terms of the GBV, the condition for invariance simply reduces to r ′ t = ϵ r t . Similar geometric arguments can be made if we consider completely positive maps with an arbitrary fixed point φ , where the robustness is guaranteed under mixing with φ .
Figure 2 Robustness of T D under pure depolarization. Bound T D , expressed in Eq. (4) , is invariant under the effect of a pure depolarization channel D ϵ : ρ → ρ ′ = ϵρ + 1 -ϵ d 1 , applied to initial and final state, as long as the dynamics satisfies ˙ ρ ′ t = ϵ ˙ ρ t . In this figure r and s are the generalized Bloch vectors associated with some initial and final states ρ and σ , respectively. Accordingly, ϵ r = r ′ and ϵ s = s ′ represent the initial and final states under the effect of the pure depolarization channel D ϵ , while r t and ϵ r t represent the evolved states ρ t and ρ ′ t , respectively. In terms of the GBV, the condition for robustness can be expressed as ˙ r ′ t = ϵ ˙ r t . ( a ) Unitary evolution trivially satisfies this condition, since it preserves the length of the GBV. ( b ) More generally, all unital maps, i.e., maps that preserve the identity, also satisfy the condition for invariance. In terms of the GBV, the condition for invariance simply reduces to r ′ t = ϵ r t . Similar geometric arguments can be made if we consider completely positive maps with an arbitrary fixed point φ , where the robustness is guaranteed under mixing with φ .CC-BY · From the PDF
Figure 3 Relative tightness of QSL bounds. ( a ) Analytic comparison of bounds from Refs. [48-50] with T D , introduced in Eq. (4) , for the arbitrary evolution between ρ = ρ 2 , and σ , expressed as the ratio between the considered QSL T Author and T D as a function of tr[ ρσ ] (which for ρ 2 = ρ also determines tr[( ρσ ) 2 ] ), as specified in the legend, and where T ⋆ Deffner ≥ T Deffner (see Eq. (21) in Appendix B for details). The three insets represent three different choices of purity tr[ σ 2 ] for the final state, from left to right tr[ σ 2 ] ∼ 0 , tr[ σ 2 ] = 0 . 25 , tr[ σ 2 ] = 1 . Note that, since the dimension d of the system sets a bound for the minimal value 1 /d of tr[ ρ 2 ] , the central inset is meaningful from d ≥ 4 , while the left one is to be used in the limit of large d . ( b ) Numerical estimation of relative tightness between T D and T Mondal , obtained sampling 5000 orbits from Haar-randomly distributed H , γ E , and ρ 0 , as described in section 6. The dimension of the system's and environment's Hilbert spaces is uniformly sampled between 2 and 10 . The tightness is measured using the parameter X = T D -T Mondal , which is bounded between -1 and 1 , given that the evolution is carried for a unit time τ = 1 , and that both bounds have to be smaller than the evolution time τ . The probability P ( X ≥ 0) for our bound to be better than Mondal's is equal to 0 . 94 , with an average difference µ = 0 . 56 ± 0 . 28 .
Figure 3 Relative tightness of QSL bounds. ( a ) Analytic comparison of bounds from Refs. [48-50] with T D , introduced in Eq. (4) , for the arbitrary evolution between ρ = ρ 2 , and σ , expressed as the ratio between the considered QSL T Author and T D as a function of tr[ ρσ ] (which for ρ 2 = ρ also determines tr[( ρσ ) 2 ] ), as specified in the legend, and where T ⋆ Deffner ≥ T Deffner (see Eq. (21) in Appendix B for details). The three insets represent three different choices of purity tr[ σ 2 ] for the final state, from left to right tr[ σ 2 ] ∼ 0 , tr[ σ 2 ] = 0 . 25 , tr[ σ 2 ] = 1 . Note that, since the dimension d of the system sets a bound for the minimal value 1 /d of tr[ ρ 2 ] , the central inset is meaningful from d ≥ 4 , while the left one is to be used in the limit of large d . ( b ) Numerical estimation of relative tightness between T D and T Mondal , obtained sampling 5000 orbits from Haar-randomly distributed H , γ E , and ρ 0 , as described in section 6. The dimension of the system's and environment's Hilbert spaces is uniformly sampled between 2 and 10 . The tightness is measured using the parameter X = T D -T Mondal , which is bounded between -1 and 1 , given that the evolution is carried for a unit time τ = 1 , and that both bounds have to be smaller than the evolution time τ . The probability P ( X ≥ 0) for our bound to be better than Mondal's is equal to 0 . 94 , with an average difference µ = 0 . 56 ± 0 . 28 .CC-BY · From the PDF
Figure 4 ( a ) The fraction of processes (quantified by their end points) for which T D outperforms an upper bound on T ⋆ Deffner , calculated as the ratio of the parameter space spanned by tr[ ρσ ] and tr[ ρσρσ ] for which T D ≥ T Deffner . A general rule of thumb to evaluate the relative tightness between bound T D in Eq. (4) and Deffner's bound is given by tr[ σ 2 ] ≥ 1 -tr[ ρ 2 ] ⇒ T D ≳ T Deffner . Since tr[ ρ 2 ] , tr[ σ 2 ] ≥ 1 /d , the region where T D outperforms Deffner's bound is always larger than that where the converse holds, as shown by the red dashed lines delimiting the physical region for d = 2 , 3 , 4 (see Appending C for details). ( b ) Numerical estimation of relative tightness between T D and T Deffner , obtained sampling 3 · 10 6 initial and final states from the Bures and the Ginibre ensembles. Bound T D is almost always tighter than T Deffner .
Figure 4 ( a ) The fraction of processes (quantified by their end points) for which T D outperforms an upper bound on T ⋆ Deffner , calculated as the ratio of the parameter space spanned by tr[ ρσ ] and tr[ ρσρσ ] for which T D ≥ T Deffner . A general rule of thumb to evaluate the relative tightness between bound T D in Eq. (4) and Deffner's bound is given by tr[ σ 2 ] ≥ 1 -tr[ ρ 2 ] ⇒ T D ≳ T Deffner . Since tr[ ρ 2 ] , tr[ σ 2 ] ≥ 1 /d , the region where T D outperforms Deffner's bound is always larger than that where the converse holds, as shown by the red dashed lines delimiting the physical region for d = 2 , 3 , 4 (see Appending C for details). ( b ) Numerical estimation of relative tightness between T D and T Deffner , obtained sampling 3 · 10 6 initial and final states from the Bures and the Ginibre ensembles. Bound T D is almost always tighter than T Deffner .CC-BY · From the PDF

Verification

Claims the paper makes

18 Valid · 4 Not valid · 24 Not checked · 74 Own results and interpretations

61 more claims · 14 with their cited sources checked

Create a free account to see all 120 claims and to verify the 13 references still open.

See all claims — free account
  • It may state two separate claims as one. 42
  • The quote only partly states this claim. 3
  • Probably not a substantial claim. 11

Create a free account to see these claims.

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?

Self-check

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

Each contradiction between two passages listed here was confirmed by an independent check.

2 of 2

Citations

Cites

Show all 89 references

Research works printed but not linked: 2

  1. G. Fubini, ``Sulle metriche definite da una forma Hermitiana,'' Atti Istit. Veneto 63, 502 (1904).
  2. E. Study, ``Kürzeste Wege im komplexen Gebiet,'' Math. Ann. 60, 321 (1905).

Cited by

See all 93

Metadata

Authors
Campaioli, F., Pollock, F. A., & Modi, K.
Affiliations
Monash University (AU)
Venue
Quantum
Published
2019-08-05
Volume
3
Pages
168
ISSN
2521-327X (ISSN-L)
OpenAlex
W2965682822
Cited by
92
References
89
Citations by year
2026: 4 · 2025: 17 · 2024: 11 · 2023: 14 · 2022: 15 · 2021: 15 · 2020: 10 · 2019: 6
FWCI
5.31
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • Monash University Research Portal (Monash University) (publishedVersion, other-oa)
  • arXiv (Cornell University) (submittedVersion)
  • RMIT Research Repository (RMIT University Library) (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Figshare (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
Australian Research Council (FT160100073)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum speed limit, open quantum dynamics, non-Markovian dynamics, Markovian dynamics, mixed states, Lindblad dynamics, memory kernel

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

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

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

Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Tight, robust, and feasible quantum speed limits for open dynamics. https://app.cochat.ai/papers/10.22331/q-2019-08-05-168
The paper
Campaioli, F., Pollock, F. A., & Modi, K. (2019). Tight, robust, and feasible quantum speed limits for open dynamics. Quantum. https://doi.org/10.22331/q-2019-08-05-168

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.