CoChat
Sign Up
Cited by 157Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Approximate Quantum Error Correction

Open access
Schumacher, Benjamin, Westmoreland, Michael D.·2002·Quantum Information Processing
DOI 10.1023/a:1019653202562
Open this paper in CoChat — free accountOpen PDF

Abstract

AbstractThe errors that arise in a quantum channel can be corrected perfectly if and only if the channel does not decrease the coherent information of the input state. We show that, if the loss of coherent information is small, then approximate quantum error correction is possible. PACS: 03.67.H, 03.65.U

Overview

Integrity signals

Registry

Crossref · 10.1023/a:1019653202562

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • If one feeds a black hole with externally entangled states at the Hawking-emission rate for an arbitrarily long time, Hawking's semi-classical analysis predicts that a black hole of fixed size could contain an unbounded amount of entropy associated with the states of the in-fallen matter.

    “Suppose one feeds a black hole (with externally entangled states) at the Hawking-emission rate for an arbitrarily long time. Then, Hawking's semi-classical analysis would predict that such a black hole, of a fixed size, could contain an unbounded amount of entropy, associated with the states of the in-fallen matter.”

    From Quantum Information Cannot Be Completely Hidden in Correlations: Implications for the Black-Hole Information Paradox (2007) · cites this paper as [20]

Citations

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Related

Metadata

Authors
Schumacher, B., & Westmoreland, M. D.
Affiliations
  • Kenyon College (US)
  • Denison University (US)
Venue
Quantum Information Processing
Publisher
Springer Science and Business Media LLC
Published
2002-04
Volume
1
Issue
1-2
Pages
5-12
ISSN
  • 1570-0755 (ISSN-L)
  • 1573-1332
DOI
10.1023/a:1019653202562
OpenAlex
W1828074370
Cited by
142
References
5
Citations by year
2026: 6 · 2025: 6 · 2024: 13 · 2023: 7 · 2022: 8 · 2021: 8 · 2020: 8 · 2019: 2 · 2018: 6 · 2017: 3 · 2016: 8 · 2015: 3 · 2014: 5 · 2013: 8 · 2012: 7
FWCI
2.06
Type
journal article
Language
en
Open access
Licence
Locations
  • Quantum Information Processing (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Digital Kenyon (Kenyon College) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
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
approximate quantum error correction, quantum channels, coherent information, quantum channel capacity, 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