The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
A fault-tolerant non-Clifford gate for the surface code in two dimensions
Open accessAbstract
We complete a universal set of fault-tolerant quantum logic gates for a two-dimensional surface code architecture.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Figures








Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 cited source says what the claim attributes to it.
In the citing paper
“For instance, when using 2D codes such as the surface code, non-Clifford operations cannot be easily performed37, and relatively expensive techniques are required for nontrivial computation24,43, as Clifford circuits can be easily simulated44.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [43]
Experimental — accuracy not yet measured
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
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 1×
“Leading candidate models for fault-tolerant quantum computation are based on the surface code (3, 8) due to its high threshold (9) and multitude of ways of performing Clifford gates (10).”
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
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×
“Among the most feasible approaches to realize a non-Clifford gate is by the use of magic-state distillation ( 11 ).”
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
State preservation by repetitive error detection in a superconducting quantum circuit
Kelly, J., Barends, R., Fowler, A. G., Megrant, A., Jeffrey, E., White, T. C., Sank, D., Mutus, J. Y., Campbell, B., Chen, Y., et al. (2015) · Nature · doi:10.1038/nature14270 · Cited by 916
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 · cited 3×
“The process is well characterized by connecting the surface code with the topological cluster-state model ( 9 , 25 ); a measurement-based model with a finite threshold error rate, below which it will function reliably at a suitably large system size.”
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 · cited 1×
“We might accomplish this with lattice surgery ( 10 , 40 ).”
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Cited by
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“For instance, when using 2D codes such as the surface code, non-Clifford operations cannot be easily performed 37 , and relatively expensive techniques are required for nontrivial computation 24,43 , as Clifford circuits can be easily simulated 44 .”
MethodThe future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Magic State Distillation: Not as Costly as You Think
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-12-02-205 · Cited by 220
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148
“space-time footprint can be smaller [69].”
MethodEncoding a magic state with beyond break-even fidelity
Gupta, R. S., Sundaresan, N., Alexander, T., Wood, C. J., Merkel, S. T., Healy, M. B., Hillenbrand, M., Jochym-O’Connor, T., Wootton, J. R., Yoder, T. J., et al. (2024) · Nature · doi:10.1038/s41586-023-06846-3 · Cited by 115
Self-citation
Metadata
- Authors
- Brown, B. J.
- Affiliations
- The University of Sydney (AU)
- Corresponding author
- Brown, Benjamin J.
- ORCID
- Brown, Benjamin J.
- Venue
- Science Advances
- Published
- 2020-05-22
- Volume
- 6
- Issue
- 21
- Pages
- eaay4929-eaay4929
- ISSN
- 2375-2548 (ISSN-L)
- PMC
- PMC7244310
- OpenAlex
- W2922722314
- Cited by
- 77
- References
- 41
- Citations by year
- 2026: 6 · 2025: 13 · 2024: 10 · 2023: 10 · 2022: 13 · 2021: 17 · 2020: 6
- FWCI
- 4.52
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by-nc
- Locations
- Science Advances (publishedVersion, cc-by-nc)
- PubMed Central (publishedVersion, cc-by-nc)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Australian Research Council via the Centre of Excellence in Engineered Quantum System (CE170100009)
- University of Sydney Fellowship Programme
- 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
- fault-tolerant quantum computing, surface code, magic state distillation, transversal gates, parity check, universal gate set, resource overhead
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: A fault-tolerant non-Clifford gate for the surface code in two dimensions. https://app.cochat.ai/papers/10.1126/sciadv.aay4929
- The paper
- Brown, B. J. (2020). A fault-tolerant non-Clifford gate for the surface code in two dimensions. Science Advances. https://doi.org/10.1126/sciadv.aay4929
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.