Cited by 37Quantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and Architecture

Tight upper bound of the maximum speed of evolution of a quantum state

Open access
Chau, H. F.·2010·Physical Review A

Abstract

I report a tight upper bound of the maximum speed of evolution from one quantum state $\ensuremath{\rho}$ to another ${\ensuremath{\rho}}^{\ensuremath{'}}$ with fidelity $F(\ensuremath{\rho},{\ensuremath{\rho}}^{\ensuremath{'}})$ less than or equal to an arbitrary but fixed value under the action of a time-independent Hamiltonian. Since the bound is directly proportional to the average absolute deviation from the median of the energy of the state $\mathcal{D}E$, one may interpret $\mathcal{D}E$ as a meaningful measure of the maximum information-processing capability of a system.

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.1103/physreva.81.062133

Cites

8 of 8 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?

  • Entanglement can speed up time evolution in multipartite systems.

    “Furthermore, it was recognized [5] that entanglement can speed up time evolution in multipartite systems.”

    From Kind of entanglement that speeds up quantum evolution (2012) · cites this paper as [5]

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

Cited by

Sorted by citations

Authors
Chau, H. F.
Affiliations
University of Hong Kong (HK)
Corresponding author
Chau, H. F.
Venue
Physical Review A
Published
2010-06-30
Volume
81
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2043060172
Cited by
37
References
8
Citations by year
2026: 1 · 2025: 1 · 2024: 2 · 2023: 5 · 2022: 5 · 2021: 2 · 2019: 1 · 2018: 1 · 2017: 1 · 2016: 4 · 2015: 4 · 2014: 2 · 2013: 4 · 2012: 3
FWCI
2.71
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • The HKU Scholars Hub (University of Hong Kong) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • 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
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
quantum state evolution, upper bounds, fidelity, time-independent Hamiltonian, information processing skills, 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.

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