The XZZX surface code
Open accessThe DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.
Abstract
Performing large calculations with a quantum computer will likely require a fault-tolerant architecture based on quantum error-correcting codes. The challenge is to design practical quantum error-correcting codes that perform well against realistic noise using modest resources. Here we show that a variant of the surface code—the XZZX code—offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel; it is the first explicit code shown to have this universal property. We present numerical evidence that the threshold even exceeds this hashing bound for an experimentally relevant range of noise parameters. Focusing on the common situation where qubit dephasing is the dominant noise, we show that this code has a practical, high-performance decoder and surpasses all previously known thresholds in the realistic setting where syndrome measurements are unreliable. We go on to demonstrate the favourable sub-threshold resource scaling that can be obtained by specialising a code to exploit structure in the noise. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.
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
Figures









![Fig. 10 Analysis of the XZZX code at low error rates. a Plot showing logical failure rate P¯ as a function of code distance d for data where noise bias η = 3. The physical error rates used are, from the bottom to the top curves in the main plot, 0.0001, 0.0002, 0.0005, 0.001 and 0.002. We estimate G(p, η) for each physical error rate p by taking the gradient of each line. Low error rate data are collected using the method proposed in refs. 76,77. The inset plot shows the gradients G(p, η) as function of log[p/(1−p)] for η = 3. Values for G(p, η), see Eq. (8), are estimated using the linear fittings. Gradient of line of best fit to these data points is 0.504(4) in agreement with the expected gradient 1/2. b Plot showing intercepts I(η) shown as a function of log[(η+1/2)/(η+1)²]. The intercept function is defined in Eq. (9) and estimated from the intercept of lines such as that shown in the inset of plot a. Error bars indicate one standard deviation relative to the fitting procedure.](https://figures.cochat.ai/paper-figures/40b7a1bb24eb42709d8c0b2bb100d0f1/the-xzzx-surface-code-figure-10.jpg)
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“We also remove certain Hadamard gates to implement the ZXXZ variant of the surface code44,45, which helps symmetrize the X- and Z-basis logical error rates.”
From Suppressing quantum errors by scaling a surface code logical qubit (2023) · cites this paper as [45]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“At the same time, various proposals have been put forward to further scale bosonic QEC by concatenating it with an outer code across multiple bosonic modes6,8–16,18,40, leveraging the protection offered in each bosonic mode to reduce the overall resource overhead for QEC.”
From Hardware-efficient quantum error correction via concatenated bosonic qubits (2025) · cites this paper as [14]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“The large physical-qubit overhead associated with error correction motivates the search for more hardware-efficient approaches6–18.”
From Hardware-efficient quantum error correction via concatenated bosonic qubits (2025) · cites this paper as [14]
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
Harris, C. R., Millman, K. J., van der Walt, S. J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N. J., et al. (2020) · Nature · doi:10.1038/s41586-020-2649-2 · Cited by 23,826
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238 · cited 2×
“[12] A.”
BackgroundMixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272 · cited 2×
“[17] C.”
BackgroundSurface 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
Efficient estimation of free energy differences from Monte Carlo data
Bennett, C. H. (1976) · Journal of Computational Physics · doi:10.1016/0021-9991(76)90078-4 · Cited by 2,755
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“To contrast the XZZX surface code with its conventional counterpart, we refer to the latter as the CSS surface code because it is of Calderbank-Shor-Steane type [34, 35].”
MethodEdmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
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 2×
“[51] S.”
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Research works printed but not linked: 12
- Shor, P. W. Fault-tolerant quantum computation. in Proc. 37th Annual Symposium on Foundations of Computer Science, FOCS ’96 (IEEE Computer Society, 1996).
- Gidney, C. & Ekerå, M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. arXiv http://arxiv.org/abs/1905.09749 (2019). · arXiv
- Li, M., Miller, D., Newman, M., Wu, Y. & Brown, K. R. 2d compass codes. Phys. Rev. X 9, 021041 (2019).
- Wilde, M. M. Theorem 24.6.2 Quantum Information Theory, 2nd edn. (Cambridge University Press, 2017).
- Bausch, J. & Leditzky, F. Error thresholds for arbitrary Pauli noise. arXiv http://arxiv.org/abs/1910.00471 (2019). · arXiv
- Brown, B. J., Laubscher, K., Kesselring, M. S. & Wootton, J. R. Poking holes and cutting corners to achieve Clifford gates with the surface code. Phys. Rev. X 7, 021029 (2017).
- Hastings, M. B. Decoding in hyperbolic space: LDPC codes with linear rate and efficient error correction. Quant. Inf. Comput. 14, 1187 (2014).
- Fowler, A. G., Wang, D. S. & Hollenberg, L. C. L. Surface code quantum error correction incorporating accurate error propagation. Quant. Inf. Comput. 11, 0008 (2011).
- Krishna, A. & Poulin, D. Fault-tolerant gates on hypergraph product codes. Phys. Rev. X 11, 011023 (2021).
- Breuckmann, N. P. & Londe, V. Single-shot decoding of linear rate LDPC quantum codes with high performance. arXiv http://arxiv.org/abs/2001.03568 (2020). · arXiv
- Hastings, M. B., Haah, J. & O’Donnell, R. Fiber bundle codes: breaking the $${n}^{1/2}\ {\rm{polylog}}(n)$$ barrier for quantum LDPC codes. arXiv http://arxiv.org/abs/2009.03921 (2020). · arXiv
- Tuckett, D. K. Tailoring surface codes: Improvements in quantum error correction with biased noise. Ph.D. thesis, University of Sydney (2020).
Cited by
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103
Quantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
“Note that this metric does not favor qubits with extremely biased noise [32–34 S4.”
High-fidelity gates and mid-circuit erasure conversion in an atomic qubit
Ma, S., Liu, G., Peng, P., Zhang, B., Jandura, S., Claes, J., Burgers, A. P., Pupillo, G., Puri, S., & Thompson, J. D. (2023) · Nature · doi:10.1038/s41586-023-06438-1 · Cited by 228
“For example, for eventual application in quantum error correction, it is advantageous to realize qubits with structured error models, such as biased Pauli errors 9 or conversion of errors into detectable erasures 10 .”
MethodQuantum Computing for High-Energy Physics: State of the Art and Challenges
Di Meglio, A., Jansen, K., Tavernelli, I., Alexandrou, C., Arunachalam, S., Bauer, C. W., Borras, K., Carrazza, S., Crippa, A., Croft, V., et al. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.037001 · Cited by 215
Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
Wu, Y., Kolkowitz, S., Puri, S., & Thompson, J. D. (2022) · Nature Communications · doi:10.1038/s41467-022-32094-6 · Cited by 196
Metadata
- Authors
- Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J.
- Affiliations
- The University of Sydney (AU)
- Corresponding author
- Brown, Benjamin J.
- ORCID
- Venue
- Nature Communications
- Published
- 2021-04-12
- Volume
- 12
- Issue
- 1
- Pages
- 2172-2172
- ISSN
- 2041-1723 (ISSN-L)
- PMC
- PMC8042007
- OpenAlex
- W3085306040
- Cited by
- 262
- References
- 63
- Citations by year
- 2026: 29 · 2025: 94 · 2024: 45 · 2023: 52 · 2022: 34 · 2021: 8
- FWCI
- 12.28
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Nature Communications (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- National Computational Infrastructure
- Australian Government (CE170100009)
- University of Sydney
- Australian Research Council (CE170100009, W911NF-21-1-0007)
- National Cancer Institute
- Army Research Office (W911NF-21-1-, W911NF-21-1-0007, W911NF)
- 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, fault-tolerant quantum computing, error threshold, qubit dephasing, decoder performance, resource scaling
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: The XZZX surface code. https://app.cochat.ai/papers/10.1038/s41467-021-22274-1
- The paper
- Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021). The XZZX surface code. Nature Communications. https://doi.org/10.1038/s41467-021-22274-1
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.