The DOI matches its Crossref record; 45 of the 45 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.
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








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 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
Efficient high-fidelity quantum computation using matter qubits and linear optics
Barrett, S. D., & Kok, P. (2005) · Physical Review A · doi:10.1103/physreva.71.060310 · Cited by 546 · cited 1×
“Periodic boundary conditions are easily achieved given a distributed architecture (41), where we are not constrained to strictly local interactions.”
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Quantum Self-Correction in the 3D Cubic Code Model
Bravyi, S., & Haah, J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.200501 · Cited by 291 · cited 11×
“A threshold can be proved by adapting the threshold theorem for topological codes given in ( 32 ).”
InfluentialKubica, A., Yoshida, B., & Pastawski, F. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083026 · Cited by 266 · cited 3×
“Although we find transversal gates via a mapping between the color code and the surface code ( 14 , 15 ) such that we arrive at quite a specific lattice, it will be unexpected if we cannot find ways of performing a constant-depth locality-preserving gate with other lattices ( 38 ) for the…”
Classification of Topologically Protected Gates for Local Stabilizer Codes
Bravyi, S. B., & König, R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.170503 · Cited by 263 · cited 1×
“The non-Clifford gate presented here circumvents fundamental limitations of two-dimensional models ( 17 – 21 ) by dynamically pre-paring a three-dimensional system using a two-dimensional array of active qubits.”
Universal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction
Paetznick, A., & Reichardt, B. W. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.090505 · Cited by 242 · cited 1×
“We use error correction to recover the surface code from the random-gauge model ( 26 – 28 ).”
Quantum memories at finite temperature
Brown, B. J., Loss, D., Pachos, J. K., Self, C. N., & Wootton, J. R. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.045005 · Cited by 231
Self-citationGauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Bombín, H. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083002 · Cited by 217
Long-range quantum entanglement in noisy cluster states
Raussendorf, R., Bravyi, S., & Harrington, J. (2005) · Physical Review A · doi:10.1103/physreva.71.062313 · Cited by 201 · cited 4×
“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.”
InfluentialPoking Holes and Cutting Corners to Achieve Clifford Gates with the Surface Code
Brown, B. J., Laubscher, K., Kesselring, M. S., & Wootton, J. R. (2017) · Physical Review X · doi:10.1103/physrevx.7.021029 · Cited by 201
Self-citationDemonstration of Weight-Four Parity Measurements in the Surface Code Architecture
Takita, M., Córcoles, A. D., Magesan, E., Abdo, B., Brink, M., Cross, A., Chow, J. M., & Gambetta, J. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.210505 · Cited by 200
Surface code quantum computing by lattice surgeryPreprint
Horsman, C., Fowler, A. G., Devitt, S. J., & Meter, R. V. (2016) · Cited by 172
Fault Tolerant Quantum Computation with Very High Threshold for Loss Errors
Barrett, S. D., & Stace, T. M. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.200502 · Cited by 164 · cited 1×
“After post-selection, we then might expect the system to perform as though it were gauge-fixed globally with some known erasure errors ( 16 , 35 ).”
Fault-Tolerant Conversion between the Steane and Reed-Muller Quantum Codes
Anderson, J. T., Duclos-Cianci, G., & Poulin, D. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.080501 · Cited by 161 · cited 1×
“We use error correction to recover the surface code from the random-gauge model ( 26 – 28 ).”
Quantum computation with realistic magic-state factories
O'Gorman, J., & Campbell, E. T. (2017) · Physical Review A · doi:10.1103/physreva.95.032338 · Cited by 158 · cited 1×
“However, this is somewhat prohibitive as a large fraction of the resources of a quantum computer will be expended by these protocols ( 12 , 13 ).”
Efficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation
Gidney, C., & Fowler, A. G. (2019) · Quantum · doi:10.22331/q-2019-04-30-135 · Cited by 152
Fault-tolerant error correction with the gauge color code
Brown, B. J., Nickerson, N., & Browne, D. E. (2016) · Nature Communications · doi:10.1038/ncomms12302 · Cited by 148 · cited 1×
“This will make for a very interesting comparison since, although decoding technology for the color-code model ( 36 , 37 ) remains lacking in comparison to the surface code ( 9 ), the fact that the non-Clifford operation is performed using single-qubit rotations instead of a weight-three gate will…”
Self-citationFault-tolerant logical gates in quantum error-correcting codes
Pastawski, F., & Yoshida, B. (2015) · Physical Review A · doi:10.1103/physreva.91.012305 · Cited by 129
String and membrane condensation on three-dimensional lattices
Hamma, A., Zanardi, P., & Wen, X.-G. (2005) · Physical Review B · doi:10.1103/physrevb.72.035307 · Cited by 121 · cited 1×
“We require two types of surface code boundaries; rough and smooth ( 31 ).”
Topological color code and symmetry-protected topological phases
Yoshida, B. (2015) · Physical Review B · doi:10.1103/physrevb.91.245131 · Cited by 112 · cited 1×
“Bombín ( 16 ) treats these flagged qubits as erasure errors that, in general, can support linking charges ( 33 , 34 ).”
Foliated Quantum Error-Correcting Codes
Bolt, A., Duclos-Cianci, G., Poulin, D., & Stace, T. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.070501 · Cited by 110 · cited 1×
“Much research has sought to map quantum error–correcting codes into measurement-based schemes ( 29 , 39 ) through a system called “foliation” to access favorable properties of exotic quantum error–correcting codes.”
Decoding color codes by projection onto surface codes
Delfosse, N. (2014) · Physical Review A · doi:10.1103/physreva.89.012317 · Cited by 98 · cited 1×
“This will make for a very interesting comparison since, although decoding technology for the color-code model ( 36 , 37 ) remains lacking in comparison to the surface code ( 9 ), the fact that the non-Clifford operation is performed using single-qubit rotations instead of a weight-three gate will…”
Dimensional jump in quantum error correction
Bombín, H. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/4/043038 · Cited by 85 · cited 6×
“In total, all three arrays support ∼ [30 + 2 · 11] d 2 = 52 d 2 qubits.”
InfluentialDisjointness of Stabilizer Codes and Limitations on Fault-Tolerant Logical Gates
Jochym-O’Connor, T., Kubica, A., & Yoder, T. J. (2018) · Physical Review X · doi:10.1103/physrevx.8.021047 · Cited by 75
2D quantum computation with 3D topological codesPreprint
Bombín, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.09571 · Cited by 70 · cited 9×
“Conversely, gauge prefixing can be adapted for the proposal in ( 16 ).”
InfluentialStacked codes: Universal fault-tolerant quantum computation in a two-dimensional layout
Jochym-O’Connor, T., & Bartlett, S. D. (2016) · Physical Review A · doi:10.1103/physreva.93.022323 · Cited by 61
Measurement based fault tolerance beyond foliationPreprint
Nickerson, N., & Bombín, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.09621 · Cited by 55 · cited 3×
“It is worth remarking that the method we have discussed here enables us to produce other three-dimensional structures that go beyond foliation (38).”
BackgroundMethodUniversal fault-tolerant quantum computation with Bacon-Shor codesPreprint
Yoder, T. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.01686 · Cited by 49
Locality-preserving logical operators in topological stabilizer codes
Webster, P., & Bartlett, S. D. (2018) · Physical Review A · doi:10.1103/physreva.97.012330 · Cited by 43
Gauge color codes in two dimensions
Jones, C., Brooks, P., & Harrington, J. (2016) · Physical Review A · doi:10.1103/physreva.93.052332 · Cited by 40 · cited 1×
“In the past, there has been a significant effort to realize a non-Clifford gate with two-dimensional quantum error– correcting codes ( 22 – 24 ).”
Transversal gates and error propagation in 3D topological codesPreprint
Bombín, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.09575 · Cited by 31 · cited 1×
“Bombín ( 16 ) treats these flagged qubits as erasure errors that, in general, can support linking charges ( 33 , 34 ).”
Bravyi, S., & Cross, A. (2015) · arXiv · doi:10.48550/arxiv.1509.03239 · Cited by 27 · cited 1×
“In the past, there has been a significant effort to realize a non-Clifford gate with two-dimensional quantum error– correcting codes ( 22 – 24 ).”
Reduced space-time and time costs Ising dislocation codes and arbitrary ancillas
Hastings, M. B., & Geller, A. (2015) · Quantum Information and Computation · doi:10.26421/qic15.11-12-6 · Cited by 25
Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
Vasmer, M., & Browne, D. E. (2018) · arXiv · doi:10.48550/arxiv.1801.04255
Universal fault-tolerant measurement-based quantum computation
Brown, B. J., & Roberts, S. (2018) · arXiv · doi:10.48550/arxiv.1811.11780
Self-citation
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
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.