Fault-Tolerant quantum computation with constant overhead
The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Abstract
What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Self-citationMaximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712 · cited 1×
“The advantage of the 2-D hyperbolic surface codes is that there are standard algorithms for efficiently decoding surface codes, such as Edmonds’ maximum matching algorithm [9].”
MethodDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“Asymptotically, this is a very favorable scaling of overhead (ratio of physical qubits to logical qubits), but in practice the constant factors hidden by the big-O notation are quite large, ranging from hundreds or thousands for the most efficient known protocols to billions for protocols maximally optimized for high…”
BackgroundTheory of fault-tolerant quantum computation
Gottesman, D. (1998) · Physical Review A · doi:10.1103/physreva.57.127 · Cited by 947 · cited 2×
“[13] showed that fault-tolerant protocols exist for stabilizer codes encoding multiple qubits per block, with further improvements in [34].”
BackgroundMethodSelf-citationSipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
Fault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892
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 1×
“Indeed, the same arguments used in this paper can also show the existence of a threshold for the toric code, yet simulations suggest that the threshold for fault-tolerant protocols for the toric code is much better than would be implied by the proofs used here [27].”
Background
Cited by
Items 101–166 of 166
Diamanti, E., & Kashefi, E. (2017) · Nature Physics · doi:10.1038/nphys3972 · Cited by 5
Robust Quantum Entanglement at (Nearly) Room TemperaturePreprint
Eldar, L. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2021.49 · Cited by 8
Valentini, M., van Mourik, M. W., Butt, F., Wahl, J., Dietl, M., Pfeifer, M., Anmasser, F., Colombe, Y., Rössler, C., Holz, P. C., et al. (2025) · Physical Review X · doi:10.1103/b9s1-6r44 · Cited by 30
“Furthermore, the code family of quantum Low Density Parity Check (qLDPC) codes holds the promise of constant encoding rates, thus enabling low-overhead fault-tolerant quantum computing [90, 91].”
Toward Quantum CSS-T Codes from Sparse Matrices
Camps-Moreno, E., López, H. H., Matthews, G. L., & McMillon, E. (2024) · doi:10.1109/isit-w61686.2024.10591766 · Cited by 6
“Another important family of quantum error-correcting codes is formed by the quantum low-density parity-check (LDPC) codes [7], [8] which are CSS codes based on sparse parity-check matrices.”
BackgroundExpansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes
Dinur, I., Lin, T.-C., & Vidick, T. (2024) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs61266.2024.00031 · Cited by 34
“Good codes with low-density parity checks are particularly sought after for their potential application to fault-tolerance [Got14] and quantum complexity theory [ABN23].”
Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
Steinberg, M., Fan, J., Harris, R. J., Elkouss, D., Feld, S., & Jahn, A. (2025) · Quantum · doi:10.22331/q-2025-08-08-1826 · Cited by 26
“The utility of QEC codes for practical quantum processing depends on a number of properties, such as finite code rates, a threshold against physical errors, low-weight stabilizer checks, and fault-tolerant protocols for universal logical operations [2, 3, 4].”
Variance of the sum of independent quantum computing errors
de Lacalle, J. G. L., & Coronado, L. M. P. (2019) · Quantum Information and Computation · doi:10.26421/qic19.15-16-3 · Cited by 5
“General studies and surveys on the subject [12, 13, 14, 15, 16, 17, 18, 19, 20], about the quantum computation threshold theorem [21, 22, 23, 24, 25], quantum error correction codes [26, 27, 28, 29], concatenated quantum error correction codes [30] and articles related to topological quantum codes…”
BackgroundLearning to Decode Trapping Sets in QLDPC Codes
Pradhan, A. K., Raveendran, N., Rengaswamy, N., Xiao, X. W., & Vasic, B. V. (2023) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc57237.2023.10273526 · Cited by 5
“As pointed out by Gottesman [1] and Kovalev and Pryadko [2], QLDPC codes are the only known class of quantum error correction (QEC) codes that permit faulttolerant error correction with asymptotically nonzero rate.”
BackgroundExact results on finite size corrections for surface codes tailored to biased noise
Xiao, Y., Srivastava, B., & Granath, M. (2024) · Quantum · doi:10.22331/q-2024-09-11-1468 · Cited by 10
“…developments, new error correcting codes that cater to hardware specificities such as low qubit connectivity [31–34], or biased single-qubit noise profiles [35–42], as well as codes with a higher density of logical qubits per physical qubit [43–45], are being developed and explored theoretically.”
BackgroundResource optimization for fault-tolerant quantum computingPreprint
Paetznick, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.5124 · Cited by 8
How to Fault-Tolerantly Realize Any Quantum Circuit with Local Operations
Choe, S. H., & König, R. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010357 · Cited by 7
“The notion of local stochastic noise was pioneered by Gottesman [18].”
Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel
Lloyd, S., Shor, P. W., & Thompson, K. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2925100 · Cited by 3
“Since quantum stabilizer codes with locally generated stabilizers potentially have efficient decoding schemes [11], a natural question is: How close to the Erasure capacity can we get with local codes while maintaining low decoding error? For both classical [5] and quantum [7] Erasure channels, we cannot expect to com…”
BackgroundTrapping Set Analysis of Finite-Length Quantum LDPC Codes
Raveendran, N., & Vasic, B. V. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518154 · Cited by 4
A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes
Miao, S., Mandelbaum, J., Jäkel, H., & Schmalen, L. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619120 · Cited by 11
“Quantum low-density parity-checks (QLDPCs) codes are among the most promising candidates for future quantum error correction (QEC) schemes [1].”
BackgroundFreire, B. C. A., Delfosse, N., & Leverrier, A. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195424 · Cited by 14
“Quantum Low-Density Parity-Check (qLDPC) codes [1] are becoming an increasingly attractive approach for the implementation of fault-tolerant quantum computing because their high rate translates into reduced overhead compared to the surface code and its vanishing rate [2]–[4].”
Zhao, Y., & Liu, D. E. (2025) · PNAS Nexus · doi:10.1093/pnasnexus/pgaf063 · Cited by 4
A 3D lattice defect and efficient computations in topological MBQC
Tournaire, G., Schwiering, M., Raussendorf, R., & Bachmann, S. (2026) · Quantum · doi:10.22331/q-2026-02-06-1997 · Cited by 4
“…under which the theorem can be applied [7, 8], (ii) improving the value of the error threshold [9], (iii) reducing the cost of fault-tolerance [10, 11, 12, 13, 14], and (iv) adapting fault-tolerance to specific architectures with certain operational constraints, such as limitations in the range…”
Rofougaran, R., Wang, R. C., Ajagekar, A., & You, F. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb3c7 · Cited by 5
“Furthermore, incorporating quantum error correction codes, such as qLDPC codes [56] or surface codes [57, 58], into ISA could enable the resulting gate sequence to be made fault-tolerant.”
Liu, F., Tang, G., Duan, L.-M., & Wu, Y. (2025) · Physical Review Applied · doi:10.1103/c7w3-pxls · Cited by 10
Fault-Tolerant Quantum Computation with Constant Overhead for General Noise
Christandl, M., Fawzi, O., & Goswami, A. (2025) · PRX Quantum · doi:10.1103/k4cm-pp9p · Cited by 4
Quantum Maxwell Erasure Decoder for qLDPC codes
Freire, B. C. A., Régent, F.-M. L., & Leverrier, A. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11654048 · Cited by 5
“Quantum low-density parity-check (qLDPC) codes form a promising approach to low-overhead quantum fault tolerance [1], [2].”
Parallel Logical Measurements via Quantum Code Surgery
Cowtan, A., He, Z., Williamson, D. J., & Yoder, T. J. (2026) · PRX Quantum · doi:10.1103/gj8x-n5gg · Cited by 79
Quantum Codes Do Not Increase Fidelity against Isotropic Errors
de Lacalle, J. G. L., Coronado, L. M. P., de Oliveira, A. L. F., & Martin-Cuevas, R. (2023) · Journal of Applied Mathematics and Physics · doi:10.4236/jamp.2023.112034 · Cited by 3
“General studies and surveys on the subject [20, 21, 22, 23, 24, 25, 26, 27], about the quantum computation threshold theorem [28, 29, 30, 31], quantum error correction codes [32, 33, 34, 35], concatenated quantum error correction codes [36, 37] and articles related to topological quantum codes [38, 39].”
BackgroundAnalysis of Syndrome-Based Iterative Decoder Failure of QLDPC Codes
Morris, K. D., Pllaha, T., & Kelley, C. A. (2023) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc57237.2023.10273573 · Cited by 2
Energy Barrier of Hypergraph Product Codes
Zhao, G., Doherty, A. C., & Kim, I. H. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.180601 · Cited by 9
“This recent interest is in part due to Gottesman, who showed that with quantum LDPC codes, one can achieve a constant overhead for fault-tolerant quantum computation [6].”
BackgroundCavity polariton blockade for non-local entangling gates with trapped atoms
Srivastava, V., Jandura, S., Brennen, G. K., & Pupillo, G. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adfd79 · Cited by 3
Shi, Y. B., Patil, A., & Guha, S. (2025) · Physical Review Letters · doi:10.1103/2bp8-cdxc · Cited by 11
“The constant c serves as an overall prefactor, while the exponent αn δ characterizes the scaling of the code distance with the number of physical qubits in a given family of quantum codes [63].”
On the Efficacy of the Peeling Decoder for the Quantum Expander Code
Prabhu, J. S., Vaishya, A., Bhatnagar, S., Kolhe, A. M., Lalitha, V., & Kumar, P. V. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195550 · Cited by 1
“Gottesman [2] showed that it is possible to build fault-tolerant quantum circuits using such quantum LDPC codes.”
Pieceable fault tolerant conversion between 5-qubit code and 7-CSS code
Lin, C., Yang, G., Luo, Q.-B., & Li, X. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02740-3 · Cited by 2
“It has also been proved that when the physical error rate p phy is below a certain constant threshold [2,9,14], any quantum circuit consisting of n physical elementary components (measurement, gate and state preparation) can be simulated in a fault tolerant manner with a cost up to O ( poly ( log (…”
BackgroundUpper Bounds on Systoles of High-Dimensional Expanders Using Quantum CodesPreprint
Eldar, L., Ozols, M., & Thompson, K. (2016) · arXiv (Cornell University) · Cited by 2
Improving post-quantum cryptography through cryptanalysis
Schanck, J. M. (2020) · UWSpace (University of Waterloo) · Cited by 6
Neural Belief Propagation Decoders for Concatenated Calderbank-Shor-Steane Codes
Fan, J., & Zhang, J. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10622478 · Cited by 1
“Quantum error correction (QEC) is used in quantum computing to protect quantum information from decoherence and other quantum noise errors [1].”
MethodOuyang, Y., Jing, Y., & Brennen, G. K. (2025) · PRX Quantum · doi:10.1103/p28m-hb6x · Cited by 17
“Finally the logical CZ gate is done with 3 cavity pulses and there are two of them.”
Approximate Quantum Error Correction with 1D Log-Depth Circuits
Liu, G., Du, Z., Liu, Z.-W., & Ma, X. (2026) · PRX Quantum · doi:10.1103/7rzk-2jyh · Cited by 11
Vast World of Quantum Advantage
Huang, H.-Y., Choi, S., McClean, J. R., & Preskill, J. P. (2026) · Physical Review X · doi:10.1103/tn89-g1xz · Cited by 77
“…quantum locally testable codes, a depth-D quantum circuit on n qubits with C ideal gates can be simulated by a noisy quantum circuit that maintains a constant space overhead [using only O ð n Þ qubits] and near-logarithmic time overhead [using only D log 1 þ o ð 1 Þ ð C= ϵ Þ depth] [52,53].”
Quantum LDPC Codes From Intersecting Subsets
Ostrev, D. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3402091 · Cited by 6
“A central issue in the study of fault-tolerance with quantum LDPC codes is the ability to correct errors even when syndrome extraction is noisy [27], [28], [30].”
BackgroundEfficient decoding of random errors for quantum expander codes
Fawzi, O., Grospellier, A., & Leverrier, A. (2018) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3188745.3188886 · Cited by 47
“A similar analysis has been done in [19] and [13] for the maximum likelihood decoding algorithm of quantum LDPC codes and we could also apply the same arguments for the bit-flip algorithm of classical expander codes.”
BackgroundMethodInfluentialEfficient Decoding Scheme of Non-Uniform Concatenation Quantum Code with Deep Neural Network
Lin, C., Wang, Y., Wu, J., & Yang, G. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-020-04706-8 · Cited by 1
“…associated with fault-tolerant syndrome measurement such as error detection of subsystem codes [21, 22] or low-density parity-check (LDPC) codes [23]; For small quantum codes, fault-tolerant syndrome measurement circuits can also be efficiently realized by using a single ancillary qubit per…”
BackgroundHaverkort, H. J., & Toma, L. (2016) · Springer eBooks · doi:10.1007/978-1-4939-2864-4_585 · Cited by 4
Trapping Sets of Iterative Decoders for Quantum and Classical Low-Density Parity-Check Codes
Raveendran, N. (2021) · UA Campus Repository (The University of Arizona) · Cited by 4
Partitioning qubits in hypergraph product codes to implement logical gatesPreprint
Quintavalle, A. O., Webster, P., & Vasmer, M. (2022) · arXiv (Cornell University) · doi:10.17169/refubium-41189 · Cited by 1
Yahweh, B., Ekanem, A. M., George, N. J., Oduntan, E. O., Mohammed, S. S. N., Abdulhamid, A., Takim, B. N., Ante, J. E., Emmanuel, Y., & Essang, S. O. (2025) · Research Square · doi:10.21203/rs.3.rs-7262536/v1 · Cited by 1
Automated equivalence checking of quantum information systems
Ardeshir-Larijani, E. (2026) · Warwick Research Archive Portal (University of Warwick) · doi:10.82444/warw.33648946
Efficient Fault-Tolerant Syndrome Measurement of Quantum Error-Correcting Codes Based on "Flag"
Wei, Q., Quan, D., Liu, J., & Pei, C. (2019) · International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) · doi:10.1109/pdcat46702.2019.00041
“Since the emergence of quantum error-correcting codes (QECC) [1], [2] makes the decoherence of quantum systems no longer an insurmountable problem, quantum computers have made rapid progress in recent years [3].”
BackgroundMethodInfluentialLin, C., Yang, G., & Wu, J. (2020) · IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA) · doi:10.1109/icaica50127.2020.9182439 · Cited by 1
“However, given the limitations of current quantum computers, called noisy intermediate-scale quantum (NISQ) computers, high-fidelity quantum circuits for the compiling of certain quantum algorithms always require very large quantum resources[4, 5].”
BackgroundLin, C., Yang, G., & Song, X. (2021) · arXiv (Cornell University)
Irreducible multi-partite correlations as an order parameter for k-local nontrivial statesPreprint
Alavirad, Y., & Lavasani, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.05269 · Cited by 1
“quantum LDPC codes [5, 6] and random quantum codes [7, 8].”
BackgroundFault-Tolerant Logical Operators in Quantum Error-Correcting Codes
Webster, P. (2021) · The Sydney eScholarship Repository (The University of Sydney)
Quaternary-Binary Message-Passing Decoder for Quantum LDPC Codes
Chytas, D., Raveendran, N., Pradhan, A. K., & Vasic, B. V. (2023) · Globecom · doi:10.1109/globecom54140.2023.10436874
“Speaking of the [[106 , 2 , 9]] code, for error rates lower than 0 .”
BackgroundMethodInfluentialShiraishi, K., Yamasaki, H., & Murao, M. (2024) · Physical Review A · doi:10.1103/physreva.110.052617 · Cited by 2
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
Advancing Finite-Length Quantum Error Correction Using Generalized Bicycle Codes
Mostad, O. Å., Lin, H.-Y., Rosnes, E., Lee, D.-S., & Lai, C. (2025) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc65386.2025.11154497 · Cited by 4
“Recent advancements in quantum low-density parity-check (LDPC) codes [6] have introduced more efficient methods for achieving reliable quantum computation [7], [8].”
Observation of a fault tolerance threshold with concatenated codes
Sommers, G. M., Foss‐Feig, M., Hayes, D., Huse, D. A., & Gullans, M. J. (2025) · Physical Review Research · doi:10.1103/v477-jw8l · Cited by 6
Mean Estimation in High-Dimensional Binary Timeinhomogeneous Markov Gaussian Mixture Models
Kadry, A. E. L., Zhang, Y., & Weinberger, N. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195426
Symmetry-enriched topological order and quasifractonic behavior in Z N stabilizer codes
He, S., & Song, H. S. (2026) · Physical review. B./Physical review. B · doi:10.1103/f35h-pmfn · Cited by 1
High-dimensional quantum X Y Z product codes for biased noise
Liang, Z., Yi, Z., Yang, F., Chen, J., Wang, Z., & Wang, X. (2025) · Physical Review A · doi:10.1103/rrfk-1b51 · Cited by 3
Accelerating Fault-Tolerant Quantum Computation with Good Quantum Low-Density Parity-Check Codes
Zhang, G., Zhu, Y., & Li, Y. (2026) · PRX Quantum · doi:10.1103/3fj5-gn1h · Cited by 9
Realization of a quantum error detection code with a dynamically reassigned ancillary qubit
Kazmina, A. S., Polyanskiy, A. M., Egorova, E. Y., Abramov, N. N., Kalacheva, D. A., Lubsanov, V. B., Bolgar, A. N., & Simakov, I. A. (2026) · Applied Physics Letters · doi:10.1063/5.0288597
“In contrast, platforms benefiting from all-to-all connectivity, such as trapped-ion systems, enable more hardware-efficient encodings of logical qubits, for example, low-density parity-check (LDPC) codes [30, 31].”
Near-Optimal Decoding Algorithm for Color Codes Using Population Annealing
Martínez-García, F., Pereira, F. R. F., & Parrado-Rodríguez, P. (2026) · Entropy · doi:10.3390/e28010091 · Cited by 2
“Also, we only consider high enough distances so that finite-size effects do not affect our analysis.”
Absorbing sets in quantum LDPC codes
Morris, K. D., Pllaha, T., & Kelley, C. A. (2026) · Advances in Mathematics of Communications · doi:10.3934/amc.2026023 · Cited by 1
“Their quantum analogues, quantum LDPC (QLDPC) codes, gained popularity due to Gottesman’s breakthrough discovery [4], showing that constant overhead can be achieved with constant encoding rate.”
Decoding of LDPC quantum codes
Grouès, L. (2022) · theses.fr (ABES) · doi:10.70675/4405a9b9z4ce7z49bez9fc0z6b5a10ebf2d1 · Cited by 2
Fault-tolerant manipulation of quantum information with LDPC stabilizer codes
Guernut, A. (2025) · theses.fr (ABES) · doi:10.70675/5ce1a846zc6a5z4918z83a4z8da52185d637 · Cited by 1
Anonymous, & Yamasaki, H. (2026) · Physical Review A · doi:10.1103/6y9t-4zjp · Cited by 1
“[33], we assume a local stochastic Pauli error model.”
Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory
Kuo, K.-Y., & Lai, C. (2026) · Quantum · doi:10.22331/q-2026-09-10-2207 · Cited by 7
Enhancing Surface Code Decoding with Adaptive Machine Learning–Based Quantum Error Correction
Hussain, A., Rani, P., Lande, J., Gupta, N., Haldorai, A., & Sujitha, R. (2026) · International Conference on Advancements in Smart, Secure and Intelligent Computing (ASSIC) · doi:10.1109/assic70037.2026.11717454
“Reducing physical error rates to below 10⁻¹⁵ through quantum error correction (QEC) [3] is necessary in order to achieve fault-tolerant quantum computation that can run complex algorithms like Shor's factorization or a quantum simulation.”
Baradziej, S. (2026) · Frontiers in Computer Science · doi:10.3389/fcomp.2026.1914634
Metadata
- Authors
- Gottesman, D.
- Affiliations
- Perimeter Institute (CA)
- Corresponding author
- Gottesman, Daniel
- ORCID
- Gottesman, Daniel
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2014-11
- Volume
- 14
- Issue
- 15&16
- Pages
- 1339-1371
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W1959392488
- Cited by
- 172
- References
- 40
- Citations by year
- 2026: 15 · 2025: 36 · 2024: 25 · 2023: 16 · 2022: 14 · 2021: 15 · 2020: 11 · 2019: 13 · 2018: 8 · 2017: 5 · 2016: 6 · 2015: 7 · 2014: 1
- FWCI
- 6.26
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Quantum Information and Computation (publishedVersion)
- Funders
- Government of Canada
- Industry Canada
- Institut Périmètre de physique théorique
- Division of Mathematical Sciences
- 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, quantum low-density parity-check codes, quantum error-correcting codes, quantum circuits
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.