The DOI matches its Crossref record; 47 of the 47 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
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-citationConformal field theories are magical
White, C. D., Cao, C., & Swingle, B. G. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.103.075145 · Cited by 171
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
High-Threshold Codes for Neutral-Atom Qubits with Biased Erasure Errors
Sahay, K., Jin, J., Claes, J., Thompson, J. D., & Puri, S. (2023) · Physical Review X · doi:10.1103/physrevx.13.041013 · Cited by 129
Anyon Condensation and the Color Code
Kesselring, M. S., de la Fuente, J. C. M., Thomsen, F., Eisert, J., Bartlett, S. D., & Brown, B. J. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010342 · Cited by 142
“[16, 17] as Floquet codes that realise non-Clifford operation on their dynamically changing code space.”
BackgroundSelf-citationQuantum Coding with Low-Depth Random Circuits
Gullans, M. J., Krastanov, S., Huse, D. A., Jiang, L., & Flammia, S. T. (2021) · Physical Review X · doi:10.1103/physrevx.11.031066 · Cited by 76
“…capacity for the erasure channel at zero code rate on a square lattice [46], is provably fault-tolerant under more general noise models [46, 47], has highly efficient decoding algorithms [27–30, 39, 40, 46– 51], and a large variety of fault-tolerant strategies for implementing gates [12, 14, 52–58].”
BackgroundError rates and resource overheads of repetition cat qubits
Guillaud, J., & Mirrahimi, M. (2021) · Physical Review A · doi:10.1103/physreva.103.042413 · Cited by 55
Universal fault-tolerant measurement-based quantum computation
Brown, B. J., & Roberts, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033305 · Cited by 89
Self-citationHigh-Threshold Quantum Computing by Fusing One-Dimensional Cluster States
Paesani, S., & Brown, B. J. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.120603 · Cited by 75
“It may also be interesting to investigate implementations of non-Clifford gates with this lattice geometry [49, 50].”
BackgroundSelf-citationFault-tolerant quantum gates with defects in topological stabilizer codes
Webster, P., & Bartlett, S. D. (2020) · Physical Review A · doi:10.1103/physreva.102.022403 · Cited by 45
“Our scheme is similar to that of Vasmer and Browne [9], but has the advantage that it can be performed entirely by manipulating defects in the bulk of the code and so allows for arbitrarily many logical qubits to be encoded in a single memory.”
MethodInfluentialPauli topological subsystem codes from Abelian anyon theories
Ellison, T. D., Chen, Y.-A., Dua, A., Shirley, W. E., Tantivasadakarn, N., & Williamson, D. J. (2023) · Quantum · doi:10.22331/q-2023-10-12-1137 · Cited by 65
Topological Order, Quantum Codes, and Quantum Computation on Fractal Geometries
Zhu, G., Jochym-O’Connor, T., & Dua, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030338 · Cited by 59
Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
Vasmer, M., Browne, D. E., & Kubica, A. (2021) · Scientific Reports · doi:10.1038/s41598-021-81138-2 · Cited by 52
Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
Hahn, O., Ferraro, A., Hultquist, L., Ferrini, G., & García-Álvarez, L. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.210502 · Cited by 43
“However, the preparation of high-quality magic states typically involves costly procedures such as magic state distillation, which makes it desirable to optimise the number of magic states used for a given quantum computation — although alternative routes to magic state distillation exist [16].”
Computing data for Levin-Wen with defects
Bridgeman, J. C., & Barter, D. (2020) · Quantum · doi:10.22331/q-2020-06-04-277 · Cited by 39
Low-overhead transversal fault tolerance for universal quantum computation
Zhou, H., Zhao, C., Cain, M., Bluvstein, D., Maskara, N., Duckering, C., Hu, H.-Y., Wang, S.-T., Kubica, A., & Lukin, M. D. (2025) · Nature · doi:10.1038/s41586-025-09543-5 · Cited by 191
Quantum Error Correction Thresholds for the Universal Fibonacci Turaev-Viro Code
Schotte, A., Zhu, G., Burgelman, L., & Verstraete, F. (2022) · Physical Review X · doi:10.1103/physrevx.12.021012 · Cited by 59
Creating Entangled Logical Qubits in the Heavy-Hex Lattice with Topological Codes
Hetényi, B., & Wootton, J. R. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040334 · Cited by 71
Optimal universal quantum error correction via bounded reference frames
Yang, Y., Mo, Y., Renes, J. M., Chiribella, G., & Woods, M. P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023107 · Cited by 55
Universal fault-tolerant quantum computing with stabilizer codes
Webster, P., Vasmer, M., Scruby, T. R., & Bartlett, S. D. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013092 · Cited by 37
Wiseman, H. M., Cavalcanti, E. G., & Rieffel, E. G. (2023) · Quantum · doi:10.22331/q-2023-09-14-1112 · Cited by 58
“Brown [67] builds on Bombin’s approach to exhibit a transversal Toffoli gate for the surface code that requires 3d surface code cycles, where d is the distance of the code, reducing the logical Toffoli gate time to 99μs for distance-33 codes.”
MethodQuantum computation from dynamic automorphism codes
Davydova, M. D., Tantivasadakarn, N., Balasubramanian, S., & Aasen, D. (2024) · Quantum · doi:10.22331/q-2024-08-27-1448 · Cited by 72
Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
Cai, Z., Siegel, A. C., & Benjamin, S. C. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020345 · Cited by 41
Tailoring Three-Dimensional Topological Codes for Biased Noise
Huang, E., Pesah, A. C., Chubb, C. T., Vasmer, M., & Dua, A. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030338 · Cited by 40
“Moreover, these checkerboard lattice codes are instrumental in the construction of the CCZ gate for the 2D surface code [56], and the 3D subsystem surface code [25].”
BackgroundMagic state distillation from entangled states
Bao, N., Cao, C., & Su, V. P. (2022) · Physical Review A · doi:10.1103/physreva.105.022602 · Cited by 27
Scruby, T. R., Browne, D. E., Webster, P., & Vasmer, M. (2022) · Quantum · doi:10.22331/q-2022-05-24-721 · Cited by 30
“that this correction addresses are what is referred to by Bomb́ın as a Pauli frame [22] and by Brown as a gauge of the 3D code [17].”
BackgroundMethodInfluentialLong-range-enhanced surface codes
Hong, Y., Marinelli, M., Kaufman, A. M., & Lucas, A. (2024) · Physical Review A · doi:10.1103/physreva.110.022607 · Cited by 32
“To apply non-Clifford gates once a qubit has been moved into the traditional surface code patch, magic state distillation [49, 50] may be required, though [51–53] provide alternatives.”
MethodError Correction of Transversal cnot Gates for Scalable Surface-Code Computation
Sahay, K., Lin, Y., Huang, S., Brown, K. R., & Puri, S. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020326 · Cited by 46
“Further study of transversal non-Clifford gates [77, 78], decoders for logical gadgets, and optimal compilation schemes [72] that use a unified circuit-decoder perspective will indicate the performance of these strategies as a whole.”
Quantum error correction with fractal topological codes
Dua, A., Jochym-O’Connor, T., & Zhu, G. (2023) · Quantum · doi:10.22331/q-2023-09-26-1122 · Cited by 14
“[36, 37] which use 2D lattices to simulate the action of 3D topological codes for computation.”
MethodFacilitating practical fault-tolerant quantum computing based on color codes
Zhang, J., Wu, Y.-C., & Guo, G.-P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033086 · Cited by 12
Covariant Quantum Error Correcting Codes via Reference FramesPreprint
Yang, Y., Mo, Y., Renes, J. M., Chiribella, G., & Woods, M. P. (2020) · arXiv (Cornell University) · Cited by 12
Non-Pauli topological stabilizer codes from twisted quantum doubles
de la Fuente, J. C. M., Tarantino, N., & Eisert, J. (2021) · Quantum · doi:10.22331/q-2021-02-17-398 · Cited by 16
Non-Pauli topological stabilizer codes from twisted quantum doublesPreprint
de la Fuente, J. C. M., Tarantino, N., & Eisert, J. (2021) · RWTH Publications (RWTH Aachen) · doi:10.17169/refubium-30409 · Cited by 11
Nonlocal discrete time crystals in periodically driven surface codes
Bomantara, R. W. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.064302 · Cited by 10
Limitations on Transversal Gates for Hypergraph Product Codes
Burton, S., & Browne, D. E. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3131043 · Cited by 20
“Other approaches use a 3D architecture [20], possibly with time [21], [22] as one of the dimensions.”
MethodMagic state cultivation: growing T states as cheap as CNOT gates
Gidney, C., Shutty, N., & Jones, C. (2024) · arXiv · doi:10.48550/arxiv.2409.17595 · Cited by 9
Magic state distillation and cost analysis in fault-tolerant universal quantum computation
Liu, Y., Ma, Z., Luo, L., Du, C., Fei, Y., Wang, H., Duan, Q., & Yang, J. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace6ca · Cited by 11
Single-Shot Error Correction of Three-Dimensional Homological Product Codes
Quintavalle, A. O., Vasmer, M., Roffe, J., & Campbell, E. T. (2021) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · doi:10.17169/refubium-32119 · Cited by 6
Approximate error correction scheme for three-dimensional surface codes based reinforcement learning
Qu, Y., 陈, Z. 钊. C., 王, W.-J. 伟. W., & 马, H.-Y. 鸿. M. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acd8a9 · Cited by 8
Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
Wang, Y., Wang, Y., Chen, Y.-A., Zhang, W., Zhang, T., Hu, J., Chen, W., Gu, Y., & Liu, Z.-W. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00945-3 · Cited by 30
“To implement a logical T , which is not transversal for the 7-qubit code, we need to apply 4 CNOT gates and 1 T gate at the physical level of the 7-qubit code, which are transversal for the 15-qubit code: errors can only propagate within individual columns.”
Braiding defects in topological stabiliser codes of any dimension cannot be universalPreprint
Webster, P., & Bartlett, S. D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.11789 · Cited by 7
“As in two dimensions, however, universality still requires the use of additional techniques such as magic state distillation [38] or gauge fixing [33, 43, 44].”
MethodAnyon Condensation and the Color CodePreprint
Kesselring, M. S., de la Fuente, J. C. M., Thomsen, F., Eisert, J., Bartlett, S. D., & Brown, B. J. (2022) · arXiv (Cornell University) · doi:10.17169/refubium-43259 · Cited by 6
Self-citationLow-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
Bauer, A. (2025) · Quantum · doi:10.22331/q-2025-03-25-1673 · Cited by 23
Bauer, A. (2025) · Physical Review A · doi:10.1103/physreva.111.032413 · Cited by 17
Non-Pauli errors in the three-dimensional surface code
Scruby, T. R., Vasmer, M., & Browne, D. E. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043052 · Cited by 7
McLauchlan, C., & Béri, B. (2024) · Quantum · doi:10.22331/q-2024-07-10-1400 · Cited by 11
Characterization of errors in a CNOT between surface code patches
Domokos, B., Márton, Á., & Asbóth, J. K. (2024) · Quantum · doi:10.22331/q-2024-12-27-1577 · Cited by 9
“…numerous other approaches exist to realize universal fault-tolerant quantum computation [16], including higher-dimensional codes [17], encoding information into islands of qudits [18], using gauge color codes instead of surface codes [19], and implementing non-Clifford gates through small…”
Tailoring Three-Dimensional Topological Codes for Biased NoisePreprint
Huang, E., Pesah, A. C., Chubb, C. T., Vasmer, M., & Dua, A. (2022) · arXiv (Cornell University) · doi:10.3929/ethz-b-000592781 · Cited by 4
Limitations in quantum computing from resource constraintsPreprint
Fellous-Asiani, M., Chai, J. H., Whitney, R. S., Auffèves, A., & Ng, H. K. (2020) · arXiv (Cornell University) · doi:10.1103/prxquantum.2.040335 · Cited by 5
Lattice surgery-based logical state teleportation via noisy links
Márton, Á., Colmenárez, L., Bödeker, L., & Müller, M. (2025) · Physical Review Research · doi:10.1103/ppng-vbqj · Cited by 14
“To achieve universality, fault-tolerant initialization of magic states is required, which can be accomplished using distillation protocols [12, 21, 22], magic state cultivation [23], or other approaches [24–26].”
Single-shot preparation of hypergraph product codes via dimension jump
Hong, Y. (2025) · Quantum · doi:10.22331/q-2025-10-07-1879 · Cited by 17
“In this work, we introduce a single-shot protocol that prepares the codespace of constant-rate HGP”
Hsin, P.-S., Kobayashi, R., & Zhu, G. (2025) · PRX Quantum · doi:10.1103/hkgn-hhqx · Cited by 26
Intrinsic Heralding and Optimal Decoders for Non-Abelian Topological Order
Jing, D., Sala, P., Jiang, L., & Verresen, R. (2026) · Physical Review Letters · doi:10.1103/ccj7-ctd8 · Cited by 20
Universal Fault-Tolerant Quantum Computation in 2D without Getting Tied in Knots
Davydova, M. D., Bauer, A., de la Fuente, J. C. M., Webster, M., Williamson, D. J., & Brown, B. J. (2026) · Physical Review X · doi:10.1103/vrty-qs5h · Cited by 63
Self-citationPlanar Fault-Tolerant Circuits for Non-Clifford Gates on the 2D Color Code
Bauer, A., & de la Fuente, J. C. M. (2026) · PRX Quantum · doi:10.1103/p7c9-x1m9 · Cited by 28
Optimal number of stabilizer measurement rounds in an idling surface code patch
Márton, Á., & Asbóth, J. K. (2025) · Quantum · doi:10.22331/q-2025-06-12-1767 · Cited by 3
“In other words, our goal in this work is to find the optimal strategy for protecting logical quantum information encoded in idling surface code patches while some other patches may undergo logical operations by any of the proposed approaches [31, 32, 33, 34, 35, 36].”
Color codes with twists: Construction and universal-gate-set implementation
Gowda, M. G., & Sarvepalli, P. K. (2021) · Physical Review A · doi:10.1103/physreva.104.012603 · Cited by 2
Ouyang, Y., Jing, Y., & Brennen, G. K. (2025) · PRX Quantum · doi:10.1103/p28m-hb6x · Cited by 17
“Another solution, amenable to surface codes, achieves a fault tolerant CCZ gate using local transversal gates and code deformations over a time that scales with the size of the qubit array [ 24 ] .”
Fault-tolerant quantum computation without distillation on a 2D device
Scruby, T. R., Nemoto, K., & Cai, Z. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01133-7 · Cited by 5
“Formoredetailsonthedecodingstrategiesandfault-tolerance oftheprocedurereadersshouldconsult 7,13 .”
InfluentialOn the Fault‐Tolerance Threshold for Surface Codes with General Noise
Chai, J. H., & Ng, H. K. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202200008 · Cited by 2
Finding the disjointness of stabilizer codes is NP-complete
Bostanci, J., & Kubica, A. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043192 · Cited by 2
Quantum repetition codes as building blocks of large-period discrete time crystals
Bomantara, R. W. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.l180304 · Cited by 14
Offloading Quantum Computation by Superposition MaskingPreprint
Jaques, S., & Gidney, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.04577 · Cited by 2
Fault-Tolerant Logical Operators in Quantum Error-Correcting Codes
Webster, P. (2021) · The Sydney eScholarship Repository (The University of Sydney)
Color Code with a Logical Control- S Gate Using Transversal T Rotations
Brown, B. J. (2025) · Physical Review Letters · doi:10.1103/lwxd-fdlb · Cited by 6
Self-citationAn Efficient Analytical Approach for Error Assessment in Quantum Circuits
Nikahd, E., Mohammadzadeh, N., & Shirmohammadi, Z. (2025) · IEEE Access · doi:10.1109/access.2025.3620026
“There are several approaches to make FTQC possible in combination with transversal gates such as magic stats distillation [36], coherent state innjection [37], [38], code-switching [39], [40], code concatenation [41], [42], [43], and pieceable fault-tolerance [30], [44].”
Partial anyon condensation in the color code: A Hamiltonian approach
Haghighi, M. R., & Zarei, M. H. (2025) · Physical review. B./Physical review. B · doi:10.1103/lywr-7s59
“Among different topological systems, topological quantum codes [11–14] which are tools for protecting quantum information against local errors[15, 16], are known also as powerful models for exploring topological phases of matter [17, 18].”
Constant-Depth Magic State Cultivation with Clifford Measurements by Gauging
Hetényi, B., Brown, B. J., & Williamson, D. J. (2026) · Physical Review Letters · doi:10.1103/f7fz-6zsy · Cited by 17
“This feature requires special care when decoding, and can be handled by a just-in-time or on-the-fly decoder [2, 41–43].”
Self-citationAsenbeck, B. E. (2024) · theses.fr (ABES) · doi:10.70675/864373aeze1a1z42cfza4e4zd025f4c944d9 · Cited by 2
Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes
Anonymous, & Schäfer‐Nameki, S. (2026) · PRX Quantum · doi:10.1103/kfxl-rv7c · Cited by 27
Nonstabilizerness as a diagnostic of criticality and exceptional points in non-Hermitian spin chains
Moca, C. P., Sticlet, D., & Dóra, B. (2026) · Physical review. B./Physical review. B · doi:10.1103/6vv5-tsql · Cited by 4
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.