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
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
“This question was analyzed and answered in the affirmative by Gottesman (2014).”
InfluentialMaterial platforms for spin-based photonic quantum technologies
Atatüre, M., Englund, D., Vamivakas, N., Lee, S.-Y., & Wrachtrup, J. (2018) · Nature Reviews Materials · doi:10.1038/s41578-018-0008-9 · Cited by 766
Cai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
“There is ongoing theoretical research to find alternative codes with a more favourable overhead, and recent progress gives reasons to be optimistic (Breuckmann and Eberhardt, 2021; Dinur et al. , 2022; Gottesman, 2014; Panteleev and Kalachev, 2022).”
BackgroundHigh-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
“This spurred interest in more general quantum codes known as low-density parity-check (LDPC) codes 6 .”
BackgroundMethodQuantum advantage with shallow circuits
Bravyi, S., Gosset, D., & König, R. (2018) · Science · doi:10.1126/science.aar3106 · Cited by 406
Fusion-based quantum computation
Bartolucci, S., Birchall, P., Bombín, H., Cable, H., Dawson, C., Gimeno-Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-36493-1 · Cited by 371
“We can introduce a notion of low-density parity check (LDPC) fusion networks that is analogous to other similar constructions in error correction [45, 46].”
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
“Most of the codes designed for quantum computing are of the LDPC type 16,43,44 , meaning that each stabilizer acts on only a small number of qubits and each qubit participates in a small number of stabilizers, where small means a constant independent of the code size.”
BackgroundBonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
“[65] D.”
Quantum error correction : an introductory guide
Roffe, J. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 256
Blueprint for a scalable photonic fault-tolerant quantum computer
Bourassa, J. E., Alexander, R. N., Baragiola, B. Q., & Menicucci, N. C. (2024) · Figshare · Cited by 222
Ataides, J. P. B., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · RePEc: Research Papers in Economics · Cited by 201
Quantum LDPC Codes With Almost Linear Minimum Distance
Panteleev, P., & Kalachev, G. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3119384 · Cited by 165
“Their quantum analogs called quantum LDPC (QLDPC) codes (see [4] for a good review) may play a very important role in design of future fault-tolerant quantum computers [5], [6].”
BackgroundFlag fault-tolerant error correction with arbitrary distance codes
Chamberland, C., & Beverland, M. E. (2018) · Quantum · doi:10.22331/q-2018-02-08-53 · Cited by 159
“and use efficiently-decodable low density parity check (LDPC) codes with high rate [15–17] in a low-overhead FTEC protocol [18].”
BackgroundMethodFocus 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
“In addition, performing gates efficiently on such codes is a difficult task [85,86].”
BackgroundQuantum advantage with noisy shallow circuits
Bravyi, S., Gosset, D., König, R., & Tomamichel, M. (2020) · Nature Physics · doi:10.1038/s41567-020-0948-z · Cited by 144
“The quantum (but not the classical) circuits we consider will be subject to local stochastic noise 23,24 .”
BackgroundConstant overhead quantum fault tolerance with quantum expander codes
Fawzi, O., Grospellier, A., & Leverrier, A. (2021) · Communications of the ACM · doi:10.1145/3434163 · Cited by 111
“In a breakthrough paper, Gottesman has shown that the polylogarithmic overhead was maybe not necessary after all, and that polynomial-time computations could be performed with a noisy circuit with only a constant overhead [4].”
BackgroundMethodResultInfluentialQuantum annealing correction for random Ising problems
Pudenz, K. L., Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.042302 · Cited by 101
Low-overhead fault-tolerant quantum computing using long-range connectivity
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J. (2022) · Science Advances · doi:10.1126/sciadv.abn1717 · Cited by 98
“Our construction highlights parallelism as a key constraint in maintaining low overheads, and we note that this role of parallelism has also been identified in other schemes for quantum computing using LDPC codes, in particular the scheme by Gottesman [32].”
BackgroundMethodInfluentialNeural Belief-Propagation Decoders for Quantum Error-Correcting Codes
Liu, Y.-H., & Poulin, D. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.200501 · Cited by 97
“(a) Quantum bicycle code with code parameter [[256, 32]] and rate r = 0.”
BackgroundInfluentialLeverrier, A., Tillich, J.-P., & Zemor, G. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.55 · Cited by 86
“Among recent developments, the recent paper [15] has shown how fault tolerant quantum computation with constant multiple overhead can be obtained, and quantum LDPC codes are an essential component of the scheme, making them possibly even more appealing.”
BackgroundInfluentialLinear-time maximum likelihood decoding of surface codes over the quantum erasure channel
Delfosse, N., & Zémor, G. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033042 · Cited by 89
Gidney, C., Newman, M., Brooks, P., & Jones, C. (2025) · Nature Communications · doi:10.1038/s41467-025-59714-1 · Cited by 85
Cellular-automaton decoders for topological quantum memories
Herold, M., Campbell, E. T., Eisert, J., & Kastoryano, M. J. (2015) · npj Quantum Information · doi:10.1038/npjqi.2015.10 · Cited by 63
Real-time decoding for fault-tolerant quantum computing: progress, challenges and outlook
Battistel, F., Chamberland, C., Johar, K., Overwater, R. W. J., Sebastiano, F., Skorić, L., Ueno, Y., & Usman, M. (2023) · Nano Futures · doi:10.1088/2399-1984/aceba6 · Cited by 159
Trapping Sets of Quantum LDPC Codes
Raveendran, N., & Vasic, B. V. (2021) · Quantum · doi:10.22331/q-2021-10-14-562 · Cited by 123
“Quantum low-density parity check (QLDPC) codes are an important class of quantum error correction (QEC) [2, 3] codes that can realize scalable fault-tolerant quantum computers (FTQCs) with a finite multiplicative overhead [4].”
BackgroundFully Tunable Longitudinal Spin-Photon Interactions in Si and Ge Quantum Dots
Bosco, S., Scarlino, P., Klinovaja, J., & Loss, D. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.066801 · Cited by 70
Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates
Zeng, W., & Pryadko, L. P. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.230501 · Cited by 48
“Quantum low-density parity-check (q-LDPC) codes is the only class of codes known to combine finite rates with non-zero fault-tolerant (FT) thresholds[1, 2], to allow scalable quantum computation with a finite overhead[3].”
Reducing the overhead for quantum computation when noise is biased
Webster, P., Bartlett, S. D., & Poulin, D. (2015) · Physical Review A · doi:10.1103/physreva.92.062309 · Cited by 43
Scalable Surface-Code Decoders with Parallelization in Time
Tan, X., Zhang, F., Chao, R., Shi, Y., & Chen, J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040344 · Cited by 42
“In most of our experiments, we use a union-find (UF) decoder, as proposed in [4], to decode each individual window (including the forward windows and both types of the sandwich windows).”
BackgroundMethodTansuwannont, T., Chamberland, C., & Leung, D. (2020) · Physical Review A · doi:10.1103/physreva.101.012342 · Cited by 41
“[17] D.”
MethodEfficient decoding of random errors for quantum expander codes
Leverrier, A. (2017) · HAL · Cited by 45
Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound
Raveendran, N., Rengaswamy, N., Rozpędek, F., Raina, A., Jiang, L., & Vasic, B. V. (2022) · Quantum · doi:10.22331/q-2022-07-20-767 · Cited by 55
“Even for fault-tolerant quantum computing, if one can devise high rate codes with good minimum distance, then this can greatly reduce the resource overhead [3].”
BackgroundMethodInfluentialVasmer, M., & Kubica, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030319 · Cited by 39
“Hyperoctahedron codes generalize the [[4,2,2]] code [27] and the aforementioned [[8,3,2]] code (the dual of a d-hyperoctahedron is a d-hypercube).”
BackgroundMethodInfluentialSparse Quantum Codes From Quantum Circuits
Bacon, D., Flammia, S. T., Harrow, A. W., & Shi, J. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2663199 · Cited by 37
Fault-Tolerant Gates on Hypergraph Product Codes
Krishna, A., & Poulin, D. (2021) · Physical Review X · doi:10.1103/physrevx.11.011023 · Cited by 36
Quantifying Nonlocality: How Outperforming Local Quantum Codes Is Expensive
Baspin, N., & Krishna, A. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050505 · Cited by 37
“This sort of connectivity graph might show up naturally for example in Gottesman’s construction of a fault-tolerant quantum circuit using LDPC codes [19].”
BackgroundMethodLocalized statistics decoding for quantum low-density parity-check codes
Hillmann, T., Berent, L., Quintavalle, A. O., Eisert, J., Wille, R., & Roffe, J. (2025) · Nature Communications · doi:10.1038/s41467-025-63214-7 · Cited by 37
“This argument ultimately serves as the proof that ( r, c ) - bounded LDPC codes, with distance scaling as ∼ n α for α > 0 , have a threshold [9, 41, 64].”
Partitioning qubits in hypergraph product codes to implement logical gates
Quintavalle, A. O., Webster, P., & Vasmer, M. (2023) · Quantum · doi:10.22331/q-2023-10-24-1153 · Cited by 35
“The earliest proposal for fault-tolerant logic on LDPC codes relies on state injection protocols that, while achieving a constant overhead per logical qubit in the asymptotic regime, would have substantial finite-size overheads [8].”
BackgroundLavasani, A., Zhu, G., & Barkeshli, M. (2019) · Quantum · doi:10.22331/q-2019-08-26-180 · Cited by 42
“n Research Fellowship, and JQI- PFC-UMD. G.Z. was also supported by ARO-MURI. A Dehn Twist Consider the annulus Ashown in Fig.8a which consists of the points in the (r,θ)-plane with 1 ≤r ≤2 and 3Ref. [28] also proposed methods to reduce this time cost to O(kγD) for γ>0 arbitrarily small, at the cost of increasing t…”
BackgroundMethodInfluentialConnectivity constrains quantum codes
Baspin, N., & Krishna, A. (2022) · Quantum · doi:10.22331/q-2022-05-13-711 · Cited by 74
“This representation was also used for different purposes, see for example [65] or [44].”
BackgroundMethodStabilizer Inactivation for Message-Passing Decoding of Quantum LDPC Codes
Crest, J. D., Mhalla, M., & Savin, V. (2022) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw54588.2022.9965902 · Cited by 64
“qLDPC codes are likely to be the first practical codes used for fault-tolerant quantum computing [4], as they have low weight stabilizer group generators, which makes it possible to extract the error syndrome in a fault tolerant way.”
BackgroundToward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes
Berthusen, N., Devulapalli, D., Schoute, E., Childs, A. M., Gullans, M. J., Gorshkov, A. V., & Gottesman, D. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010306 · Cited by 69
“As these codes can encode multiple logical qubits, the required resources are reduced, in some instances, to a constant [10].”
Self-citationSunami, S., Tamiya, S., Inoue, R., Yamasaki, H., & Goban, A. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010101 · Cited by 72
“Several approaches are known for constructing constant-space-overhead fault-tolerant protocols [22, 23, 25, 73].”
InfluentialEnergy-Consumption Advantage of Quantum Computation
Meier, F., & Yamasaki, H. (2025) · PRX Energy · doi:10.1103/prxenergy.4.023008 · Cited by 75
Beyond Single-Shot Fault-Tolerant Quantum Error Correction
Delfosse, N., Reichardt, B. W., & Svore, K. M. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3120685 · Cited by 45
“Using quantum LDPC codes [23, 24], defined by sparse parity-check matrices, a measurement round can be implemented in constant depth while preserving a low residual noise after correction [35,36,40,41].”
Leverrier, A., & Zémor, G. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3267945 · Cited by 75
“There are two interesting settings for decoding algorithms, depending on whether the errors are arbitrary (or adversarial) or whether they follow a simple stochastic model (such as independent and identically distributed errors or local stochastic errors [1]).”
BackgroundMethodButko, A., Michelogiannakis, G., Williams, S., Iancu, C., Donofrio, D., Shalf, J. M., Carter, J. T., & Siddiqi, I. A. (2020) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc2020.2020.00011 · Cited by 38
“Measurement-dependent feedback: It refers to circuits with conditional gate applications like in Quantum Teleportation [39] or error correction code [40].”
MethodLDPC-cat codes for low-overhead quantum computing in 2D
Ruiz, D., Guillaud, J., Leverrier, A., Mirrahimi, M., & Vuillot, C. (2025) · Nature Communications · doi:10.1038/s41467-025-56298-8 · Cited by 90
“The first model is a phenomenological model (a) where each data qubit undergoes a phase-flip with probability p before each error , 34 , 22] phase-flip code.”
InfluentialNumerical and analytical bounds on threshold error rates for hypergraph-product codes
Kovalev, A. A., Prabhakar, S., Dumer, I. I., & Pryadko, L. P. (2018) · Physical Review A · doi:10.1103/physreva.97.062320 · Cited by 25
“Scalable quantum computation with a constant overhead can be potentially achieved [14] using more general quantum LDPC (low-density parity-check) codes.”
MethodChandra, D., Babar, Z., Nguyen, H. V., Alanis, D., Botsinis, P., Ng, S. X., & Hanzo, L. (2017) · IEEE Access · doi:10.1109/access.2017.2716367 · Cited by 22
Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors
Raveendran, N., Rengaswamy, N., Pradhan, A. K., & Vasic, B. V. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00047 · Cited by 31
Generalized Belief Propagation Algorithms for Decoding of Surface Codes
Old, J., & Rispler, M. (2023) · Quantum · doi:10.22331/q-2023-06-07-1037 · Cited by 38
“In addition to having good decoding properties, it was famously shown by Gottesman that such codes, if they exist, enable fault-tolerant quantum computation with only constant overhead [2].”
BackgroundNumerical study of hypergraph product codesPreprint
Grospellier, A., & Krishna, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.03681 · Cited by 25
“Gottesman showed in [10] that a certain class of quantum error correcting codes called quantum low density parity check (abbrev.”
BackgroundSuppressing Correlated Noise in Quantum Computers via Context-Aware Compiling
Seif, A., Liao, H., Tripathi, V., Krsulich, K., Malekakhlagh, M., Amico, M., Jurcevic, P., & Javadi-Abhari, A. (2024) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca59077.2024.00031 · Cited by 47
“Finally, error correction can robustly remove errors with polynomial or even constant circuit overhead, but this overhead can be large [7, 8].”
BackgroundResilience to Time-Correlated Noise in Quantum Computation
Bombín, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.041034 · Cited by 26
“This constraint can be satisfied by takingD0 1⁄4 ðpi; EiÞ (as long as the correction operators ωσ have minimal support; such a choice of correction operators is valid for these codes, as it yields a threshold for local noise [31]).”
BackgroundGood approximate quantum LDPC codes from spacetime circuit Hamiltonians
Bohdanowicz, T. C., Crosson, E., Nirkhe, C., & Yuen, H. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316384 · Cited by 24
“The existence of QLDPC codes with good parameters and fast encoding/decoding algorithms would have significant practical impact; for example, Gottesman has shown these would imply schemes for fault tolerant quantum computation with constant overhead [26].”
MethodHigh-performance fault-tolerant quantum computing with many-hypercube codes
Goto, H. (2024) · Science Advances · doi:10.1126/sciadv.adp6388 · Cited by 70
“In contrast, quantum low-density parity-check (qLDPC) codes [17] are known for their ability to achieve constant encoding rates, and therefore have been studied over the past decade to mitigate the above overhead issue [18, 19].”
InfluentialSymbolic Execution for Quantum Error Correction Programs
Fang, W. S., & Ying, M. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3656419 · Cited by 43
“…these quantum hardware suffer from errors caused by quantum noise and inaccurate quantum gate implementations, so deploying quantum error correction (QEC) programs on quantum hardware is the key to large-scale quantum computing in the future [Aharonov and Ben-Or 1997; Gottesman 2014; Shor 1996].”
An introduction into fault-tolerant quantum computing
Paler, A., & Devitt, S. J. (2015) · Proceedings of the 52nd Annual Design Automation Conference · doi:10.1145/2744769.2747911 · Cited by 16
“Their existence is the result of a high τ (called in the quantum computing literature the error threshold), but can be eliminated by using more powerful QECs (e.g. surface-code [5]) that require increased resource and computational overheads (Sec.”
A Low-Resource Quantum Factoring Algorithm
Bernstein, D. J., Biasse, J., & Mosca, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59879-6_19 · Cited by 16
“In what Gottesman calls the “standard version” (see [15]) of the threshold theorem for fault-tolerant quantum computing, a logical circuit using Q qubits and containing T gates is converted into a fault-tolerant circuit using Q(logQT ) physical qubits.”
BackgroundFault-Tolerant Coding for Quantum Communication
Christandl, M., & Müller‐Hermes, A. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3169438 · Cited by 27
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes
Eberhardt, J. N., & Steffan, V. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3521638 · Cited by 57
“Quantum low-density parity-check (qLDPC) codes yield a promising pathway to scalable fault-tolerant quantum computation with constant overhead [Got14].”
BackgroundA review of design concerns in superconducting quantum circuits
Levenson-Falk, E. M., & Shanto, S. (2025) · Materials for Quantum Technology · doi:10.1088/2633-4356/ade10d · Cited by 30
“That is, if each qubit can be made to run high-fidelity two-qubit gates with a greater number of other qubits, then fault-tolerant QEC can be achieved with fewer resources (qubits and operations) and at a higher gate error rate [71].”
Fault-tolerant hyperbolic Floquet quantum error correcting codes
Fahimniya, A., Dehghani, H., Bharti, K., Mathew, S., Kollár, A. J., Gorshkov, A. V., & Gullans, M. J. (2025) · Quantum · doi:10.22331/q-2025-09-05-1849 · Cited by 44
“In an LDPC-type quantum error-correcting code, each check operator acts on only a few qubits, and each qubit is part of only a few checks [20, 21, 22, 23, 24, 12, 25].”
InfluentialZhu, G., Sikander, S., Portnoy, E., Cross, A. W., & Brown, B. J. (2025) · PRX Quantum · doi:10.1103/wcxs-w69t · Cited by 82
“Although there exists a scheme with constant space overhead [12], it only allows the sequential application of logic gates and is therefore relatively slow in practice.”
Efficient preparation of large-block-code ancilla states for fault-tolerant quantum computation
Zheng, Y.-C., Lai, C., & Brun, T. A. (2018) · Physical Review A · doi:10.1103/physreva.97.032331 · Cited by 22
Erasure Decoding for Quantum LDPC Codes via Belief Propagation with Guided Decimation
Gökduman, M., Yao, H., & Pfister, H. D. (2024) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton63246.2024.10735275 · Cited by 19
“These codes are an extension of classical LDPC codes [33], [34] and they offer promising performance for fault-tolerant quantum computing due to their low overhead relative to topological codes [1], [11], [35].”
BackgroundA Numerical Study of Bravyi-Bacon-Shor and Subsystem Hypergraph Product Codes
Li, M., & Yoder, T. J. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00024 · Cited by 12
“Fault-tolerant quantum computation with constant over head requires a code family with constant rate and growing distance [5], and is therefore precluded in two-dimensions.”
BackgroundInglesant, P., Hartswood, M., & Jirotka, M. D. (2016) · Oxford University Research Archive (ORA) (University of Oxford) · Cited by 33
Efficient fault-tolerant code switching via one-way transversal CNOT gates
Heußen, S., & Hilder, J. (2025) · Quantum · doi:10.22331/q-2025-09-03-1846 · Cited by 12
“The formal requirements of quantum fault tolerance add an additional gate and/or qubit overhead to any quantum circuit, which – however – has been shown to not scale unfavorably with the size of such circuit [3].”
Combining Hard and Soft Decoders for Hypergraph Product Codes
Grospellier, A., Grouès, L., Krishna, A., & Leverrier, A. (2019) · HAL · Cited by 13
Homomorphic Logical Measurements
Huang, S., Jochym-O’Connor, T., & Yoder, T. J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030301 · Cited by 37
Fault-Tolerant Logical Measurements via Homological Measurement
Ide, B., Gowda, M. G., Nadkarni, P. J., & Dauphinais, G. (2025) · Physical Review X · doi:10.1103/physrevx.15.021088 · Cited by 61
Nonlocal multiqubit quantum gates via a driven cavity
Jandura, S., Srivastava, V., Pecorari, L., Brennen, G. K., & Pupillo, G. (2024) · Physical Review A · doi:10.1103/physreva.110.062610 · Cited by 18
“low density parity check (LDPC) codes [11, 12], which have considerably lower overhead than the currently leading approach of surface codes [13].”
Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
Shi, Y. B., Patil, A., & Guha, S. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010339 · Cited by 26
“For example, Figure 6 illustrates stabilizers, logical operators, and decoding measurements for a planar code with parameters 2 L 2 − 2 L + 1 , 1 , L .”
Minimal distances for certain quantum product codes and tensor products of chain complexes
Zeng, W., & Pryadko, L. P. (2020) · Physical Review A · doi:10.1103/physreva.102.062402 · Cited by 19
“[23] D.”
BackgroundGottesman, D. (2016) · Nature · doi:10.1038/nature20479 · Cited by 14
Self-citationContinuous-time dynamics and error scaling of noisy highly entangling quantum circuits
Donatella, K., Denis, Z., Boité, A. L., & Ciuti, C. (2021) · Physical Review A · doi:10.1103/physreva.104.062407 · Cited by 17
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
“Since then, this scheme has been improved in terms of overhead by many scholars [35, 122, 123].”
BackgroundMethodPartial Syndrome Measurement for Hypergraph Product Codes
Berthusen, N., & Gottesman, D. (2024) · Quantum · doi:10.22331/q-2024-05-14-1345 · Cited by 23
“Very briefly, the argument requires that the syndrome error does not form clusters on the syndrome adjacency graph [4] for it to be tolerable.”
BackgroundSelf-citationMeasurement-free, scalable, and fault-tolerant universal quantum computing
Butt, F., Locher, D. F., Brechtelsbauer, K., Büchler, H. P., & Müller, M. (2025) · Science Advances · doi:10.1126/sciadv.adv2590 · Cited by 28
“However, running algorithms fault-tolerantly requires an additional building block, namely QEC [36].”
Darmawan, A. S., Nakata, Y., Tamiya, S., & Yamasaki, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023055 · Cited by 19
Dual-code quantum computation model
Choi, B.-S. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1022-0 · Cited by 12
“Subse-quently, many interesting error-correction codes and their accuracy threshold values were researched for surface code [16,20,51], color code [46,50], and even LDPC code [17,22].”
BackgroundRobust sparse IQP sampling in constant depth
Paletta, L., Leverrier, A., Sarlette, A., Mirrahimi, M., & Vuillot, C. (2024) · Quantum · doi:10.22331/q-2024-05-06-1337 · Cited by 8
“We use the local stochastic quantum noise model from [19] that is general enough to cover a wide class of applications.”
InfluentialImproved rate-distance trade-offs for quantum codes with restricted connectivity
Baspin, N., Guruswami, V., Krishna, A., & Li, R. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad8370 · Cited by 17
“It can also be used for different purposes, see for example [19] or [14].”
Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes With Overcomplete Check Matrices
Miao, S., Schnerring, A., Li, H., & Schmalen, L. (2025) · IEEE Access · doi:10.1109/access.2025.3539475 · Cited by 25
“Thanks to the potential of providing fault-tolerance with constant overhead [2] and the recent breakthroughs in designing asymptotically good quantum low-density parity-check (QLDPC) codes [3]–[6], QLDPC codes are among the most promising candidates for future QEC schemes.”
Old, J., Rispler, M., & Müller, M. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad5eb6 · Cited by 18
“To highlight a result in this direction, it has been shown that codes with bounded connectivity attaining a constant encoding rate could be used for constant overhead fault-tolerant quantum computation [11].”
BackgroundTime-Efficient Logical Operations on Quantum Low-Density Parity Check Codes
Zhang, G., & Li, Y. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.070602 · Cited by 56
“The results demonstrate that fully parallelized fault-tolerant quantum computing can be achieved on arbitrary qLDPC codes.”
A linear-time benchmarking tool for generalized surface codesPreprint
Delfosse, N., Iyer, P. S., & Poulin, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.04256 · Cited by 24
“Their main advantage over planar surface codes is that they could considerably reduce the overhead [33].”
BackgroundAbelian and Non-Abelian Quantum Two-Block Codes
Wang, R., Lin, H.-K., & Pryadko, L. P. (2023) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc57237.2023.10273492 · Cited by 32
“Select a = 1+ x+ y + x yx and b = 1+x+y+yx to get an essentially non-abelian 2BGA code LP[a, b] with parameters [[24, 5, 3]]2.”
BackgroundCluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes
Yao, H., Gökduman, M., & Pfister, H. D. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3578597 · Cited by 12
“Among various error correction schemes, quantum low-density parity-check (LDPC) codes, such as hypergraph product codes [1], stand out as promising candidates as they offer a much lower overhead [2], [3] compared with topological codes such as surface codes [4], [5] and color codes [6].”
Shutty, N., Wootters, M. K., & Hayden, P. M. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00028 · Cited by 10
“9 Specifically, in order to obtain fault-tolerance with a constant factor overhead in quantum circuit depth, the best current construction has a threshold that is orders of magnitude worse than thresholds from proposals with super-constant overhead [31], [32] .”
BackgroundFault-tolerant preparation of quantum polar codes encoding one logical qubit
Goswami, A., Mhalla, M., & Savin, V. (2023) · Physical Review A · doi:10.1103/physreva.108.042605 · Cited by 10
“Further, measuring the stabilizer generators using the standard “phase kickback trick” [2], similar to the case of quantum LDPC codes [15], is also not faulttolerant, due to the high weights of generators.”
MethodLeverrier, A., & Zémor, G. (2024) · ACM Transactions on Algorithms · doi:10.1145/3663763 · Cited by 26
Quantum codes do not fix isotropic errors
de Lacalle, J. G. L., Coronado, L. M. P., & de Oliveira, A. L. F. (2021) · Quantum Information Processing · doi:10.1007/s11128-020-02980-3 · Cited by 7
The Need for Structure in Quantum LDPC Codes
Eldar, L., Ozols, M., & Thompson, K. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2952366 · Cited by 8
“quantum LDPC codes (qLDPC) would likely facilitate the construction of quantum computers [6].”
BackgroundGolden codes: quantum LDPC codes built from regular tessellations of hyperbolic 4-manifolds
Londe, V., & Leverrier, A. (2019) · Quantum Information and Computation · doi:10.26421/qic19.5-6 · Cited by 8
“In many cases, it is natural to consider constant-rate codes where k = Θ( n ): such codes for instance allow one to obtain quantum fault-tolerant computation with constant space overhead [Got14].”
BackgroundBounds on Autonomous Quantum Error Correction
Shtanko, O., Liu, Y.-J., Lieu, S., Gorshkov, A. V., & Albert, V. V. (2025) · Quantum · doi:10.22331/q-2025-07-22-1804 · Cited by 21
“Our global decoder model can be seen as an autonomous version of active error correction with the assumption that rounds of error correction essentially “take zero time” (cf. [42]).”
Reducing Quantum Error Correction Overhead With Versatile Flag-Sharing Syndrome Extraction Circuits
Liou, P.-H., & Lai, C. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3572764 · Cited by 9
Fan, J., Li, J., Wang, Y., Li, Y., Hsieh, M.-H., & Du, J. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3201239 · Cited by 7
“While fault-tolerant quantum computation [38] and communication [6], [39] prefer fast encodale and decodable codings, Q1 and Q2 are thus practical and beneficial for the future use.”
BackgroundMethod
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.