Reversing quantum dynamics with near-optimal quantum and classical fidelity
Open accessPublished version of a preprint
The DOI matches its Crossref record; 13 of the 14 references it cites were found in a registry or an index, and 1 are not checked yet.
Abstract
We consider the problem of reversing quantum dynamics, with the goal of preserving an initial state’s quantum entanglement or classical correlation with a reference system. We exhibit an approximate reversal operation, adapted to the initial density operator and the “noise” dynamics to be reversed. We show that its error in preserving either quantum or classical information is no more than twice that of the optimal reversal operation. Applications to quantum algorithms and information transmission are discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“For channels that are not perfectly reversible, the Petz map will not work perfectly.However, it still achieves very good performance, with an “average error” at most twice the optimal average error (using any recovery channel) [63].”
From Replica wormholes and the black hole interior (2022) · cites this paper as [63]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Their argument is based on the original result of Barnum and Knill [189], which shows that the Petz map is the near-optimal universal recovery map in terms of the average entanglement fidelity between the ideal and noisy states.”
From Holographic spacetime, black holes and quantum error correcting codes: a review (2022) · cites this paper as [189]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In the context of approximate QEC, the Petz map defined in Eq. ( 68) was shown to be a universal, near-optimal recovery map, where optimality was characterized using the average entanglement fidelity [189].”
From Holographic spacetime, black holes and quantum error correcting codes: a review (2022) · cites this paper as [189]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
The ‘transition probability’ in the state space of a—algebra
Uhlmann, A. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90060-4 · Cited by 1,649 · cited 1×
“An often used measure of overlap between density matrices is the Bures–Uhlmann fidelity [10, 11].”
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Self-citationPointer basis of quantum apparatus: Into what mixture does the wave packet collapse?
Zurek, W. H. (1981) · Physical Review D · doi:10.1103/physrevd.24.1516 · Cited by 1,257 · cited 2×
“Using a different orthonormal “pointer basis” [1] for the environment in Eq.”
Sending entanglement through noisy quantum channels
Schumacher, B. (1996) · Physical Review A · doi:10.1103/physreva.54.2614 · Cited by 823
Cryptographic distinguishability measures for quantum-mechanical states
Fuchs, C. A., & van de Graaf, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.761271 · Cited by 773 · cited 1×
“[2], Prop.”
A complete classification of quantum ensembles having a given density matrix
Hughston, L. P., Jozsa, R., & Wootters, W. K. (1993) · Physics Letters A · doi:10.1016/0375-9601(93)90880-9 · Cited by 649 · cited 1×
“…density matrices ρ j := p j ˆ ρ j so that ρ out = j ρ j is a normalized density operator, the PGM is defined by the set of operators consisting of the For pure states ρ j with ρ j ∝ | v j ⟩⟨ v j | , these are just the operators corresponding to the “ ρ -distorted” [9] states ρ − 1 / 2 out | v j ⟩ .”
Classical information capacity of a quantum channel
Hausladen, P., Jozsa, R., Schumacher, B., Westmoreland, M., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.1869 · Cited by 498 · cited 1×
“[8].”
Bures, D. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0236719-2 · Cited by 365
Information-theoretic approach to quantum error correction and reversible measurement
Nielsen, M. A., Caves, C. M., Schumacher, B., & Barnum, H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0160 · Cited by 110
Self-citationOn Asymptotically Optimal Hypothesis Testing in Quantum Statistics
Холево, А. С. (1979) · Theory of Probability and Its Applications · doi:10.1137/1123048 · Cited by 104
Quantum error detection .II. Bounds
Ashikhmin, A., Barg, A., Knill, E. H., & Litsyn, S. N. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841163 · Cited by 60 · cited 1×
“Comparing this method to R A ,ρ suggests itself as a fruitful path of investigation with applications to asymptotic bounds in quantum coding theory [12, 13].”
Self-citationQuantum error detection .I. Statement of the problem
Ashikhmin, A., Barg, A., Knill, E. H., & Litsyn, S. N. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841162 · Cited by 60 · cited 1×
“Comparing this method to R A ,ρ suggests itself as a fruitful path of investigation with applications to asymptotic bounds in quantum coding theory [12, 13].”
Self-citation
Research works printed but not linked: 3
- 1978, Theor. Probab. Appl., 23, 411
- 1969, Trans. Am. Math. Soc., 135, 199
- J. M. Ettinger , P. Hoyer, and E. Knill, ( 1999), Los Alamos arXiv.org Preprint Archive quant-ph/9901034. · arXiv
Cited by
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
Replica wormholes and the black hole interior
Penington, G., Shenker, S. H., Stanford, D., & Yang, Z. (2019) · arXiv · doi:10.48550/arxiv.1911.11977 · Cited by 809
“However, it still achieves very good performance, with an “average error” at most twice the optimal average error (using any recovery channel) [64].”
BackgroundReplica wormholes and the black hole interior
Penington, G., Shenker, S. H., Stanford, D., & Yang, Z. (2022) · Journal of High Energy Physics · doi:10.1007/jhep03(2022)205 · Cited by 807
“However, it still achieves very good performance, with an “average error” at most twice the optimal average error (using any recovery channel) [63].”
BackgroundEntropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Metadata
- Authors
- Barnum, H., & Knill, E.
- Affiliations
- Los Alamos National Laboratory (US)
- ORCID
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2002-05-01
- Volume
- 43
- Issue
- 5
- Pages
- 2097-2106
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W1976865215
- Cited by
- 280
- References
- 13
- Citations by year
- 2026: 18 · 2025: 23 · 2024: 19 · 2023: 16 · 2022: 18 · 2021: 21 · 2020: 16 · 2019: 6 · 2018: 15 · 2017: 18 · 2016: 14 · 2015: 10 · 2014: 12 · 2013: 8 · 2012: 6
- FWCI
- 2.77
- Type
- journal article
- Language
- en
- Update notices
- correction (2026-05-18)
- Open access
- green
- arxiv.org
- Locations
- Journal of Mathematical Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (9407194, 9722614)
- U.S. Department of Energy (W-7405, W-7405-ENG-36)
- Institute for Scientific Interchange
- University of California, Santa Barbara
- Office of Naval Research (N00014)
- 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 dynamics, quantum entanglement, classical correlations, fidelity, quantum algorithms, quantum information transfer
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
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.