CoChat

Efficient Markov chain Monte Carlo algorithm for the surface code

Open access
Hutter, Adrian, Wootton, James R., Loss, Daniel · 2014 · Physical Review A
Cited by 77

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

Abstract

Minimum-weight perfect matching (MWPM) has been the primary classical algorithm for error correction in the surface code, since it is of low runtime complexity and achieves relatively low logical error rates [Phys. Rev. Lett. 108, 180501 (2012)]. A Markov chain Monte Carlo (MCMC) algorithm [Phys. Rev. Lett. 109, 160503 (2012)] is able to achieve lower logical error rates and higher thresholds than MWPM, but requires a classical runtime complexity, which is super-polynomial in $L$, the linear size of the code. In this work we present an MCMC algorithm that achieves significantly lower logical error rates than MWPM at the cost of a runtime complexity increased by a factor $O({L}^{2})$. This advantage is due to taking correlations between bit- and phase-flip errors (as they appear, for example, in depolarizing noise) as well as entropic factors (i.e., the numbers of likely error paths in different equivalence classes) into account. For depolarizing noise with error rate $p$, we present an efficient algorithm for which the logical error rate is suppressed as $O({(p/3)}^{L/2})$ for $p\ensuremath{\rightarrow}0$---an exponential improvement over all previously existing efficient algorithms. Our algorithm allows for tradeoffs between runtime and achieved logical error rates as well as for parallelization, and can be also used for correction in the case of imperfect stabilizer measurements.

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.89.022326

Cites

5 of 5 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

Research works printed but not linked: 18

  1. 10.1080/09500340.2012.737937 · DOI
  2. 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
  3. 10.1063/1.1499754 · DOI · Paper page
  4. 10.1103/PhysRevB.83.115415 · DOI
  5. 10.1103/PhysRevLett.110.243604 · DOI
  6. 10.1103/PhysRevLett.104.050504 · DOI · Paper page
  7. 10.1103/PhysRevLett.108.180501 · DOI · Paper page
  8. 10.1103/PhysRevLett.109.160503 · DOI · Paper page
  9. 10.1103/PhysRevA.72.052326 · DOI · Paper page
  10. 10.1126/science.1145699 · DOI · Paper page
  11. 10.1103/PhysRevX.2.021004 · DOI · Paper page
  12. D. S. Wang, 2010, Quantum Inf. Comput., 10, 0456
  13. 10.1007/s12532-009-0002-8 · DOI · Paper page
  14. 10.1103/PhysRevA.82.022305 · DOI
  15. H. N. Gabow, 1985, Proceedings 26th Annual Symposium of the Foundations of Computer Science
  16. 10.1103/PhysRevA.83.020302 · DOI · Paper page
  17. 10.1103/PhysRevA.87.062338 · DOI · Paper page
  18. 10.1103/PhysRevLett.111.200501 · DOI · Paper page

Cited by

See all 77

Metadata

Authors
Hutter, A., Wootton, J. R., & Loss, D.
Venue
Physical Review A
Published
2014-02-18
Volume
89
Issue
2
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W1995611441
Cited by
77
References
5
FWCI
8.58
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

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.