Cited by 40Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureQuantum Mechanics and Applications

Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit

Open access
Hayden, Patrick, Penington, Geoffrey·2020·Communications in Mathematical Physics

Integrity signals

Registry

Crossref · 10.1007/s00220-020-03689-1

Cites

50 of 50 references verified0 citation errors · 0 not checkable

Statistics

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

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?

  • The universal subsystem recovery channel first considered in [239] reproduces the desired behavior.

    “The quantum error correcting protocol which reproduces the above desired behavior is the universal subsystem recovery channel first considered in [239].”
  • Using the results of [62], it is possible to put strict lower bounds on the size of the non-perturbative error that must exist to avoid a cloning paradox.

    “Using the results of [62], it is possible to put strict lower bounds on the size of the non-perturbative error that must exist to avoid a cloning paradox.”
  • The cloning paradox can only be resolved if there is an error term in (3.9) with size at least exp(-O(δ S_BH)) [62].

    “The cloning paradox can only be resolved if there is an error term in (3.9) with size at least exp(-O(δ S BH )) [62].”
  • As shown in [62, 67], this would imply that there must also exist a state-independent reconstruction O_code^CFT that works for the entire code space and acts only on the CFT.

    “However, as shown in [62, 67], this would imply that there must also exist a stateindependent reconstruction O code CFT that works for the entire code space and acts only on the CFT.”
  • It is a general fact about quantum error correction that if exact state-dependent reconstruction of operators is possible for all states in a finite-dimensional code space, then exact state-independent reconstruction is also possible for that code space [38, 62].

    “It is a general fact about quantum error correction that, if exact state-dependent reconstruction of operators is possible all states in a finite-dimensional code space, then exact state-independent reconstruction is also possible for that code space [38, 62].”

Cites

Flagged first, then by citations

2 of the 52 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Hayden, P., & Penington, G.
Affiliations
Stanford University (US)
Venue
Communications in Mathematical Physics
Published
2020-02-10
Volume
374
Issue
2
Pages
369-432
ISSN
  • 0010-3616 (ISSN-L)
  • 1432-0916
OpenAlex
W2729893749
Cited by
40
References
52
Citations by year
2025: 5 · 2024: 9 · 2023: 7 · 2022: 6 · 2021: 5 · 2020: 4 · 2019: 1 · 2018: 3
FWCI
2.16
Type
journal article
Language
en
Open access
Locations
  • Communications in Mathematical Physics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Canadian Institute for Advanced Research
  • Air Force Office of Scientific Research (FA9550-16-1- 0082)
  • Simons Foundation
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
approximate quantum error correction, EBIT, quantum channel capacity, state merging, entanglement distillation, remote state preparation, information leakage, entanglement-assisted capacity, quantum resource theory

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