Tailoring Surface Codes for Highly Biased Noise
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
The surface code, with a simple modification, exhibits ultrahigh error-correction thresholds when the noise is biased toward dephasing.Here, we identify features of the surface code responsible for these ultrahigh thresholds.We provide strong evidence that the threshold error rate of the surface code tracks the hashing bound exactly for all biases and show how to exploit these features to achieve significant improvement in the logical failure rate.First, we consider the infinite bias limit, meaning pure dephasing.We prove that the error threshold of the modified surface code for pure dephasing noise is 50%, i.e., that all qubits are fully dephased, and this threshold can be achieved by a polynomial time-decoding algorithm.We demonstrate that the subthreshold behavior of the code depends critically on the precise shape and boundary conditions of the code.That is, for rectangular surface codes with standard rough or smooth open boundaries, it is controlled by the parameter g ¼ gcdðj; kÞ, where j and k are dimensions of the surface code lattice.We demonstrate a significant improvement in the logical failure rate with pure dephasing for coprime codes that have g ¼ 1 and closely related rotated codes, which have a modified boundary.The effect is dramatic: The same logical failure rate achievable with a square surface code and n physical qubits can be obtained with a coprime or rotated surface code using only Oð ffiffiffi n p Þ physical qubits.Finally, we use approximate maximum-likelihood decoding to demonstrate that this improvement persists for a general Pauli noise biased toward dephasing.In particular, comparing with a square surface code, we observe a significant improvement in the logical failure rate against biased noise using a rotated surface code with approximately half the number of physical qubits.
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
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Quantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400
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
Self-citationUltrahigh 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 · cited 10×
“In previous work [7], we show that the surface code exhibits ultrahigh thresholds with Y -biased noise (equivalently, Z-biased noise on the modified surface code of Ref.”
BackgroundMethodInfluentialSelf-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 10×
“[9], can be applied to efficiently approximate the coset probability.”
BackgroundMethodInfluentialSelf-citationOptimal resources for topological two-dimensional stabilizer codes: Comparative study
Bombin, H., & Martin-Delgado, M. A. (2007) · Physical Review A · doi:10.1103/physreva.76.012305 · Cited by 178 · cited 3×
“This result is a further improvement over coprime codes, since rotated surface codes are, in a sense, optimal [8].”
BackgroundResultInfluential
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
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-citationBias-preserving gates with stabilized cat qubits
Puri, S., St-Jean, L., Gross, J. A., Grimm, A., Frattini, N. E., Iyer, P. S., Krishna, A., Touzard, S., Jiang, L., Blais, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.aay5901 · Cited by 201
Self-citationFault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code
Noh, K., & Chamberland, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012316 · Cited by 164
Towards scalable bosonic quantum error correction
Terhal, B. M., Conrad, J., & Vuillot, C. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab98a5 · Cited by 146
Triangular color codes on trivalent graphs with flag qubits
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab68fd · Cited by 105
Decoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
“Additionally, even when the multiple measurement protocol is applied, the code threshold significantly decreases (usually an order of magnitude) in comparison to thresholds that only consider data qubit noise (Fowler et al., 2012; Higgott et al., 2023).”
BackgroundMethodInfluentialDecoder for the Triangular Color Code by Matching on a Möbius Strip
Sahay, K., & Brown, B. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010310 · Cited by 38
Hierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. (2023) · arXiv · doi:10.48550/arxiv.2303.04798 · Cited by 20
General tensor network decoding of 2D Pauli codes
Chubb, C. T. (2021) · arXiv · doi:10.48550/arxiv.2101.04125 · Cited by 20
Self-citationDecoding quantum color codes with MaxSAT
Berent, L., Burgholzer, L., Derks, P.-J. H. S., Eisert, J., & Wille, R. (2024) · Quantum · doi:10.22331/q-2024-10-23-1506 · Cited by 13
“As done previously in related work that uses the TN decoder [11, 64], we observe that for bond dimension χ = 6 , the logical error rate essentially sat-urates.”
Ising model formulation for highly accurate topological color codes decoding
Takada, Y., Takeuchi, Y., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013092 · Cited by 10
Practical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits
Darmawan, A. S., Brown, B. J., Grimsmo, A. L., Tuckett, D. K., & Puri, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030345 · Cited by 2
“IV, we show that the XZZX code has impressive fault-tolerant thresholds with finite noise biases, the TSC with open boundary conditions has the advantage that it can tolerate up to (n − 1)/2 dephasing errors.”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Tuckett, D. K., Darmawan, A. S., Chubb, C. T., Bravyi, S., Bartlett, S. D., & Flammia, S. T.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2019-11-12
- Volume
- 9
- Issue
- 4
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W2905125220
- Cited by
- 124
- References
- 7
- FWCI
- 4.37
- Type
- journal article
- Language
- en
- Open access
- gold
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.