Conditions for the Approximate Correction of Algebras
Open accessThe DOI matches its Crossref record; 20 of the 21 references it cites were found in a registry or an index.
Abstract
We study the approximate correctability of general algebras of observables, which represent hybrid quantum-classical information. This includes approximate quantum error correcting codes and subsystems codes. We show that the main result of [1] yields a natural generalization of the Knill-Laflamme conditions in the form of a dimension independent estimate of the optimal reconstruction error for a given encoding, measured using the trace-norm distance to a noiseless channel.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“As argued in [38], based on results about approximate operator algebra quantum error correcting codes derived in [39-41], state-independent entanglement wedge reconstruction is only possible for a given code space if the bulk operator is contained in the entanglement wedge of the boundary region for all states, both pure and mixed that have support only within the code space.”
From Entanglement wedge reconstruction and the information paradox (2020) · cites this paper as [40]
Citations
Cites
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Unified and Generalized Approach to Quantum Error Correction
Kribs, D., Laflamme, R., & Poulin, D. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.180501 · Cited by 283
Reversing quantum dynamics with near-optimal quantum and classical fidelity
Barnum, H., & Knill, E. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1459754 · Cited by 280 · cited 1×
“(See [4] for the case of average entanglement fidelity).”
BackgroundApproximate quantum error correction can lead to better codes
Leung, D. W., Nielsen, M. A., Chuang, I. L., & Yamamoto, Y. (1997) · Physical Review A · doi:10.1103/physreva.56.2567 · Cited by 214
Approximate Quantum Error Correction
Schumacher, B., & Westmoreland, M. D. (2002) · Quantum Information Processing · doi:10.1023/a:1019653202562 · Cited by 142 · cited 1×
“There exists results giving sufficient conditions for a code to be approximately correctable in that sense [5,6], however it is not known how general these conditions are.”
BackgroundGeneral Conditions for Approximate Quantum Error Correction and Near-Optimal Recovery Channels
Bény, C., & Oreshkov, O. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.120501 · Cited by 126 · cited 1×
“This is analyzed in a separate article in which we also address the problem of finding a good approximate correction channel [ 18 ].”
BackgroundSelf-citationThe Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation
Kretschmann, D., Schlingemann, D., & Werner, R. F. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.917696 · Cited by 122 · cited 5×
“6) and the main result of [1], namely that if”
BackgroundInfluentialSemidefinite programs for completely bounded normsPreprint
Watrous, J. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.4709 · Cited by 109 · cited 1×
“Note that δA(N ) is explicit apart from the diamond norm (see [16] or [13] for computation techniques).”
BackgroundCharacterizing the Structure of Preserved Information in Quantum Processes
Blume-Kohout, R., Ng, H. K., Poulin, D., & Viola, L. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.030501 · Cited by 97
Operator quantum error correction
Kribs, D., & Poulin, D. (2013) · Quantum Error Correction · doi:10.1017/cbo9781139034807.008 · Cited by 92 · cited 1×
“Similarly, if we only require the algebra to be that of all operators acting on a subsystem of the code we recover the conditions for subsystem error correction [15].”
BackgroundGeneralization of Quantum Error Correction via the Heisenberg Picture
Bény, C., Kempf, A., & Kribs, D. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.100502 · Cited by 91 · cited 3×
“The condition that we obtain (Theorem 1) can be understood as a perturbation of the exact Knill-Laflamme condition [8], or more generally its subsystem version [9], or full algebraic form [10].”
BackgroundSelf-citationOperator quantum error correction
Kribs, D. W., Laflamme, R., Poulin, D., & Lesosky, M. (2006) · Quantum Information and Computation · doi:10.26421/qic6.4-5-6 · Cited by 73
The capacity of hybrid quantum memory
Kuperberg, G. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.811917 · Cited by 59 · cited 1×
“The correctable algebra can be understood as representing a quantum system with superselection rules, or a hybrid quantum-classical memory [11], and can be shown to be the most general type of exactly correctable information in the sense of [12].”
BackgroundComputing stabilized norms for quantum operations
Johnston, N., Kribs, D. W., & Paulsen, V. I. (2009) · Quantum Information and Computation · doi:10.26421/qic9.1-2-2 · Cited by 55 · cited 2×
“Note that δA(N ) is explicit apart from the diamond norm (see [16] or [13] for computation techniques).”
BackgroundApproximate Quantum Error-Correcting Codes and Secret Sharing Schemes
Crépeau, C., Gottesman, D., & Smith, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_17 · Cited by 51 · cited 1×
“Slightly relaxing the requirement of perfect quantum error correction can allow for significantly larger quantum codes [2,3].”
BackgroundComplementarity of private and correctable subsystems in quantum cryptography and error correction
Kretschmann, D., Kribs, D. W., & Spekkens, R. W. (2008) · Physical Review A · doi:10.1103/physreva.78.032330 · Cited by 41 · cited 1×
“[1,7] who gave lower and upper bounds for the optimal reconstruction error for a given code in terms of the complementary channel’s distance to a maximally forgetful channel.”
BackgroundComputing Stabilized Norms for Quantum Operations via the Theory of Completely Bounded MapsPreprint
Johnston, N., Kribs, D. W., & Paulsen, V. I. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0711.3636 · Cited by 10 · cited 2×
“Note that δA(N ) is explicit apart from the diamond norm (see [16] or [13] for computation techniques).”
BackgroundUnsharp pointer observables and the structure of decoherencePreprint
Bény, C. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0802.0685 · Cited by 6 · cited 1×
“observables are preserved [14] by the channel N̂ .”
BackgroundSelf-citationThe structure of preserved information in quantum processes
Ng, H. K., Blume-Kohout, R., Poulin, D., & Viola, L. (2008) · Bulletin of the American Physical Society · Cited by 5
Information flow at the quantum-classical boundaryPreprint
Bény, C. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.3629 · Cited by 4 · cited 1×
“by a channel are the correctable observables for that channel [ 15 ].”
BackgroundSelf-citation
Research works printed but not linked: 1
- Mandayam, P., Poulin, D.: Approximate quantum error correction. In: First International Conference on Quantum Error Correction (2007)
Cited by
Entanglement wedge reconstruction and the information paradox
Penington, G. (2020) · Journal of High Energy Physics · doi:10.1007/jhep09(2020)002 · Cited by 968
“• As argued in [38], based on results about approximate operator algebra quantum error correcting codes derived in [39–41], state-independent entanglement wedge reconstruction is only possible for a given code space if the bulk operator is contained in the entanglement wedge of the boundary region for all states, both…”
BackgroundMethodGeneral Conditions for Approximate Quantum Error Correction and Near-Optimal Recovery Channels
Bény, C., & Oreshkov, O. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.120501 · Cited by 126
Self-citationLearning the Alpha-bits of black holes
Hayden, P., & Penington, G. (2019) · Journal of High Energy Physics · doi:10.1007/jhep12(2019)007 · Cited by 125
Continuous Symmetries and Approximate Quantum Error Correction
Faist, P., Nezami, S., Albert, V. V., Salton, G., Pastawski, F., Hayden, P., & Preskill, J. (2020) · Physical Review X · doi:10.1103/physrevx.10.041018 · Cited by 107
Simple approach to approximate quantum error correction based on the transpose channel
Ng, H. K., & Mandayam, P. (2010) · Physical Review A · doi:10.1103/physreva.81.062342 · Cited by 87
Metadata
- Authors
- Bény, C.
- Affiliations
- Centre for Quantum Technologies (SG)
- Corresponding author
- Bény, Cédric
- ORCID
- Bény, Cédric
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 66-75
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1761981699
- Cited by
- 15
- References
- 21
- Citations by year
- 2024: 2 · 2022: 3 · 2020: 2 · 2019: 1 · 2018: 1 · 2017: 1 · 2015: 1 · 2012: 1
- FWCI
- 0.92
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- National University of Singapore (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Research Foundation
- Centre for Quantum Technologies
- 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
- subsystem codes, Knill-Laflamme conditions, noiseless channel, quantum error correction
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.