CoChat

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

Correcting coherent errors with surface codes

Open access
Bravyi, Sergey, Englbrecht, Matthias, König, Robert, Peard, Nolan · 2018 · npj Quantum Information

Abstract

Surface codes are building blocks of quantum computing platforms based on 2D arrays of qubits responsible for detecting and correcting errors. The error suppression achieved by the surface code is usually estimated by simulating toy noise models describing random Pauli errors. However, Pauli noise models fail to capture coherent processes such as systematic unitary errors caused by imperfect control pulses. Here we report the first large-scale simulation of quantum error correction protocols based on the surface code in the presence of coherent noise. We observe that the standard Pauli approximation provides an accurate estimate of the error threshold but underestimates the logical error rate in the sub-threshold regime. We find that for large code size the logical-level noise is well approximated by random Pauli errors even though the physical-level noise is coherent. Our work demonstrates that coherent effects do not significantly change the error correcting threshold of surface codes. This gives more confidence in the viability of the fault-tolerance architecture pursued by several experimental groups.

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.1038/s41534-018-0106-y

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Surface codes with distance d = 3 and d = 5. Qubits and stabilizers are located at sites and faces respectively. A stabilizer Bf located on a face f applies X (black faces) or Z (white faces) to each qubit on the boundary of f . Logical Pauli operators XL (red) and ZL (blue) have support on the left and the top boundary
Fig. 1 Surface codes with distance d = 3 and d = 5. Qubits and stabilizers are located at sites and faces respectively. A stabilizer Bf located on a face f applies X (black faces) or Z (white faces) to each qubit on the boundary of f . Logical Pauli operators XL (red) and ZL (blue) have support on the left and the top boundaryCC-BY · From the PDF
Fig. 2 (Empirical) logical error rate P L for storage of quantum states. We consider distanced surface codes subject to coherent errors exp( i θ Z ) on each qubit. We consider surface codes with distance 5 ≤ d ≤ 37. The smallest distance d = 3 was skipped because of strong fi nite-size effects (note that the considered surface codes are only de fi ned for odd values of d ). In all fi gures, the logical error rate P L was estimated by the Monte Carlo method with at least 50,000 syndrome samples per data point
Fig. 2 (Empirical) logical error rate P L for storage of quantum states. We consider distanced surface codes subject to coherent errors exp( i θ Z ) on each qubit. We consider surface codes with distance 5 ≤ d ≤ 37. The smallest distance d = 3 was skipped because of strong fi nite-size effects (note that the considered surface codes are only de fi ned for odd values of d ). In all fi gures, the logical error rate P L was estimated by the Monte Carlo method with at least 50,000 syndrome samples per data pointCC-BY · From the PDF
Fig. 3 Comparison between the logical error rates P L and P L ( N twirl) computed for coherent noise N ( ρ ) = e i θ Z ρ e -i θ Z and its Pauli twirled version N twirl ( ρ ) = (1 -ε ) ρ + ε Z ρ Z with ε ¼ sin 2 ð θ Þ . In both cases we used the minimum weight matching decoder. The plot demonstrates that applying the Pauli twirl approximation to the physical noise signi fi cantly underestimates the logical error rate in the sub-threshold regime
Fig. 3 Comparison between the logical error rates P L and P L ( N twirl) computed for coherent noise N ( ρ ) = e i θ Z ρ e -i θ Z and its Pauli twirled version N twirl ( ρ ) = (1 -ε ) ρ + ε Z ρ Z with ε ¼ sin 2 ð θ Þ . In both cases we used the minimum weight matching decoder. The plot demonstrates that applying the Pauli twirl approximation to the physical noise signi fi cantly underestimates the logical error rate in the sub-threshold regimeCC-BY · From the PDF
Image 4
CC-BY · From the PDF
Fig. 4 These histograms show the empirical probability distribution of logical rotation angles θ s for the code distance d = 9 (left) and d = 25 (right) obtained by sampling 10 6 syndromes s . The histograms use the same noise parameter θ = 0.08 π . For ease of visualization, we truncated the main peak at θ s = 0
Fig. 4 These histograms show the empirical probability distribution of logical rotation angles θ s for the code distance d = 9 (left) and d = 25 (right) obtained by sampling 10 6 syndromes s . The histograms use the same noise parameter θ = 0.08 π . For ease of visualization, we truncated the main peak at θ s = 0CC-BY · From the PDF
Fig. 6 A fermionic representation of the distance-3 surface code. Solid circles represent paired (blue) and unpaired (red) Majorana modes. The pattern extends to larger codes in a translation invariant fashion. An edge e oriented from cp to cq de fi nes a link operator Le = icpcq . On a subspace de fi ned by local constraints, stabilizers of the surface code can be represented as products of link operators
Fig. 6 A fermionic representation of the distance-3 surface code. Solid circles represent paired (blue) and unpaired (red) Majorana modes. The pattern extends to larger codes in a translation invariant fashion. An edge e oriented from cp to cq de fi nes a link operator Le = icpcq . On a subspace de fi ned by local constraints, stabilizers of the surface code can be represented as products of link operatorsCC-BY · From the PDF

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Research works printed but not linked: 4

  1. Ofek, N. et al. Demonstrating quantum error correction that extends the lifetime of quantum information. arXiv. 1602, 04768 (2016).
  2. Gottesman, D. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Inst. Technol. (1997).
  3. Bravyi, S. Lagrangian representation for fermionic linear optics. Quant. Inf. Comp. 5, 216–238 (2004).
  4. Bravyi, S. & Koenig, R. Classical simulation of dissipative fermionic linear optics. Quant. Inf. Comp. 12, 925 (2012).

Cited by

See all 159

Metadata

Authors
Bravyi, S., Englbrecht, M., König, R., & Peard, N.
Affiliations
  • IBM (United States) (US)
  • Universität Innsbruck (AT)
  • Technical University of Munich (DE)
Corresponding author
König, Robert
Venue
npj Quantum Information
Published
2018-10-31
Volume
4
Issue
1
ISSN
2056-6387 (ISSN-L)
OpenAlex
W2762805862
Cited by
157
References
40
Citations by year
2026: 18 · 2025: 36 · 2024: 25 · 2023: 27 · 2022: 19 · 2021: 13 · 2020: 9 · 2019: 7 · 2018: 2
FWCI
4.34
Type
journal article
Language
en
Open access
Licence
Locations
  • npj Quantum Information (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • mediaTUM (Technical University of Munich) (submittedVersion, other-oa)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (PHY11- 25915, NSF PHY-11-25915, 1125915)
  • European Commission (291763)
  • Technische Universität München (291763)
  • QuantERA
  • Intelligence Advanced Research Projects Activity (W911NF-16-0114)
  • Kavli Institute for Theoretical Physics, University of California, Santa Barbara (PHY-11-25915, NSF PHY11-25915)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
surface code, quantum error correction, coherent noise, error threshold, logical error rate, fault tolerance, quantum computing hardware

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: Correcting coherent errors with surface codes. https://app.cochat.ai/papers/10.1038/s41534-018-0106-y
The paper
Bravyi, S., Englbrecht, M., König, R., & Peard, N. (2018). Correcting coherent errors with surface codes. npj Quantum Information. https://doi.org/10.1038/s41534-018-0106-y

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.