Fault-Tolerant Thresholds for the Surface Code in Excess of 5% Under Biased Noise
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
Noise in quantum computing is countered with quantum error correction. Achieving optimal performance will require tailoring codes and decoding algorithms to account for features of realistic noise, such as the common situation where the noise is biased towards dephasing. Here we introduce an efficient high-threshold decoder for a noise-tailored surface code based on minimum-weight perfect matching. The decoder exploits the symmetries of its syndrome under the action of biased noise and generalizes to the fault-tolerant regime where measurements are unreliable. Using this decoder, we obtain fault-tolerant thresholds in excess of 6% for a phenomenological noise model in the limit where dephasing dominates. These gains persist even for modest noise biases: we find a threshold of ∼5% in an experimentally relevant regime where dephasing errors occur at a rate 100 times greater than bit-flip errors.
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
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
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · cited 11×
“Codes with distance d = 12, 14, 16, 18, 20 and d = 24, 28, 32, 36, 40 were used for finite and infinite bias threshold estimates, respectively. use of MWPM to complete the decoding procedure.”
BackgroundInfluentialDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1×
“[8] Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Phys.”
BackgroundQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
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
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397 · cited 2×
“Minimum-weight perfect matching has formed the backbone of topological quantum error correction [2, 6, 17, 31, 39, 40].”
BackgroundAlmost-linear time decoding algorithm for topological codes
Delfosse, N., & Nickerson, N. H. (2021) · Quantum · doi:10.22331/q-2021-12-02-595 · Cited by 242
Ultrahigh Error Threshold for Surface Codes with Biased Noise
Tuckett, D. K., Bartlett, S. D., & Flammia, S. T. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.050505 · Cited by 216
Self-citationEfficient algorithms for maximum likelihood decoding in the surface code
Bravyi, S., Suchara, M., & Vargo, A. (2014) · Physical Review A · doi:10.1103/physreva.90.032326 · Cited by 214 · cited 3×
“form under more realistic types of noise, such as depolarising noise [16, 18, 23, 24] and correlated errors [25–27].”
BackgroundMethodOptimal complexity correction of correlated errors in the surface code
Fowler, A. G. (2013) · arXiv · doi:10.48550/arxiv.1310.0863 · Cited by 36
Cited by
Circuit quantum electrodynamics
Blais, A., Grimsmo, A. L., Girvin, S. M., & Wallraff, A. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025005 · Cited by 1,931
Quantum information processing and quantum optics with circuit quantum electrodynamics
Blais, A., Girvin, S. M., & Oliver, W. D. (2020) · Nature Physics · doi:10.1038/s41567-020-0806-z · Cited by 420
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281
Self-citationExponential suppression of bit-flips in a qubit encoded in an oscillator
Lescanne, R., Villiers, M., Peronnin, T., Sarlette, A., Delbecq, M., Huard, B., Kontos, T., Mirrahimi, M., & Leghtas, Z. (2020) · Nature Physics · doi:10.1038/s41567-020-0824-x · Cited by 276
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
Self-citation
Metadata
- Authors
- Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2020-03-30
- Volume
- 124
- Issue
- 13
- Pages
- 130501-130501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2955624093
- Cited by
- 118
- References
- 14
- FWCI
- 6.54
- 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.