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

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

Fast Decoders for Topological Quantum Codes

Open access
Duclos-Cianci, Guillaume, Poulin, David · 2010 · Physical Review Letters

Abstract

We present a family of algorithms, combining real-space renormalization methods and belief propagation, to estimate the free energy of a topologically ordered system in the presence of defects. Such an algorithm is needed to preserve the quantum information stored in the ground space of a topologically ordered system and to decode topological error-correcting codes. For a system of linear size l, our algorithm runs in time logl compared to l{6} needed for the minimum-weight perfect matching algorithm previously used in this context and achieves a higher depolarizing error threshold.

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.1103/physrevlett.104.050504

Cites

3 of 3 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 3 references

Cited by

See all 244

Metadata

Authors
Duclos-Cianci, G., & Poulin, D.
Venue
Physical Review Letters
Published
2010-02-05
Volume
104
Issue
5
Pages
050504-050504
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2147590609
Cited by
244
References
3
FWCI
15.30
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: Fast Decoders for Topological Quantum Codes. https://app.cochat.ai/papers/10.1103/physrevlett.104.050504
The paper
Duclos-Cianci, G., & Poulin, D. (2010). Fast Decoders for Topological Quantum Codes. Physical Review Letters. https://doi.org/10.1103/physrevlett.104.050504

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.