CoChat

Towards practical classical processing for the surface code: Timing analysis

Open access
Fowler, Austin G., Whiteside, Adam C., Hollenberg, Lloyd C. L. · 2012 · Physical Review A
Cited by 48

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

Abstract

Topological quantum error-correction codes have high thresholds and are well suited to physical implementation. The minimum-weight perfect-matching algorithm can be used to efficiently handle errors in such codes. We perform a timing analysis of our current implementation of the minimum-weight perfect-matching algorithm. Our implementation performs the classical processing associated with an $n\ifmmode\times\else\texttimes\fi{}n$ lattice of qubits realizing a square surface code storing a single logical qubit of information in a fault-tolerant manner. We empirically demonstrate that our implementation requires only $O({n}^{2})$ average time per round of error correction for code distances ranging from 4 to 512 and a range of depolarizing error rates. We also describe tests we have performed to verify that it always obtains a true minimum-weight perfect matching.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1103/physreva.86.042313

Cites

6 of 6 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 6 references

Research works printed but not linked: 8

  1. P. W. Shor, 1994, Proceedings of the 35th Annual Symposium on Foundations of Computer Science
  2. P. W. Shor, 1997, SIAM J. Sci. Stat. Comput., 26, 1484, 10.1137/S0097539795293172 · DOI · Paper page
  3. 10.1103/PhysRevA.83.020302 · DOI · Paper page
  4. 10.1103/PhysRevLett.108.180501 · DOI · Paper page
  5. 10.1063/1.1499754 · DOI · Paper page
  6. 10.1088/1367-2630/9/6/199 · DOI · Paper page
  7. J. Edmonds, 1965, J. Res. Natl. Bur. Stand. B, 69, 125, 10.6028/jres.069B.013 · DOI · Paper page
  8. 10.1103/PhysRevLett.104.050504 · DOI · Paper page

Cited by

See all 48

Metadata

Authors
Fowler, A. G., Whiteside, A. C., & Hollenberg, L. C. L.
Venue
Physical Review A
Published
2012-10-12
Volume
86
Issue
4
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2070633801
Cited by
48
References
6
FWCI
4.43
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: Towards practical classical processing for the surface code: Timing analysis. https://app.cochat.ai/papers/10.1103/physreva.86.042313
The paper
Fowler, A. G., Whiteside, A. C., & Hollenberg, L. C. L. (2012). Towards practical classical processing for the surface code: Timing analysis. Physical Review A. https://doi.org/10.1103/physreva.86.042313

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.