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
Self-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
Characterizing 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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Conditions for the Approximate Correction of Algebras. https://app.cochat.ai/papers/10.1007/978-3-642-10698-9_7
- The paper
- Bény, C. (2009). Conditions for the Approximate Correction of Algebras. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-10698-9_7
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.