Cited by 87Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyCoding theory and cryptography

Simple approach to approximate quantum error correction based on the transpose channel

Open access
Ng, Hui Khoon, Mandayam, Prabha·2010·Physical Review A

Abstract

We demonstrate that there exists a universal, near-optimal recovery map---the transpose channel---for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we provide an alternative interpretation of the standard quantum error correction (QEC) conditions and generalize them to a set of conditions for approximate QEC (AQEC) codes. This forms the basis of a simple algorithm for finding AQEC codes. Our analytical approach is a departure from earlier work relying on exhaustive numerical search for the optimal recovery map, with optimality defined based on entanglement fidelity. For the practically useful case of codes encoding a single qubit of information, our algorithm is particularly easy to implement.

Integrity signals

Registry

Crossref · 10.1103/physreva.81.062342

Cites

29 of 29 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?

  • A variant of the Petz map defined over a codespace C rather than a specific state ρ has been shown to be a universal, near-optimal recovery map in terms of worst-case fidelity.

    “Subsequently, a variant of the Petz map -defined over a codespace C, rather than a specific state ρ -has been shown to be a universal, nearoptimal recovery map in terms of the worst-case fidelity [190].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Ng, H. K., & Mandayam, P.
Affiliations
California Institute of Technology (US)
Venue
Physical Review A
Published
2010-06-28
Volume
81
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2591783339
Cited by
87
References
29
Citations by year
2026: 9 · 2025: 11 · 2024: 9 · 2023: 9 · 2022: 8 · 2021: 3 · 2020: 7 · 2019: 2 · 2018: 7 · 2017: 4 · 2016: 2 · 2015: 2 · 2014: 5 · 2013: 3 · 2012: 1
FWCI
3.05
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Science Foundation (0803371)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
approximate quantum error correction, recovery maps, entanglement fidelity, quantum error-correcting codes, code construction algorithm

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