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 101–200 of 406
Monotonicity of quantum relative entropy and recoverability
Berta, M., Lemm, M., & Wilde, M. M. (2015) · Quantum Information and Computation · doi:10.26421/qic15.15-16-5 · Cited by 42
“Given that the original inequalities without remainder terms have found wide use in quantum information theory, the refinements with remainder terms presented here might find use in some applications of the original inequalities, perhaps in the context of quantum error correction [1, 23, 27, 18, 16] or thermodynamics…”
BackgroundOh, C., Lee, C., Banchi, L., Lee, S., Rockstuhl, C., & Jeong, H. (2019) · Physical Review A · doi:10.1103/physreva.100.012323 · Cited by 42
Discrete-time classical and quantum Markovian evolutions: Maximum entropy problems on path space
Pavon, M., & Ticozzi, F. (2010) · Journal of Mathematical Physics · doi:10.1063/1.3372725 · Cited by 42
“Exploring the relations of our framework with the theory of quantum error correction [3, 30, 31, 44] appears to be a particularly promising research direction.”
BackgroundMethodResultInfluentialHow Many Copies are Needed for State Discrimination?
Harrow, A. W., & Winter, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2169544 · Cited by 42
“We invoke a result of Barnum and Knill [1] which says that, assuming a probability distribution on the state set, the average success probability is lower bounded as Manuscript received May 14, 2010; revised December 02, 2010; accepted August 27, 2011.”
BackgroundMethodInfluentialThe geometry of quantum learning
Hunziker, M., Meyer, D., Park, J., Pommersheim, J., & Rothstein, M. J. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0129-6 · Cited by 43
“2 Even when the diagonal of BC = (AC AC) is not constant, a result of Barnum and Knill [36] implies that the success probability is within a factor of 2 of the optimum.”
BackgroundTajima, H., Takagi, R., & Kuramochi, Y. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2206.11086 · Cited by 40
Simple and Tighter Derivation of Achievability for Classical Communication Over Quantum Channels
Cheng, H. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040330 · Cited by 39
“Property (vii) in a special case of Tr[ A + B ] = 1 is an immediate consequence of the Barnum–Knill Theorem [93], [86, Theorem 3.10].”
BackgroundMethodInfluentialPretty Good Measures in Quantum Information Theory
Iten, R., Renes, J. M., & Sutter, D. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2639521 · Cited by 40
“Analogous bounds are also known between the pretty good guessing probability and the optimal guessing probability [7] as well as between the pretty good and the optimal achievable singlet fraction [8].”
BackgroundA Parallel Repetition Theorem for Entangled Projection Games
Dinur, I., Steurer, D., & Vidick, T. (2014) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2014.28 · Cited by 39
A non-commutative Bayes' theorem
Parzygnat, A. J., & Russo, B. P. (2022) · Linear Algebra and its Applications · doi:10.1016/j.laa.2022.02.030 · Cited by 38
Quantum-Enhanced Barcode Decoding and Pattern Recognition
Banchi, L., Zhuang, Q., & Pirandola, S. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.064026 · Cited by 39
Work and reversibility in quantum thermodynamics
Alhambra, A. M., Wehner, S., Wilde, M. M., & Woods, M. P. (2018) · Physical Review A · doi:10.1103/physreva.97.062114 · Cited by 38
Structure of Sufficient Quantum Coarse-Grainings
Mosonyi, M., & Petz, D. (2004) · Letters in Mathematical Physics · doi:10.1007/s11005-004-4072-2 · Cited by 38
“This kind of dual was called transpose in [8] and makes appearance in several places, for example in connection with the best quantum recovery map [3], or in the theory of ConnesNarnhofer-Thirring dynamical entropy [8].”
BackgroundGeometric Measures of Quantum Correlations with Bures and Hellinger Distances
Spehner, D., Illuminati, F., Orszag, M., & Roga, W. (2017) · Quantum science and technology · doi:10.1007/978-3-319-53412-1_6 · Cited by 38
“The first statement is a consequence of Theorem 5 and of an upper bound on the probability of success in quantum state discrimination due to Barnum and Knill [11].”
BackgroundSecurity of Quantum Bit String Commitment Depends on the Information Measure
Buhrman, H., Christandl, M., Hayden, P. M., Lo, H., & Wehner, S. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.250501 · Cited by 38
Optimal lower bounds for quantum state tomographyPreprint
Scharnhorst, T., Spilecki, J., & Wright, J. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.07699 · Cited by 38
“The PGM is the measurement The PGM is in general not the optimal strategy for quantum hypothesis testing, but it is known that its success probability is always at least P , where P OPT is the best possible success probability [BK02].”
Machine learning for continuous quantum error correction on superconducting qubits
Convy, I., Liao, H., Zhang, S., Patel, S., Livingston, W. P., Nguyễn, H. N., Siddiqi, I. A., & Whaley, K. B. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac66f9 · Cited by 37
“frequency of these errors, such as dynamic decoupling [1], application of a penalty Hamiltonian [2], decoherence-free subspace encoding [3], and near-optimal recovery based on process tomography [4, 5].”
MethodOptimal approximate quantum error correction for quantum metrology
Zhou, S., & Jiang, L. (2020) · University of Chicago · doi:10.6082/cj1av-2st07 · Cited by 37
Tyson, J. (n.d.) · Cited by 37
Statistical Complexity of Quantum Learning
Banchi, L., Pereira, J. L., Jose, S. T., & Simeone, O. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300311 · Cited by 36
“It turns out that pretty good measurements also provide a good approximations of the optimal Helstrom measurement [68, 69], so they seem to be a natural choice for defining measurements that are both optimal to minimize the training error and the optimality gap.”
Optimal measurements for symmetric quantum states with applications to optical communication
Krovi, H., Guha, S., Dutton, Z., & Silva, M. P. D. (2015) · Physical Review A · doi:10.1103/physreva.92.062333 · Cited by 36
“However, [13] have shown that a certain measurement called the pretty good measurement (PGM) comes close to the optimal measurement for arbitrary states.”
BackgroundSymmetries of quantum evolutions
Chiribella, G., Aurell, E., & Życzkowski, K. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033028 · Cited by 35
“[74] Howard Barnum and Emanuel Knill, “Reversing quantum dynamics with near-optimal quantum and classical fidelity,” Journal of Mathematical Physics 43, 2097– 2106 (2002).”
BackgroundInverses, disintegrations, and Bayesian inversion in quantum Markov categoriesPreprint
Parzygnat, A. J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.08375 · Cited by 35
“Although, the topic of reversibility in quantum mechanics has been studied in great depth in the literature (a small selection of references include [5,27,28,31,38]), the categorical approach we take here seems novel and is different from alternatives in the literature [9, 26, 27].”
ResultDynamical maps, quantum detailed balance, and the Petz recovery map
Alhambra, A. M., & Woods, M. P. (2017) · Physical Review A · doi:10.1103/physreva.96.022118 · Cited by 34
“It appears in quantum information theory when one tries to find the best possible way to recover data after it is processed [33, 34].”
BackgroundBibliographic guide to the foundations of quantum mechanics and quantum informationPreprint
Cabello, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0012089 · Cited by 34
Quantum Bayes’ Rule and Petz Transpose Map from the Minimum Change Principle
Bai, G., Buscemi, F., & Scarani, V. (2025) · Physical Review Letters · doi:10.1103/5n4p-bxhm · Cited by 33
“…is satisfied in some situations of physical interest, such as 1. when τ = E ( γ ), as is often assumed when considering quantum error correction [39] or quantum fluctuation relations [40]; notice that this case leads to the optimal solution with F ( Q fwd , Q rev ) = 1, namely Q fwd = Q ref ,…”
BackgroundError Exponents for Quantum Packing Problems via An Operator Layer Cake TheoremPreprint
Cheng, H., & Liu, P.-C. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2507.06232 · Cited by 33
“PGMs are useful in quantum information theory because the resulting suboptimal error is at most twice the optimal error ε ( X | B ) ρ [86], [83, Theorem 3.10].”
InfluentialAn invitation to the sample complexity of quantum hypothesis testing
Cheng, H., Datta, N., Liu, N., Nuradha, T., Salzmann, R., & Wilde, M. M. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00980-8 · Cited by 32
Dupuis, F., & Wilde, M. M. (2016) · Quantum Information Processing · doi:10.1007/s11128-015-1211-x · Cited by 32
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
Radhakrishnan, J., Rötteler, M., & Sen, P. (2008) · Algorithmica · doi:10.1007/s00453-008-9231-x · Cited by 32
“Their measurement is in general not single register, and is based on work by Barnum and Knill [BK02] on the so-called pretty good measurement (PGM), also known as the square-root measurement.”
BackgroundMethodTowards Holography via Quantum Source-Channel Codes
Pastawski, F., Eisert, J., & Wilming, H. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.020501 · Cited by 32
“distinct framework and introduce the name source-channel codes to emphasize that the task being achieved is different from that of traditional QECCs and closely follows earlier work byBarnumandKnill [13] instead.”
ResultOptimality of the pretty good measurement for port-based teleportation
Leditzky, F. (2022) · Letters in Mathematical Physics · doi:10.1007/s11005-022-01592-5 · Cited by 31
“In a generic state discrimination problem, this measurement always achieves a success probability no worse than the square of the optimal success probability [4].”
BackgroundApproximate simulation of quantum channels
Bény, C., & Oreshkov, O. (2011) · Physical Review A · doi:10.1103/physreva.84.022333 · Cited by 31
Channel-Adapted Quantum Error CorrectionPreprint
Fletcher, A. S. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0706.3400 · Cited by 31
“[6, 2] code XXXXXX Z Z I I I I I I Z Z I I I I I I Z Z [8, 3] code XXXXXXXX Z Z I I I I I I I I Z Z I I I I I I I I Z Z I I I I I I I I Z Z [10, 4] code XXXXXXXXXX Z Z I I I I I I I I I I Z Z I I I I I I I I I I Z Z I I I I I I I I I I Z Z I I I I I I I I I I Z Z (A)”
BackgroundMethodInfluentialFrom Log-Determinant Inequalities to Gaussian Entanglement via Recoverability Theory
Lami, L., Hirche, C., Adesso, G., & Winter, A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2737546 · Cited by 30
A One-Shot Achievability Result for Quantum State Redistribution
Anshu, A., Jain, R., & Warsi, N. A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2776112 · Cited by 30
“Fact 6 (Pretty-Good Measurement, [23]): Consider an ensemble {pk, ρA} such that ∑ k pk = 1.”
BackgroundMethodInfluentialThermodynamic Constraints on Quantum Information Gain and Error Correction: A Triple Trade-Off
Danageozian, A., Wilde, M. M., & Buscemi, F. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020318 · Cited by 28
Efficient Quantum Pseudorandomness from Hamiltonian Phase States
Bostanci, J., Haferkamp, J., Hangleiter, D., & Poremba, A. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2025.9 · Cited by 28
Entanglement-enhanced testing of multiple quantum hypotheses
Zhuang, Q., & Pirandola, S. (2020) · OSA Quantum 2.0 Conference · doi:10.1364/quantum.2020.qth7b.7 · Cited by 27
Quantum algorithms for Uhlmann transformationPreprint
Utsumi, T., Nakata, Y., Wang, Q., & Takagi, R. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.03619 · Cited by 27
Approaching the Quantum Singleton Bound with Approximate Error Correction
Bergamaschi, T., Golowich, L., & Gunn, S. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649680 · Cited by 26
An asymptotic error bound for testing multiple quantum hypotheses
Nussbaum, M., & Szkoła, A. (2011) · The Annals of Statistics · doi:10.1214/11-aos933 · Cited by 26
Cryptography in a Quantum WorldPreprint
Wehner, S. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0806.3483 · Cited by 26
Optimality Condition for the Petz Map
Li, B., Wang, Z., Zheng, G., Wong, Y., & Jiang, L. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.200602 · Cited by 25
“Nonetheless, the Petz map guarantees near-optimal performance with ( F op e ) 2 ≤ F e ( ρ, R P ρ, E ◦ E ) ≤ F op e [17].”
InfluentialChung, K.-M., & Lin, H.-H. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2021.3 · Cited by 25
“First by slightly modifying a result of [BK02] and [AM14], We show that PGM can solve the "average case" BSD: Lemma 10 (PGM for "average BSD") .”
ResultStructure of sufficient quantum coarsegrainingsPreprint
Mosonyi, M., Petz, D., Abstract Let, H., & B(h, T. (n.d.) · Cited by 25
Noise-adapted recovery circuits for quantum error correction
Biswas, D., Vaidya, G. M., & Mandayam, P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043034 · Cited by 24
“However, this algorithm is geared towards implementing the state-specific Petz map [12] rather than the code-specific Petz map [5].”
BackgroundMethodInfluentialQuantum information encoding, protection, and correction from trace-norm isometries
Ticozzi, F., & Viola, L. (2010) · Physical Review A · doi:10.1103/physreva.81.032313 · Cited by 24
Nonlocal growth of quantum conditional mutual information under decoherence
Zhang, Y., & Gopalakrishnan, S. (2024) · Physical Review A · doi:10.1103/physreva.110.032426 · Cited by 23
Approximate reconstructability of quantum states and noisy quantum secret sharing schemes
Ouyang, Y., Goswami, K., Romero, J., Sanders, B. C., Hsieh, M.-H., & Tomamichel, M. (2023) · Physical Review A · doi:10.1103/physreva.108.012425 · Cited by 22
Tyson, J. (2009) · Physical Review A · doi:10.1103/physreva.79.032343 · Cited by 22
Pretty simple bounds on quantum state discriminationPreprint
Montanaro, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.08312 · Cited by 22
“It was shown in [10], based on a bound of [5], that O(log n) copies are required to identify a state picked from an arbitrary set of n states with pairwise fidelities bounded above by a constant F < 1.”
BackgroundMethodChailloux, A., & Tillich, J. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2024.6 · Cited by 21
“If we define P PGM as the probability that the pretty good measurement succeeds in solving our problem and define P OPT as the maximal probability that any measurement succeeds, we have [4, 22] P 2OPT ≤ P PGM ≤ P OPT .”
BackgroundQuantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
Berta, M. (2013) · arXiv (Cornell University) · doi:10.3929/ethz-a-009959263 · Cited by 20
A complete and operational resource theory of measurement sharpness
Buscemi, F., Kobayashi, K., & Minagawa, S. (2024) · Quantum · doi:10.22331/q-2024-01-25-1235 · Cited by 19
“…and the degree of uniform autocorrelation κ u ( P : P ) (not a sharpness monotone) can be found using the theory of pretty good measurements [46, 47], using which we can show that κ ∗ u ( P ∥ P ) ⩾ κ u ( P : P In other words, if the degree of autotuning κ ∗ u ( P ∥ P ) is not smaller than 1 − ϵ…”
BackgroundRecovery map for fermionic Gaussian channels
Swingle, B. G., & Wang, Y. (2019) · Journal of Mathematical Physics · doi:10.1063/1.5093326 · Cited by 19
Strong Converse for Privacy Amplification against Quantum Side Information
Shen, Y., Gao, L., & Cheng, H. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834467 · Cited by 18
Does connected wedge imply distillable entanglement?
Mori, T., & Yoshida, B. (2026) · Journal of High Energy Physics · doi:10.1007/jhep01(2026)125 · Cited by 18
Lautenbacher, L., de Melo, F., & Bernardes, N. K. (2022) · Physical Review A · doi:10.1103/physreva.105.042421 · Cited by 18
“3, the latter is clearly the worst strategy, despite the fact that the maximally mixed state is indeed the average state for the input distribution of states [15].”
BackgroundPolar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs
Nasser, R., & Renes, J. M. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2869460 · Cited by 18
“The optimal decoder forWu satisfiesPe(Wu) ≤ (q− 1)F (Wu) [14].”
BackgroundEntropy in Quantum Information Theory -- Communication and CryptographyPreprint
Majenz, C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.10436 · Cited by 18
An asymptotic error bound for testing multiple quantum hypothesesPreprint
Nussbaum, M., & La, A. S. (2011) · Cited by 18
Maximum-confidence measurement for qubit states
Lee, H., Flatt, K., Carceller, C. R. I., Brask, J. B., & Bae, J. (2022) · Physical Review A · doi:10.1103/physreva.106.032422 · Cited by 17
Noise-adapted qudit codes for amplitude-damping noise
Dutta, S., Biswas, D., & Mandayam, P. (2025) · Physical Review A · doi:10.1103/physreva.111.032438 · Cited by 17
“This approach to noise-adapted recovery is based on a universal and near-optimal recovery channel, often known as the Petz map [15, 16].”
Khalid, I., Weidner, C. A., JONCKHEERE, E. A., Shermer, S., & Langbein, F. C. (2023) · Physical Review A · doi:10.1103/physreva.107.032606 · Cited by 17
On time-reversal and space-time harmonic processes for Markovian quantum channels
Ticozzi, F., & Pavon, M. (2010) · Quantum Information Processing · doi:10.1007/s11128-010-0186-x · Cited by 17
“While studying quantum error correction problems, the sameRE,ρ(·) has been suggested by Barnum and Knill as a nearoptimal correction operator [3].”
BackgroundMethodUniversal adjointation of isometry operations using conversion of quantum supermaps
Yoshida, S., Soeda, A., & Murao, M. (2025) · Quantum · doi:10.22331/q-2025-05-20-1750 · Cited by 16
Zheng, G., He, W., Lee, G., Noh, K., & Jiang, L. (2025) · PRX Quantum · doi:10.1103/gh1c-xyn1 · Cited by 16
Fundamental Limitations on the Recoverability of Quantum Processes
Sohail, S., Pandey, V., Singh, U., & Das, S. (2025) · Annales Henri Poincaré · doi:10.1007/s00023-025-01590-y · Cited by 16
Arunachalam, S., Belovs, A., Childs, A. M., Kothari, R., Rosmanis, A., & de Wolf, R. (2020) · UvA-DARE (University of Amsterdam) · doi:10.4230/lipics.tqc.2020.10 · Cited by 16
General lower and upper bounds under minimum-error quantum state discrimination
Loubenets, E. R. (2022) · Physical Review A · doi:10.1103/physreva.105.032410 · Cited by 16
Quantum error correction and large $N$
Milekhin, A. (2021) · SciPost Physics · doi:10.21468/scipostphys.11.5.094 · Cited by 16
Conditions for the Approximate Correction of Algebras
Bény, C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10698-9_7 · Cited by 15
“(See [4] for the case of average entanglement fidelity).”
BackgroundRenes, J. M. (2017) · Physical Review A · doi:10.1103/physreva.96.042328 · Cited by 15
“Taking the limit |X | →∞, we recover the previously-known result, Ppg(X |B)ρ ≥ Popt(X |B)(2)ρ , first shown in [22] in the classical case (again, just as a statement involving on D2) and in [20] in the quantum case.”
BackgroundResultAw, C. C., Zaw, L. H., Balanzó-Juandó, M., & Scarani, V. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010332 · Cited by 15
“In quantum thermodynamics, one the main tools for information recovery had been used, first occasionally [14, 18], then systematically [19, 20]: the Petz recovery map [11, 21, 22], which was also proposed early on as a quantum analog of Bayesian inversion [23–26].”
MethodMultivariate trace inequalities, p-fidelity, and universal recovery beyond tracial settings
Junge, M., & LaRacuente, N. D. (2022) · Journal of Mathematical Physics · doi:10.1063/5.0066653 · Cited by 15
Symmetric distinguishability as a quantum resource
Salzmann, R., Datta, N., Gour, G., Wang, X., & Wilde, M. M. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac14aa · Cited by 15
Quantum State Discrimination for Supervised ClassificationPreprint
Giuntini, R., Freytes, H., Park, D. K., Blank, C., Holik, F., Chow, K. L., & Sergioli, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.00971 · Cited by 15
“The map F , called Pretty Good measurement [28], is sub-optimal [29] since psucc(R) ≥ Opt(R)(2).”
BackgroundTripartite Haar Random State Has No Bipartite Entanglement
Li, Z., Mori, T., & Yoshida, B. (2026) · Physical Review X · doi:10.48550/arxiv.2502.04437 · Cited by 14
Time‐Symmetric Correlations for Open Quantum Systems
Parzygnat, A. J., & Fullwood, J. (2025) · Annalen der Physik · doi:10.1002/andp.202500221 · Cited by 14
“It is worth comparing the Bayesian inverse F with the Petz recovery map R : B → A of the process ( E , ρ ) [52, 53, 91–95], which is given by The Petz recovery map, which is often used for time-reversal symmetry, retrodiction, relative entropy inequalities, thermodynamics, and approximate…”
Explicit reconstruction of the entanglement wedge via the Petz map
Bahiru, E., & Vardian, N. (2023) · Journal of High Energy Physics · doi:10.1007/jhep07(2023)025 · Cited by 14
“This result has been also independently obtained by Barnum and Knill in [39].”
ResultUltimate limits of thermal pattern recognition
Harney, C., Banchi, L., & Pirandola, S. (2021) · Physical Review A · doi:10.1103/physreva.103.052406 · Cited by 14
Coarse-grained distinguishability of field interactions
Bény, C. (2018) · Quantum · doi:10.22331/q-2018-05-24-67 · Cited by 14
“For context, we note that if the both source and target metrics were the square-root metric, then Rρ would be a quantum channel, namely the transpose channel [14], which is a useful approximate recovery channel in quantum error correction [4, 13].”
Conditional Independence in Quantum Many-Body Systems
Kim, I. H. (2013) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/pzjn-a841 · Cited by 14
Trade-Offs on Number and Phase Shift Resilience in Bosonic Quantum Codes
Ouyang, Y., & Campbell, E. T. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3102873 · Cited by 13
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map
Atif, T. A., Sohail, M. A., & Pradhan, S. S. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3336539 · Cited by 13
“A related concept is the Petz recovery map which has found significant relevance in information-theoretic problems [46], [47], [48].”
BackgroundPreserving measurements for optimal state discrimination over quantum channels
Kechrimparis, S., Singal, T., Kropf, C. M., & Bae, J. (2019) · Physical Review A · doi:10.1103/physreva.99.062302 · Cited by 13
Energetic Considerations in Quantum Target Ranging
Karsa, A., & Pirandola, S. (2021) · IEEE Radar Conference (RadarConf) · doi:10.1109/radarconf2147009.2021.9455341 · Cited by 13
“where F is the fidelity [19], [20] and σ ) = E(B/T (σ).”
BackgroundTheory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
Wang, D., Wang, Y.-J., Cao, N., Zeng, B., & Laflamme, R. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac4737 · Cited by 13
Quantum learning Boolean linear functions w.r.t. product distributions
Caro, M. C. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02661-1 · Cited by 12
“The “pretty good” performance of the PGM was proved in [6]:”
BackgroundEquilibration of objective observables in a dynamical model of quantum measurements
Engineer, S., Rivlin, T., Wollmann, S., Malik, M., & Lock, M. P. E. (2026) · Physical Review A · doi:10.1103/lkqb-jdmg · Cited by 12
“Specifically, It was shown in [34, 52, 71] that the probability of error, when optimising over all POVMs, is bounded from above (see also [63]): where F ( ρ, σ ) is the fidelity.”
The Learning Stabilizers with Noise Problem
Poremba, A., Quek, Y., & Shor, P. W. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itcs.2026.108 · Cited by 12
Idler-free channel position finding
Pereira, J. L., Banchi, L., Zhuang, Q., & Pirandola, S. (2021) · Physical Review A · doi:10.1103/physreva.103.042614 · Cited by 12
“ble of mixed states {πi, ρ⊗M i } we may write the following upper bound [19]”
BackgroundBergamaschi, T. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-58734-4_14 · Cited by 12
“Several results then studied conditions in which approximate quantum error correction is even possible [BK00, SW02, Dev05, KSW06, B´en09, NM10, MN12, BO10, HP17].”
BackgroundProper and Improper Mixed States Serve as Different Prior Beliefs for Quantum State Retrodiction
Liu, M., Scarani, V., & Bai, G. (2026) · Physical Review Letters · doi:10.1103/xx43-p1py · Cited by 11
“A notable feature of the Petz map is that it is always CPTP, and thus can be implemented deterministically [44, 45], with applications to error correction [8, 13, 14] and reversing dissipative dynamics [46, 47].”
Petz recovery maps of single-qubit decoherence channels in an ion trap quantum processor
Png, W.-H., & Scarani, V. (2025) · Physical Review A · doi:10.1103/7f8x-n2np · Cited by 11
Retrodictive approach to quantum state smoothing
Liu, M., Scarani, V., Auffèves, A., & Laverick, K. T. (2025) · Physical Review A · doi:10.1103/8pc3-7pg5 · Cited by 11
“It has been developed not only for logical inference, but also as a protocol to control noise [47–49].”
Measurement incompatibility in Bayesian multiparameter quantum estimation
Albarelli, F., Branford, D., & Rubio, J. (2026) · Quantum · doi:10.22331/q-2026-08-13-2192 · Cited by 11
“…from hypothesis testing, we introduce the square root measurement, also known as the pretty good measurement (PGM) [108–111]: This measurement is usually introduced for discriminating among discrete hypotheses, where the Barnum– Knill theorem guarantees the “pretty good” performance [134].”
Approximate Quantum Error Correction with 1D Log-Depth Circuits
Liu, G., Du, Z., Liu, Z.-W., & Ma, X. (2026) · PRX Quantum · doi:10.1103/7rzk-2jyh · Cited by 11
Multi-class classification based on quantum state discrimination
Giuntini, R., Arango, A. C. G., Freytes, H., Holik, F., & Sergioli, G. (2023) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2023.03.012 · Cited by 11
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.