Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 376

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

Sparse-Graph Codes for Quantum Error Correction

Open access
MacKay, D.J.C., Mitchison, G., McFadden, P.L.·2004·IEEE Transactions on Information Theory

Abstract

Sparse-graph codes appropriate for use in quantum error-correction are presented. Quantum error-correcting codes based on sparse graphs are of interest for three reasons. First, the best codes currently known for classical channels are based on sparse graphs. Second, sparse-graph codes keep the number of quantum interactions associated with the quantum error-correction process small: a constant number per quantum bit, independent of the block length. Third, sparse-graph codes often offer great flexibility with respect to block length and rate. We believe some of the codes we present are unsurpassed by previously published quantum error-correcting codes.

Overview

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.1109/tit.2004.834737

Cites

40 of 40 references verified0 citation errors · 0 not checkable

Statistics

Verification

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

Self-check

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

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

Citations

Cites

Show all 40 references

Cited by

See all 376

Metadata

Authors
MacKay, D. J. C., Mitchison, G., & McFadden, P. L.
Venue
IEEE Transactions on Information Theory
Published
2004-10
Volume
50
Issue
10
Pages
2315-2330
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2119314900
Cited by
376
References
40
FWCI
10.17
Type
journal article
Language
en
Open access
green

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: Sparse-Graph Codes for Quantum Error Correction. https://app.cochat.ai/papers/10.1109/tit.2004.834737
The paper
MacKay, D. J. C., Mitchison, G., & McFadden, P. L. (2004). Sparse-Graph Codes for Quantum Error Correction. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2004.834737

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.