Towards practical classical processing for the surface code: Timing analysis
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Self-citationEdmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Subsystem surface codes with three-qubit check operators
Bravyi, S., Duclos-Cianci, G., Poulin, D., & Suchara, M. (2012) · arXiv · doi:10.48550/arxiv.1207.1443 · Cited by 58
Research works printed but not linked: 8
- P. W. Shor, 1994, Proceedings of the 35th Annual Symposium on Foundations of Computer Science
- P. W. Shor, 1997, SIAM J. Sci. Stat. Comput., 26, 1484, 10.1137/S0097539795293172 · DOI · Paper page
- 10.1103/PhysRevA.83.020302 · DOI · Paper page
- 10.1103/PhysRevLett.108.180501 · DOI · Paper page
- 10.1063/1.1499754 · DOI · Paper page
- 10.1088/1367-2630/9/6/199 · DOI · Paper page
- J. Edmonds, 1965, J. Res. Natl. Bur. Stand. B, 69, 125, 10.6028/jres.069B.013 · DOI · Paper page
- 10.1103/PhysRevLett.104.050504 · DOI · Paper page
Cited by
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Interfacing spin qubits in quantum dots and donors—hot, dense, and coherent
Vandersypen, L. M. K., Bluhm, H., Clarke, J. S., Dzurak, A. S., Ishihara, R., Morello, A., Reilly, D. J., Schreiber, L. R., & Veldhorst, M. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0038-y · Cited by 624
Low-distance surface codes under realistic quantum noise
Tomita, Y., & Svore, K. M. (2014) · Physical Review A · doi:10.1103/physreva.90.062320 · Cited by 281
Sparse blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2025) · Quantum · doi:10.22331/q-2025-01-20-1600 · Cited by 180
PyMatching: A Python Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching
Higgott, O. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3505637 · Cited by 181
Metadata
- Authors
- Fowler, A. G., Whiteside, A. C., & Hollenberg, L. C. L.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- 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.