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

Quantum-channel capacity of very noisy channels

Open access
DiVincenzo, David P., Shor, Peter W., Smolin, John A.·1998·Physical Review A

Abstract

We present a family of additive quantum error-correcting codes whose capacities exceed those of quantum random coding (hashing) for very noisy channels. These codes provide nonzero capacity in a depolarizing channel for fidelity parameters $f$ when $f>0.80944$. Random coding has nonzero capacity only for $f>0.81071$; by analogy to the classical Shannon coding limit, this value had previously been conjectured to be a lower bound. We use the method introduced by Shor and Smolin of concatenating a nonrandom repetition (cat) code within a random code to obtain good codes. The cat code with block size five is shown to be optimal for single concatenation. The best known multiple-concatenated code we found has a block size of 25. We derive a general relation between the capacity attainable by these concatenation schemes and the coherent information of the inner code states.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.57.830

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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 unbiased one-qubit EPGs exceed 0.5, then the effect of gates can be simulated classically.

    “It is known that if unbiased one-qubit EPGs exceed . 5 , then we can simulate the effect of gates classically. 31, 32”

    From Quantum computing with realistically noisy devices (2005) · cites this paper as [32]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 6

  1. [8][8] A.M. Steane, Proc. Roy. Soc. Lond. A 452 , 2551 (1996), also Report No. quantph/9601029. -
  2. [21][21] C.E. Shannon, Bell Syst. Tech. J. 27 , 379,623 (1948). -
  3. [22][22] H. Barnum, M.A. Nielsen and B. Schumacher, Report No. quant-ph/9702049 . - · arXiv
  4. [24][24] D. W. Leung, M.A. Nielsen, I. L. Chuang, Y. Yamamoto, Report No. quant-ph/9704002 . - [25] E.M. Rains, R.H. Hardin, P.W. Shor, and N.J.A. Sloane, Report No. quant-ph/9703002 . - · arXiv
  5. [29][29] E. Knill and R. Laflamme, Report No. quant-ph/9608012 ; E. Knill, R. Laflamme and W.H. Zurek, Report No. quant-ph/9610011 . - · arXiv
  6. [30][30] J. Preskill, Report No. quant-ph/9705031 . - · arXiv

Cited by

Sorted by citations

Authors
DiVincenzo, D. P., Shor, P. W., & Smolin, J. A.
Affiliations
  • IBM Research - Thomas J. Watson Research Center (US)
  • AT&T (United States) (US)
Venue
Physical Review A
Published
1998-02-01
Volume
57
Issue
2
Pages
830-839
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1970302872
Cited by
297
References
26
Citations by year
2026: 7 · 2025: 12 · 2024: 10 · 2023: 10 · 2022: 17 · 2021: 17 · 2020: 13 · 2019: 7 · 2018: 18 · 2017: 10 · 2016: 9 · 2015: 9 · 2014: 13 · 2013: 11 · 2012: 12
FWCI
10.08
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (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 › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
quantum channel capacity, depolarizing channel, random coding, hashing, cat codes, concatenated codes, coherent information

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