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
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
Items 301–400 of 406
Optimal discrimination of mixed states: the quantum Chernoff boundPreprint
Calsamiglia, J., Masanes, L., Muñoz-Tapia, R., Acín, A., & Bagán, E. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0609136 · Cited by 2
Wickert, R., & van Loock, P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.0279 · Cited by 2
Conclusive exclusion of quantum states and aspects of thermo-majorization
Perry, C. (2016) · UCL Discovery (University College London) · Cited by 2
Quantum Reference Frames and The Poincaré Symmetry
Kabernik, O. (2014) · UWSpace (University of Waterloo) · Cited by 2
Port-based teleportation of continuous quantum variables
Boisselle, J. (2014) · UWSpace (University of Waterloo) · Cited by 2
Polarization and Channel Ordering: Characterizations and Topological Structures
Nasser, R. (2017) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-7912 · Cited by 2
“It was shown in [49] that Pe(W ) ≤ (q−1)F (W ), where Pe(W ) is the probability of error of the optimal decoder ofW .”
BackgroundQuantum algorithms and learning theory
Arunachalam, S. (2018) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 2
Relations between different quantum Rényi divergencesPreprint
Iten, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.08327 · Cited by 2
Adaptive quantum codes: constructions, applications and fault tolerancePreprint
Jayashankar, A. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2203.03247 · Cited by 2
Bayesian retrodiction of quantum supermapsPreprint
Bai, G. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2408.07885 · Cited by 2
Gambs, S. (2008) · doi:10.71781/9975 · Cited by 2
Approximate Decoherence, Recoherence and Records in Isolated Quantum SystemsPreprint
Strasberg, P., Schindler, J., Wang, J., & Winter, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.19703 · Cited by 2
Simulation of Adjoints and Petz Recovery Maps for Unknown Quantum ChannelsPreprint
Zhu, C., Tang, Z., Zhen, G., Li, Y., Bai, G., & Wang, X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.05828 · Cited by 2
Local strategies are pretty good at computing Boolean properties of quantum sequencesPreprint
Gupta, T., Mohan, A., Murshid, S., Russo, V., Sikora, J., & Zheng, A. X. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.05452 · Cited by 2
“The bound then follows from Barnum and Knill’s theorem [32,33].”
InfluentialSchrödinger Bridges via the Hacking of Bayesian Priors in Classical and Quantum RegimesPreprint
Aw, C. C., & Sidajaya, P. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.18665 · Cited by 2
Wakaura, H., & Tanimae, T. (2026) · Research Square · doi:10.21203/rs.3.rs-9493052/v1 · Cited by 2
Onset of superactivation of quantum capacityPreprint
Parentin, M., Bergh, B., Datta, N., & Wilde, M. M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.27042 · Cited by 2
Barnum, H., & Knill, E. H. (2026) · Journal of Mathematical Physics · doi:10.1063/5.0325563 · Cited by 2
Self-citationCovariant Approximate Quantum Codes for Protected Analog ComputationPreprint
Elovenkova, M., Hu, H.-Y., & Yelin, S. F. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.07607 · Cited by 2
Maximal quantum leakage: operational interpretation and quantum channel analysisPreprint
Xiao, S., Zhao, Z., Zhu, J., & Farokhi, F. (2026) · arXiv (Cornell University) · Cited by 2
On the sample complexity of the generalized hidden shift problem over arbitrary finite groupsPreprint
Zhou, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.05828 · Cited by 2
“In the rest of this article, we may drop the error threshold ϵ and simply consider We first review the upper bound of k min given by Barnum-Knill’s pairwise-fidelity bound [1]: Corollary 4 (Montanaro [16]) .”
Impossibility of One-Way One-Round Quantum 4-Coloring via Matrix-Space StabilityPreprint
Gur, T., & Li, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.09091 · Cited by 2
Sharp pairwise reduction for quantum hypothesis testingPreprint
Lee, K.-Y., & Lami, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.28440 · Cited by 2
“Importantly, this bound is achieved by the standard PGM measurement, which is widely used in quantum information theory as a near-optimal estimation [15] and also has concrete optical realizations [19, 20].”
Computational Cryptography from PseudoentanglementPreprint
Ryzov, I., Goulão, M., Loulidi, F., & Elkouss, D. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.29917 · Cited by 2
“To upper-bound p ( b ) err(PGM) ( M λ ), we use the Gram matrix approach similar to [BK02, Mon07, Mon19].”
Universal quantum codingPreprint
Rizzo, J., Girardi, F., Lami, L., Eisert, J., & Leone, L. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.38038 · Cited by 2
Decomposition of Idempotent Operators on Hilbert C*-Modules
Luo, W. (2025) · Mathematics · doi:10.3390/math13152378 · Cited by 1
LIPIcs, Volume 310, TQC 2024, Complete Volume
Magniez, F., & Grilo, A. B. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2024 · Cited by 1
LIPIcs, Volume 350, TQC 2025, Complete Volume
Fefferman, B. (2025) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2025 · Cited by 1
Berrada, K., & Bougouffa, S. B. (2026) · Axioms · doi:10.3390/axioms15060431 · Cited by 1
Amirov, O., Çelik, N., & Karabacak, M. (2026) · International Journal of Theoretical Physics · doi:10.1007/s10773-026-06401-6 · Cited by 1
Tabletop reversibility of phase-covariant operations
Anonymous, & Hu, X. (2026) · Physical Review A · doi:10.1103/d25c-3tmg · Cited by 1
“This is particularly meaningful because the Petz map already plays a central role in quantum error correction: it is known to be near optimal for approximately correctable codes [7, 8].”
Twenty-one characterizations of reversible quantum channels
Li, N., Li, Y., Yang, H., & Luo, S. (2026) · Communications in Theoretical Physics · doi:10.1088/1572-9494/aeb9b7 · Cited by 1
“Given a quantum channel E : S ( H a ) → S ( H b ) and a quantum state γ ∈ S ( H a ), the action of the Petz recovery channel R Petz E ,γ : S ( H b ) → S ( H a ) on supp E ( γ ) is defined as [6, 7, 22, 38] for any state σ ∈ S (Π E ( γ ) H b ) .”
An upper bound on quantum capacity of unital quantum channels
Anshu, A. (2017) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2017.8277947 · Cited by 1
Quantum Bayes' rule affirming consistency in measurement inferences in quantum mechanics
Bera, M. L., & Bera, M. N. (2023) · Physical Review A · doi:10.1103/physreva.108.012224 · Cited by 1
A Simple and Tighter Derivation of Achievability for Classical-Quantum Channel Coding
Cheng, H. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206495 · Cited by 1
“Item (vii) in a special case of Tr[ A + B ] = 1 is an immediate consequence of the Barnum–Knill Theorem [30], [31, Theorem 3.10].”
BackgroundMethodInfluentialLIPIcs, Volume 158, TQC 2020, Complete Volume
Flammia, S. T. (2020) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2020 · Cited by 1
Oracle problems as communication tasks and optimization of quantum algorithms
Te’eni, A., Schwartzman-Nowik, Z., Nowakowski, M. L., Horodecki, P., & Cohen, E. (2026) · Physical Review Research · doi:10.1103/5qsb-5jy5 · Cited by 1
Emerging Paradigms in Quantum Error Correction and Quantum Cryptography
Doddamane, P. M. (2011) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/t8hp-7r18 · Cited by 1
Haar-random and pretty good measurements for Bayesian state estimationPreprint
Quadeer, M. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2310.20565 · Cited by 1
Energy-Scaled Zero-Noise Extrapolation for Gottesman-Kitaev-Preskill CodePreprint
Luo, G.-Z., & Otten, M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2512.03583 · Cited by 1
Transmitting Quantum Information Reliably across Various Quantum Channels
Ouyang, Y. (2013) · UWSpace (University of Waterloo) · Cited by 1
Spectral Codes: A Geometric Formalism for Quantum Error CorrectionPreprint
Kanno, S., & Shimada, Y.-A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.19765 · Cited by 1
Quantum Advantage for Coordinated Frequency Selection Against Distributed JammersPreprint
Wehner, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.20647 · Cited by 1
“This construction is precisely the Pretty Good Measurement [27, 28, 52], which reduces to the projective measurement in the L¨owdin basis when the Gram matrix is positive definite.”
Emergent Quantum Dynamics as a Bayesian Inference Problem: A Critical AnalysisPreprint
Rodrigues, T. B. S. F., Brugger, L. L., Valle, V. G., Rizzuti, B. F., & Duarte, C. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.04112 · Cited by 1
Quantum Darwinism and the quality of Petz recoveryPreprint
Torvinen, J., Keski-Vakkuri, E., & Pranzini, N. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.06848 · Cited by 1
“Petz recovery maps have been recently employed in many fields, from open system dynamics [27, 28], holography [29–33], and error correction in quantum computing [34–37] and, more generally, in any von Neumann algebra [38].”
Bias-Preserving Gates and Quantum Error Correction With Dual-Rail Cat CodesPreprint
Biswas, D., Sharma, N., Salvador, A., Wang, R., Granath, M., Udupa, A., & Ferrini, G. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.00786 · Cited by 1
“At the same time, the Petz map provides a reliable bound on the QEC performance, allowing us to infer the expected behaviour of the corresponding optimal recovery scheme [54, 57, 58].”
Recovery Algorithm for Correlated Errors in Permutation-Invariant Quantum CodesPreprint
Chandra, O., Ouyang, Y., Muraleedharan, G., & Brennen, G. K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.02346 · Cited by 1
“The problem of QER can be solved analytically us-ing the Barnum-Knill (BK) [33] recovery or Petz recovery scheme [34].”
Unifying quantum measurement constructions via a relative-entropy minimum change principlePreprint
Liu, N., & Wilde, M. M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.04055 · Cited by 1
“One conclusion of this finding is that there cannot exist a multiplicative constant relating the error probability of the Fermi–Dirac thermal measurement to that of the optimal measurement, as there does for the pretty good measurement [13].”
InfluentialApproximate Quantum Error Correction at Chiral Topological EdgesPreprint
Song, Y., Liu, Z., Wang, Z., Lee, J. Y., & Shi, B. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.06258 · Cited by 1
Global Precision Bounds and Success-Probability Guarantees in Quantum Parameter LearningPreprint
Belliardo, F., Gardner, J. W., Jiang, L., & Clerk, A. A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.15528 · Cited by 1
“(27) and (22); this is the same dashed curve as in panel (a).”
Error-Adaptive Quasi-local Decoding of the Toric CodePreprint
Dehghani, H., Gopalakrishnan, S., & Gullans, M. J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.27740 · Cited by 1
Entanglement Wedge Reconstruction Beyond the Large N Limit via the Twirled Petz MapPreprint
Shahmiri, A. A., Sharifian, M., & Vardian, N. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.07866 · Cited by 1
“This result has also been independently obtained by Barnum and Knill in [18].”
Monolithic Quantum Error Correction in the Presence of DistinguishabilityPreprint
Jain, S. P., Hudson, E. R., Campbell, W. C., Gorshkov, A. V., & Albert, V. V. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.26946 · Cited by 1
“We take ℛ to be the transpose, or Petz, recovery ℛ tr [30, 34–36], for two reasons.”
Pretty good shadow tomographyPreprint
Grewal, S., Pelecanos, A., Spilecki, J., Tang, E., & Wright, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.06781 · Cited by 1
“Using this, Harrow and Winter were able to take average-case lower bounds on the PGM shown by Barnum and Knill [BK02] and port them over to the worst-case setting.”
Quantum simultaneous decoding via pretty-good measurements of tilted statesPreprint
Wilde, M. M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.15955 · Cited by 1
One-shot entanglement generation and distillation via Petz recovery and binary hypothesis testingPreprint
Can, M., & Wilde, M. M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.31501 · Cited by 1
Optimal Control of Finite Dimensional Quantum SystemsPreprint
Mendonça, P. E. M. F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.2964
“orthogonal states after a general noise process [146].”
BackgroundInformation Amidst Noise: Preserved Codes, Error Correction, and Fault Tolerance in a Quantum World
Ng, H. K. (2009) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/mr2r-fh44
Fault-tolerance in two-dimensional topological systems
Anderson, J. T. (2012) · UNM’s Digital Repository (University of New Mexico)
Application of SDP to product rules and quantum query complexity
Mittal, R. (2011) · Rutgers University Community Repository (Rutgers University) · doi:10.7282/t3b27tmj
Achievability bounds on quantum state redistribution using convex split and position based decoding
Anshu, A., Jain, R., & Warsi, N. A. (2017) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2017.8277963
“We use the characterization given by Barnum and Knill [17] who showed the near optimality of this measurement.”
MethodQuantum Error Correction in the Presence of Initial System-Environment Correlations
Turkmen, A., & Verçin, A. (2020) · Open Systems & Information Dynamics · doi:10.1142/s1230161220500092
Milekhin, A. (2021) · SciPost Physics · doi:10.21468/scipost.report.3384
“The construction we present is known as “pretty good measurement” [45, 46, 47, 48], which we tailor to large N situation.”
BackgroundFrom Compression to Communication: Performance Limits for Quantum Networks
Atif, T. A. (2023) · Deep Blue (University of Michigan) · doi:10.7302/7353
Asymptotic Quantum State Discrimination for Mixtures of Unitarily Related States
Acevedo, A., & Wehr, J. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-05748-8_19
Adaptive Quantum Information Processing In Non-Equilibrium Environments
Danageozian, A. (2023) · Louisiana State University · doi:10.31390/gradschool_dissertations.6196
Causal classification of spatiotemporal quantum correlations in the absence of active interventions
Song, M. J. (2024) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/181399
Entropic uncertainty and entanglement dynamics in two superconducting qubits
Karam, F., Usman, K., Javed, M., & Musadiq, M. (2025) · International Journal of Quantum Information · doi:10.1142/s0219749925500200
Sequential measurement in quantum learning
Spencer-Wood, H. (2024) · Enlighten: Theses (The University of Glasgow) · doi:10.5525/gla.thesis.84375
Spectrum Broadcast Structures for Discrete and Continuous Variables in Open Quantum Systems
Acevedo, A., & Acevedo, A. (2023) · UA Campus Repository (The University of Arizona)
Transition from nonergodic to ergodic dynamics in an autonomous discrete time crystal
Sergeev, T. T., Zyablovsky, A. A., & Andrianov, E. S. (2026) · Physical Review A · doi:10.1103/cp9t-bwkv
Generalized entanglement of purification criteria for 2-producible states in multipartite systems
Jin, T., Zhang, Y.-R., & Fan, H. (2026) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ae5515
“…that the conditional mutual information I ( A : C | B ) of a pure state | ψ ⟩ ABCD is twice of the optimal quantum communication cost of the state redistribution [34, 50, 51], in which Alice (holding system A and D ) transfers the sys-tem A to Bob (holding the system B ) with a reference system C .”
Exact Law of Quantum Reversibility under Gaussian Pure LossPreprint
Fayad, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.19024
A weighted spectral quantum fidelity
Lê, C. T., Khoi, V. T., Toan, H. M., & Dinh, T. H. (2026) · Analysis and Mathematical Physics · doi:10.1007/s13324-026-01180-z
“Holevo introduced an alternative quantity in the 1970s, sometimes called the just-as-good fidelity or Holevo fidelity [17], which was later rediscovered under different names including the pretty-good fidelity [7], the A -fidelity [10], and the affinity [26].”
Nonclassical traits in multi-copy state discriminationPreprint
Achenbach, T., Leppäjärvi, L., Lee, H., & Heinosaari, T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.26647
“In particular, it was shown by [11] that for a given set of states { ϱ i } i ∈[ n ] , the average success probability can be lower bounded using the fidelity between states.”
Behera, B. K., Arango, A. C. G., Sergioli, G., & Giuntini, R. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.13150
“Among the various measurement strategies, the Pretty Good Measurement (PGM), also known as the square-root measurement, has received significant attention due to its near-optimal performance and analytical tractability [5], [6].”
All about quantum error correction: distillation, mitigation, self-correction and beyondPreprint
Wang, D. S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.14034
“A central result is that in this setting a near-optimal universal recovery scheme is the Petz map [3, 11, 18–20].”
那須, 亮. (2026) · Institutional Repositories DataBase (IRDB) · doi:10.14945/0002002327
Horizon-Restricted Leading Soft QED as Open Quantum SystemPreprint
Rey, S.-J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.07342
Combinatorial aspects of holographic quantum secret sharingPreprint
Bao, N., Furuya, K., & March, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.16110
Port-based teleportation under pure-dephasing decoherence
Bhati, R. S., Studziński, M., & Korbicz, J. K. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae917e
“As a remark, we note that one would be tempted to use the Knill-Barnum bound [48–50] to estimate P succ as in fact the former was derived with the help of the PGM.”
Contextual advantage implies limited distinguishability in any physical theoryPreprint
Baldijão, R. D., Barretto, F. A., & Korbicz, J. K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.26145
“In this context, general bounds on P guess , depending on the ensemble { ( p k , s k ) } k that characterizes the task, are extremely valuable; for example, in the case of quantum systems, the so-called ‘pretty good measurement’ provides a good approximation for P guess [36, 37].”
Quantum information lossPreprint
Fullwood, J., Guo, W.-Z., & Yang, B.-Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.05535
Zheng, A. (2026) · VTechWorks (Virginia Tech)
Techniques For Computing and Approximating Large Optimization Problems in Quantum Information
Mohan, A. (2026) · VTechWorks (Virginia Tech)
Gallager’s Random Coding Bound for Classical-Quantum Channels and Beyond
Liu, P.-C., & Cheng, H. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653968
“…coding bound is derived using the specialized α -weighted PGM for decoding, the standard PGM [29,30] can also be employed in practice, which benefits from an explicit quantum algorithm; applying it merely results in the prefactor c being doubled, as established by the Barnum–Knill theorem [53].”
Auditing Structured Randomness for Quantum Error Correction under a Bounded Cloud Fault ModelPreprint
Guo, Z., Lawrence, A., Wang, R., Kuang, R., & Pan, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.26600
“Petz entanglement fidelity F e scores preservation of half of a maximally entangled logical state after a fixed transpose recovery [50, 51], with F e = 1 denoting perfect recovery (Equation (18)).”
Structural perspectives from quantum states and measurements in optimal state discrimination
Cha, H., & Lee, J. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05335-6
“Although PGM does not in general achieve the optimal success probability, its performance falls within the following range [28, 29]: 3 Motivation: Sufficiency of pairwise fidelities for single-qubit pure states We provide backgrounds and establish notation.”
A semidefinite programming analysis of quantum bayesian solutions to the coarse-graining problem
Rodrigues, T. B. S. F. (2026) · doi:10.34019/ufjf/di/2026/00133
Localized charges, reset noise, and boundary memory in matrix-product-conserving quantum chainsPreprint
Rubin, R. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.23195
“5, Theorem 44] and Barnum–Knill [29].”
When Classical Correlations Certify Entanglement RecoveryPreprint
Utsumi, T., Tachibana, Y., Nakata, Y., Matsuura, T., Takagi, R., Buscemi, F., & Koashi, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.38168
A mixing time method for estimating the sample complexity of quantum state discriminationPreprint
Zhou, J., & Leditzky, F. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.40182
“The Barnum-Knill bound [8] provides an upper bound for the error probability of PGM by pairwise fidelities, which leads to a simple but generic upper bound for the sample complexity: Proposition 9 (Montanaro [39]) .”
Refined sample complexities from the tomographic rate functionPreprint
Grootveld, A., Maloney, A., Pollack, J., & Wu, P. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.40271
“This strategy is effective for distinguishing states, as [BK02] showed that for P ∗ the probability of distinguishing using the optimal strategy and P PGM the probability using PGM, that P PGM ≥ ( P ∗ ) 2 so that 1 − P PGM ≤ 2(1 − P ∗ ) .”
Quantum Error Correction and Holography, Krylov Complexity, and continuous Tensor Networks
Vardian, N. (2024) · SDL
Holography, localisation of information and subregions
BAHIRU, E. D. (2023) · SDL
What Must a Quantum-Memory Decoder Know About Temporally Correlated Noise?Preprint
Morales-Hashemi, D., Smith, G., & Cao, N. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.03545
“III and makes entanglement fidelity the standard objective of channel-adapted and robust recovery [32, 34, 42, 43].”
Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channelsPreprint
Mandal, A., Piveteau, C., Pfister, H. D., & Renes, J. M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.03674
“For heralded mixtures of symmetric PSCs, the error bound for the pretty good measurement in [ 38 ] gives P err ( W h ) ≤ ( d − 1 ) F ( W h ) for every h .”
Unitary RQL Equals RQLPreprint
Tupker, Q. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.06231
“These weights are related to Petz recovery [Pet86, Pet88, BK02, GLM + 22]; Section 3.1 explains the relation precisely.”
InfluentialPetz Recovery through a Single Polar Transformation for Approximate Quantum Error CorrectionPreprint
Zhao, H., & Xu, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.20515
“The performance of the Petz recovery map is controlled by near-optimality guarantees for entanglement fidelity [4, 9].”
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.