High-threshold and low-overhead fault-tolerant quantum memory
Open accessThe DOI matches its Crossref record; 79 of the 82 references it cites were found in a registry or an index; 22 of the 34 sources its claims cite were checked for support.
Abstract
The accumulation of physical errors 1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction 4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm 5 . We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes 6 . Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code 7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length- n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
Overview
CoChat Summary
## TL;DR
The paper presents a family of bivariate bicycle (BB) LDPC quantum codes and an end-to-end fault-tolerant memory protocol with low overhead. In numerical simulations, the authors report an error threshold/pseudo-threshold of about 0.7% and show that a 12-logical-qubit code can be preserved for nearly 1 million syndrome cycles using 288 physical qubits at physical error rate 0.1%.
## Key findings
- The proposed BB codes have weight-6 check operators, degree-6 Tanner graphs, and thickness 2, meaning their connectivity can be split into two edge-disjoint planar subgraphs.
- The authors report an error threshold close to 0.7% for the standard circuit-based noise model, “on par with the surface code” and exceeding other high-rate LDPC codes known to them.
- For the [[144, 12, 12]] code, they state a net encoding rate of 1/24 and that it can preserve 12 logical qubits for nearly 1 million syndrome cycles using 288 physical qubits at physical error rate 0.1%.
- Compared with separate surface-code patches, they report about a 10× reduction in physical-qubit overhead for the distance-12 BB code in the example they analyze.
## Methods
- The paper introduces bivariate bicycle (BB) stabilizer codes defined from pairs of bivariate polynomials/matrices \(A\) and \(B\), yielding CSS codes with \(n=2\ell m\) data qubits and six-qubit check operators.
- They analyze code structure through the Tanner graph, proving results about connectivity, toric layouts, and thickness-2 planar decompositions of the graph.
- Performance is evaluated with an end-to-end fault-tolerant memory protocol under a circuit-based noise model where each operation fails independently with probability \(p\), using a BP-OSD decoder adapted to circuit noise and numerical simulations of logical error rates.
## Limitations
- The authors explicitly note that it remains unclear whether the code examples can be scaled up while retaining the high encoding rate in the limit of large code length.
- They also state that optimization of the code layout satisfying specific hardware constraints is left for future work.
- Evident from the text: the reported performance is based on numerical simulations and, for lower error rates, extrapolation/fitting, rather than a hardware demonstration.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures
![Fig. 1 Tanner graphs of surface and BB codes. a, Tanner graph of a surface code, for comparison. b, Tanner graph of a BB code with parameters [[144, 12, 12]] embedded into a torus. Any edge of the Tanner graph connects a data and a check vertex. Data qubits associated with the registers q(L) and q(R) are shown by blue and orange circles. Each vertex has six incident edges including four short-range edges (pointing north, south, east and west) and two long-range edges. We only show a few long-range edges to avoid clutter. Dashed and solid edges indicate two planar subgraphs spanning the Tanner graph, see the Methods. c, Sketch of a Tanner graph extension for measuring Z¯ and X¯ following ref. 50, attaching to a surface code. The ancilla corresponding to the X¯ measurement can be connected to a surface code, enabling load-store operations for all logical qubits by means of quantum teleportation and some logical unitaries. This extended Tanner graph also has an implementation in a thickness-2 architecture through the A and B edges (Methods).](https://figures.cochat.ai/paper-figures/20af192c4ee94b7fa6b80267a250cfa4/high-threshold-and-low-overhead-fault-tolerant-quantum-memory-figure-1.jpg)

![Fig. 3 Noise properties of BB codes. a, Logical versus physical error rate for small examples of BB LDPC codes. A numerical estimate of pL (diamonds) was obtained by simulating d syndrome cycles for a distance-d code. Most of the data points have error bars roughly equal to pL/10 due to sampling errors. b, Comparison between the BB LDPC code [[144, 12, 12]] and surface codes with 12 logical qubits and distance d ∈ {9, 11, 13, 15}. The distance-d surface code with 12 logical qubits has the length n = 12d2 because each logical qubit is encoded into a separate d × d patch of the surface code lattice.](https://figures.cochat.ai/paper-figures/f0bf7cfff4e947da83298b00ebf12280/high-threshold-and-low-overhead-fault-tolerant-quantum-memory-figure-3.jpg)


Verification
Claims the paper makes
12 Valid · 9 Not valid · 10 Not checked · 61 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold”
- Also stated in: § Main · hedged
“which is nearly the same as the error threshold of the surface code49”
§ High-threshold and low-overhead fault-tolerant quantum memory > Abstract The accumulation of physical errors1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
What the sources say
- Partly supportedcites [7] Kitaev, A. Y. Fault-tolerant quantum computation by anyons. Ann. Phys. 303, 2–30 (2003); preprint at https://doi.org/10.48550/arXiv.quant-ph/9707021 (1997). sourceExperimental — accuracy not yet measured
The section on toric codes (p. 4) says they work below an error threshold, supporting the comparison’s premise that this code has a threshold. But the Abstract (p. 1) says the threshold was not known and gives estimates from 1/300 to 10^-6; it does not establish that a 0.7% threshold is on par with it or that it led other codes for 20 years. (LLM, conf=0.82)
- Partly supportedcites [8] Bravyi, S. B. & Kitaev, A. Y. Quantum codes on a lattice with boundary. Preprint at https://doi.org/10.48550/arXiv.quant-ph/9811052 (1998). sourceExperimental — accuracy not yet measured
The Abstract (pp. 1–2) describes a lattice code with boundaries and local stabilizers, supporting the citation’s identification of a surface code. The copy gives code distance and the number of errors the code can correct (p. 4), but it does not give an error-rate threshold or establish that 0.7% is comparable to it. (LLM, conf=0.82)
- Partly supportedcites [9] Dennis, E., Kitaev, A., Landahl, A. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452–4505 (2002). sourceExperimental — accuracy not yet measured
The paper analyzes surface-code error thresholds: §F (p. 17) gives a lower bound of 1.14% when data and measurement error probabilities are equal. It does not give 0.7% as the surface-code threshold, so it supports the comparison’s subject but not the specific numerical equivalence. Its 2002 text also cannot establish the citing sentence’s retrospective claim of 20 years of leadership. (LLM, conf=0.85)
- Supportedcites [10] Fowler, A. G., Stephens, A. M. & Groszkowski, P. High-threshold universal quantum computation on the surface code. Phys. Rev. A 80, 052312 (2009). source
Section VIII (p. 15) reports a numerical surface-code threshold of approximately 0.6%, and the conclusion (p. 16) repeats that value. A threshold of 0.7% is therefore on par with the threshold this paper reports. (LLM, conf=0.91)
- Not matchedcites [49] Groszkowski, P., Fowler, A. & Stephens, A. M. High-threshold surface code quantum computing: threshold calculation. In Proc. APS March Meeting Abstracts W17–002 (APS, 2009).
Its entry has no title and year that we can search by.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Main · hedged
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs.”
- Also stated in: § Main · plain
“The Tanner graph of any BB code has vertex degree six and graph thickness29 equal to two, which means it can be decomposed into two edge-disjoint planar subgraphs (Methods).”
- Also stated in: § Main · plain
“Although the qubit connectivity graph is not locally embeddable into a 2D grid, it can be decomposed into two planar degree-3 subgraphs.”
§ High-threshold and low-overhead fault-tolerant quantum memory > Abstract The accumulation of physical errors1–3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7–10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
What the sources say
- Partly supportedcites [29] Tremblay, M. A., Delfosse, N. & Beverland, M. E. Constant-overhead quantum error correction with thin planar connectivity. Phys. Rev. Lett. 129, 050504 (2022). sourceExperimental — accuracy not yet measured
Proposition 1 (p. 2) supports partitioning a low-degree connectivity graph into planar subgraphs. For degree 6, it guarantees a layout with at most three planar layers, not the claimed two. The passages about hypergraph product codes do not identify BB codes or establish their degree-6 connectivity. (LLM, conf=0.87)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Main · plain
Every source the paper cites for this claim was checked and supports it.
In the paper
“Recent progress in the study of LDPC codes suggests that they can achieve quantum fault tolerance with a much higher encoding efficiency29.”
§ High-threshold and low-overhead fault-tolerant quantum memory > Main
What the sources say
- Supportedcites [29] Tremblay, M. A., Delfosse, N. & Beverland, M. E. Constant-overhead quantum error correction with thin planar connectivity. Phys. Rev. Lett. 129, 050504 (2022). source
On p. 1, the paper says some quantum LDPC codes can achieve arbitrarily low logical error rates with a constant ratio of tens of physical qubits per logical qubit, potentially reducing qubit overhead by more than an order of magnitude compared with surface codes. It also reports a circuit-noise threshold for a positive-rate code family, supporting the claim's qualified statement about fault tolerance and encoding efficiency. (LLM, conf=0.93)
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“The latter were shown39,40 to be asymptotically ‘good’ in the sense of offering a constant encoding rate and linear distance: a parameter quantifying the number of correctable errors.”
§ High-threshold and low-overhead fault-tolerant quantum memory > Main
What the sources say
- Not checked — no full text of the sourcecites [39] Panteleev, P. & Kalachev, G. Asymptotically good quantum and locally testable classical LDPC codes. In Proc. 54th Annual ACM SIGACT Symposium on Theory of Computing 375–388 (ACM, 2022). source
- Supportedcites [40] Leverrier, A. & Zémor, G. Quantum Tanner codes. In Proc. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) 872–883 (IEEE, 2022). source
The Contributions section (p. 2) states that, under sufficient expansion and robustness conditions, the construction yields asymptotically good quantum LDPC codes with constant rate and linear minimum distance. This directly supports the attributed claim. (LLM, conf=0.95)
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Every source the paper cites for this claim was checked and supports it.
In the paper
“As shown in Fig. 1c, extensions of the Tanner graph leveraging techniques by Cohen et al.50 enable fault-tolerant measurement operations involving an ancillary surface code.”
§ High-threshold and low-overhead fault-tolerant quantum memory > Main
What the sources say
- Supportedcites Cohen et al.50 Cohen, L. Z., Kim, I. H., Bartlett, S. D. & Brown, B. J. Low-overhead fault-tolerant quantum computing using long-range connectivity. Sci. Adv. https://doi.org/10.1126/sciadv.abn1717 (2022). source
The Results section (‘Logical CSS measurement’; page unavailable) describes extending a Tanner graph with an ancilla system to measure logical operators fault-tolerantly. The sentence attributes that technique to Cohen et al.; its reference to an ancillary surface code describes the citing authors’ application, not a claim that Cohen et al. used one. (LLM, conf=0.88)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
54 more claims · 2 with their cited sources checked
Create a free account to see all 92 claims and every source verdict.
- Probably not a substantial claim. 23
- It may state two separate claims as one. 12
- The quote only partly states this claim. 2
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720 · cited 1×
“This new gate is also similar to the gates used by Google Quantum AI 57 , which have shown that a square lattice arrangement is possible.”
MethodFault-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 3×
“This resulted in the development of the surface code 7–10 that offers a high error threshold close to 1%, fast decoding algorithms and compatibility with the existing quantum processors relying on two-dimensional (2D) square lattice qubit connectivity.”
BackgroundMethodInfluentialScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479 · cited 2×
“The possibility of quantum fault tolerance is well-established 4 .”
BackgroundLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“It is believed that a scalable functioning quantum computer may help solve computational problems in such areas as scientific discovery, materials research, chemistry, and drug design, to name a few [2, 3, 4, 5].”
BackgroundGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 2×
“The length of the inner cycle is equal to the order of the matrix A A T 3 2 that is the transpose of A A T 3 2 considered earlier.”
BackgroundDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768 · cited 1×
“The sources of noise include imperfections in qubits, materials used, controlling apparatus, state preparation and measurement errors and a variety of external factors ranging from local man-made, such as stray electromagnetic fields, to those inherent to the Universe, such as cosmic rays.”
BackgroundImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“Since the circuit involves only Clifford operations, its action can be compactly described using stabilizer tableau [49].”
BackgroundDennis, 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 · cited 1×
“The first proposals for quantum error correction, such as concatenated codes [16, 17, 18], focused on demonstrating the theoretical possibility of error suppression.”
BackgroundMultiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284 · cited 1×
“These are stabilizer codes of the Calderbank–Shor–Steane (CSS) type 43,44 that can be described by a collection of six-qubit check (stabilizer) operators composed of Pauli X and Z .”
MethodSuppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103 · cited 1×
“Small examples of the surface code with a single logical qubit have already been demonstrated experimentally by several groups 24–28 .”
BackgroundElucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745 · cited 1×
“It is believed that a scalable functioning quantum computer may help solve computational problems in such areas as scientific discovery, materials research, chemistry, and drug design, to name a few [2, 3, 4, 5].”
BackgroundMaterials challenges and opportunities for quantum computing hardware
de Leon, N. P., Itoh, K. M., Kim, D., Mehta, K. K., Northup, T. E., Paik, H., Palmer, B. S., Samarth, N., Sangtawesin, S., & Steuerman, D. W. (2021) · Science · doi:10.1126/science.abb2823 · Cited by 710 · cited 1×
“Whereas some sources of noise can be eliminated with better control 16 , materials 17 and shielding 18–20 , several other sources appear to be difficult if at all possible to remove.”
BackgroundRealizing repeated quantum error correction in a distance-three surface code
Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., et al. (2022) · Nature · doi:10.1038/s41586-022-04566-8 · Cited by 686 · cited 1×
“Whereas some sources of noise can be eliminated with better control 16 , materials 17 and shielding 18–20 , several other sources appear to be difficult if at all possible to remove.”
BackgroundFault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631 · cited 1×
“The first proposals for quantum error correction, such as concatenated codes 21–23 , focused on demonstrating the theoretical possibility of error suppression.”
BackgroundBuilding logical qubits in a superconducting quantum computing system
Gambetta, J. M., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 622 · cited 1×
“15 for a summary.”
Self-citationControlling the Spontaneous Emission of a Superconducting Transmon Qubit
Houck, A. A., Schreier, J. A., Johnson, B. R., Chow, J. M., Koch, J., Gambetta, J. M., Schuster, D. I., Frunzio, L., Devoret, M. H., Girvin, S. M., et al. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.080502 · Cited by 501 · cited 2×
“The accumulation of physical errors 1–3 prevents the execution of large-scale algorithms in current quantum computers.”
BackgroundSelf-citationHigh-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486 · cited 5×
“This resulted in the development of the surface code [19, 20, 21, 22] that offers a high error threshold close to 1%, fast decoding algorithms, and compatibility with the existing quantum processors relying on 2-dimensional (2D) square lattice qubit connectivity.”
BackgroundMethodInfluentialQuantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Self-citationSparse-Graph Codes for Quantum Error Correction
MacKay, D. J. C., Mitchison, G., & McFadden, P. L. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834737 · Cited by 376 · cited 1×
“Our codes are a generalization of bicycle codes proposed by MacKay et al. 41 and studied in more depth in refs.”
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 · cited 1×
“For the first challenge, we can imagine a small change to the packaging 51 that was developed for the IBM Quantum Eagle processor 52 .”
MethodSelf-citationUniversal Gate for Fixed-Frequency Qubits via a Tunable Bus
McKay, D. C., Filipp, S., Mezzacapo, A., Magesan, E., Chow, J. M., & Gambetta, J. M. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.6.064007 · Cited by 321 · cited 1×
“However, with the tunable coupler [60, 61], which was used in the IBM Quantum Egret and now being developed for the IBM Quantum Heron, this problem no longer exists as the qubits can be designed to be further apart.”
MethodSelf-citationRealization of an Error-Correcting Surface Code with Superconducting Qubits
Zhao, Y., Ye, Y., Huang, H.-L., Zhang, Y., Wu, D., Guan, H., Zhu, Q., Wei, Z., He, T., Cao, S., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.030501 · Cited by 321 · cited 1×
“Small examples of the surface code with a single logical qubit have been already demonstrated experimentally by several groups [23, 24, 25, 26, 27].”
BackgroundTillich, J.-P., & Zemor, G. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292061 · Cited by 288 · cited 1×
“Multiple variants of the LDPC codes have been proposed recently including hyperbolic surface codes [30], hypergraph product [31], balanced product codes [32], two-block codes based on finite groups [33, 34, 35, 36], and quantum Tanner codes [37, 38].”
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Panteleev, P., & Kalachev, G. (2021) · Quantum · doi:10.22331/q-2021-11-22-585 · Cited by 257 · cited 7×
“Our numerical experiments are based on the belief propagation with an ordered statistics decoder (BP-OSD) proposed by Panteleev and Kalachev 36 .”
MethodInfluentialQuantum Computer Systems for Scientific Discovery
Alexeev, Y., Bacon, D., Brown, K. R., Calderbank, R., Carr, L. D., Chong, F. T., DeMarco, B., Englund, D., Farhi, E., Fefferman, B., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.017001 · Cited by 248 · cited 1×
“It is believed that a scalable functioning quantum computer may help solve computational problems in such areas as scientific discovery, materials research, chemistry, and drug design, to name a few [2, 3, 4, 5].”
BackgroundSelf-citationQuantum Computer Systems for Scientific Discovery
Alexeev, Y., Bacon, D., Brown, K. R., Calderbank, R., Carr, L. D., Chong, F. T., DeMarco, B., Englund, D., Farhi, E., Fefferman, B., et al. (2021) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.6082/h7fqg-6vt65 · Cited by 240
Self-citationImpact of ionizing radiation on superconducting qubit coherence
Vepsäläinen, A. P., Karamlou, A. H., Orrell, J. L., Dogra, A. S., Loer, B., Vasconcelos, F., Kim, D. K., Melville, A. J., Niedzielski, B. M., Yoder, J. L., et al. (2020) · Nature · doi:10.1038/s41586-020-2619-8 · Cited by 230 · cited 8×
“q s x12 = y6 = 1 p4 = q3 = r2 = s3 = 1 x = pq y = rs [[90,8,10]] 1 1”
BackgroundInfluentialAsymptotically good Quantum and locally testable classical LDPC codes
Panteleev, P., & Kalachev, G. (2022) · Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3519935.3520017 · Cited by 222 · cited 2×
“The latter were shown 39,40 to be asymptotically ‘good’ in the sense of offering a constant encoding rate and linear distance: a parameter quantifying the number of correctable errors.”
BackgroundMethodDemonstration 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 · cited 1×
“Small examples of the surface code with a single logical qubit have been already demonstrated experimentally by several groups [23, 24, 25, 26, 27].”
BackgroundSelf-citationLaser-annealing Josephson junctions for yielding scaled-up superconducting quantum processors
Hertzberg, J. B., Zhang, E. J., Rosenblatt, S., Magesan, E., Smolin, J. A., Yau, J.-B., Adiga, V. P., Sandberg, M., Brink, M., Chow, J. M., et al. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00464-5 · Cited by 198 · cited 1×
“Qubits in cross-resonance gates are not tuneable and as such for a large device with many connections the probability of a energy collisions (not just the qubit levels but also higher levels of the transmon) trends to one very quickly 54 .”
BackgroundProtecting superconducting qubits from radiation
Córcoles, A. D., Chow, J. M., Gambetta, J. M., Rigetti, C., Rozen, J. R., Keefe, G. A., Beth Rothwell, M., Ketchen, M. B., & Steffen, M. (2011) · Applied Physics Letters · doi:10.1063/1.3658630 · Cited by 193 · cited 1×
“Whereas some sources of noise can be eliminated with better control 16 , materials 17 and shielding 18–20 , several other sources appear to be difficult if at all possible to remove.”
BackgroundSelf-citationDecoding across the quantum low-density parity-check code landscape
Roffe, J., White, D. R., Burton, S., & Campbell, E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043423 · Cited by 192
Tradeoffs for Reliable Quantum Information Storage in 2D Systems
Bravyi, S., Poulin, D., & Terhal, B. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.050503 · Cited by 191 · cited 1×
“One drawback of high-rate LDPC codes is that their Tanner graphs may not be locally embeddable into the 2D grid [39, 40].”
BackgroundSelf-citationSparse blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2025) · Quantum · doi:10.22331/q-2025-01-20-1600 · Cited by 180
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172 · cited 2×
“This spurred interest in more general quantum codes known as low-density parity-check (LDPC) codes 6 .”
BackgroundMethodImpact of ionizing radiation on superconducting qubit coherence
Vepsäläinen, A. P., Karamlou, A. H., Orrell, J. L., Dogra, A. S., Loer, B., Vasconcelos, F., Kim, D. K., Melville, A. J., Niedzielski, B. M., Yoder, J., et al. (2020) · RePEc: Research Papers in Economics · Cited by 171
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 · cited 1×
“Another example of thickness-2 graphs in the literature is the bilayer architecture of ref.”
BackgroundTunable Coupling Architecture for Fixed-Frequency Transmon Superconducting Qubits
Stehlik, J., Zajac, D. M., Underwood, D. L., Phung, T., Blair, J., Carnevale, S., Klaus, D., Keefe, G. A., Carniol, A., Kumph, M., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.080505 · Cited by 159 · cited 1×
“However, with the tunable coupler [60, 61], which was used in the IBM Quantum Egret and now being developed for the IBM Quantum Heron, this problem no longer exists as the qubits can be designed to be further apart.”
MethodSparse Blossom: correcting a million errors per core second with minimum-weight matching
Higgott, O., & Gidney, C. (2023) · arXiv · doi:10.48550/arxiv.2303.15933 · Cited by 148
Logical-qubit operations in an error-detecting surface code
(2021) · doi:10.21203/rs.3.rs-380732/v1 · Cited by 141
Logical-qubit operations in an error-detecting surface code
(2021) · doi:10.1038/s41567-021-01423-9 · Cited by 141 · cited 1×
“Whereas some sources of noise can be eliminated with better control 16 , materials 17 and shielding 18–20 , several other sources appear to be difficult if at all possible to remove.”
BackgroundBalanced Product Quantum Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3097347 · Cited by 140 · cited 1×
“Multiple variants of the LDPC codes have been proposed recently including hyperbolic surface codes [30], hypergraph product [31], balanced product codes [32], two-block codes based on finite groups [33, 34, 35, 36], and quantum Tanner codes [37, 38].”
Leverrier, A., & Zemor, G. (2022) · 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs54457.2022.00117 · Cited by 140 · cited 2×
“The latter were shown [37, 38] to be asymptotically “good” in the sense of offering a constant encoding rate and linear distance – a parameter quantifying the number of correctable errors.”
BackgroundFold-Transversal Clifford Gates for Quantum Codes
Breuckmann, N. P., & Burton, S. (2024) · Quantum · doi:10.22331/q-2024-06-13-1372 · Cited by 136 · cited 4×
“Furthermore, we follow [55] to derive a fault tolerant operation based on a ZX-duality that also allows us to swap the two blocks while also applying Hadamard gates to all qubits.”
BackgroundMethodInfluentialEmbedding Planar Graphs at Fixed Vertex Locations
Pach, J., & Wenger, R. (2001) · Graphs and Combinatorics · doi:10.1007/pl00007258 · Cited by 135
Constructions and Noise Threshold of Hyperbolic Surface Codes
Breuckmann, N. P., & Terhal, B. M. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2555700 · Cited by 122 · cited 1×
“Multiple variants of the LDPC codes have been proposed recently including hyperbolic surface codes [30], hypergraph product [31], balanced product codes [32], two-block codes based on finite groups [33, 34, 35, 36], and quantum Tanner codes [37, 38].”
The Thickness of Graphs: A Survey
Mutzel, P., Odenthal, T., & Scharbrodt, M. (1998) · Graphs and Combinatorics · doi:10.1007/pl00007219 · Cited by 116
Quantum two-block group algebra codes
Lin, H.-K., & Pryadko, L. P. (2024) · Physical Review A · doi:10.1103/physreva.109.022407 · Cited by 113 · cited 5×
“Are there more general LDPC codes compatible with our syndrome measurement circuit(s)? We expect that the same circuit applies to any two-block LDPC code based on an Abelian group [35, 36].”
BackgroundResultInfluentialQuantum algorithm for obtaining the energy spectrum of molecular systems
Wang, H., Kais, S., Aspuru-Guzik, A., & Hoffmann, M. R. (2008) · Physical Chemistry Chemical Physics · doi:10.1039/b804804e · Cited by 109 · cited 5×
“The visualization of the [[144, 12, 12]] code in Fig.”
BackgroundMethodResultInfluentialQuantum Kronecker sum-product low-density parity-check codes with finite rate
Kovalev, A. A., & Pryadko, L. P. (2013) · Physical Review A · doi:10.1103/physreva.88.012311 · Cited by 107 · cited 3×
“Likewise, BB codes are a specialization of the generalized bicycle codes 35 , two-block group-based codes 37,42 and polynomial-based codes 59 .”
BackgroundMethodLow-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 · cited 1×
“1c, extensions of the Tanner graph leveraging techniques by Cohen et al. 50 enable fault-tolerant measurement operations involving an ancillary surface code.”
MethodBalanced Product Quantum Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · UCL Discovery (University College London) · Cited by 93
Quantum accuracy threshold for concatenated distance-3 codes
Aliferis, P., Gottesman, D., & Preskill, J. P. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0504218 · Cited by 86 · cited 5×
“008(3) 4× 10−8 2× 10−13 [[288, 12, 18]] 1/48 ≤ 18 0.”
BackgroundInfluentialConstant-Overhead Quantum Error Correction with Thin Planar Connectivity
Tremblay, M. A., Delfosse, N., & Beverland, M. E. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050504 · Cited by 83 · cited 3×
“Thus, error correction becomes a key requirement for building a functioning scalable quantum computer.”
BackgroundInfluentialImproved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes
Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T., & Campbell, E. T. (2023) · Physical Review X · doi:10.1103/physrevx.13.031007 · Cited by 82
Fault-tolerant quantum computing with color codes
Landahl, A. J., Anderson, J. T., & Rice, P. R. (2011) · arXiv · doi:10.48550/arxiv.1108.5738 · Cited by 79 · cited 1×
“The actual distance of each candidate code was computed using the integer linear programming method [48].”
MethodHigh-Contrast Qubit Interactions Using Multimode Cavity QED
McKay, D. C., Naik, R., Reinhold, P., Bishop, L. S., & Schuster, D. I. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.080501 · Cited by 79
Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
McEwen, M., Bacon, D., & Gidney, C. (2023) · Quantum · doi:10.22331/q-2023-11-07-1172 · Cited by 78 · cited 1×
“Edges of the inner cycle alternate between those generated by A T”
BackgroundQuantum algorithm for obtaining the energy spectrum of molecular systems
Wang, H., Kais, S., Aspuru‐Guzik, A., & Hoffmann, M. R. (2008) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 75
Hierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. P. (2025) · Quantum · doi:10.22331/q-2025-05-05-1728 · Cited by 74 · cited 1×
“Our approach complements a concatenation-based scheme by Pattison, Krishna, and Preskill [56] where each data qubit of a high-rate LDPC code is additionally encoded by the surface code.”
MethodTwo-Level-System Dynamics in a Superconducting Qubit Due to Background Ionizing Radiation
Thorbeck, T., Eddins, A., Lauer, I., McClure, D. T., & Carroll, M. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020356 · Cited by 70 · cited 1×
“While some sources of noise can be eliminated with better control [7], materials [8], and shielding [9, 10, 11], a number of other sources appear to be difficult if at all possible to remove.”
BackgroundNoise analysis for high-fidelity quantum entangling gates in an anharmonic linear Paul trap
Wu, Y., Wang, S.-T., & Duan, L.-M. (2018) · Physical Review A · doi:10.1103/physreva.97.062325 · Cited by 69 · cited 7×
“008(3) 4× 10−8 2× 10−13 [[288, 12, 18]] 1/48 ≤ 18 0.”
BackgroundMethodInfluentialConstructions and Performance of Hyperbolic and Semi-Hyperbolic Floquet Codes
Higgott, O., & Breuckmann, N. P. (2023) · PRX Quantum · doi:10.1103/prxquantum.5.040327 · Cited by 69 · cited 1×
“Several variants of the LDPC codes have been proposed recently including hyperbolic surface codes 30–32 , hypergraph product 33 , balanced product codes 34 , two-block codes based on finite groups 35–38 and quantum Tanner codes 39,40 .”
MethodMundada, P., Barbosa, A., Maity, S., Wang, Y., Merkh, T., Stace, T. M., Nielson, F. F., Carvalho, A. R. R., Hush, M., Biercuk, M. J., et al. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.024034 · Cited by 66
Algebraic Methods for Quantum Codes on Lattices
Haah, J. (2017) · Revista Colombiana de Matemáticas · doi:10.15446/recolma.v50n2.62214 · Cited by 52
Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
Higgott, O., & Breuckmann, N. P. (2021) · Physical Review X · doi:10.1103/physrevx.11.031039 · Cited by 48 · cited 2×
“The first proposals for quantum error correction, such as concatenated codes 21–23 , focused on demonstrating the theoretical possibility of error suppression.”
BackgroundQuantifying 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 · cited 1×
“One drawback of high-rate LDPC codes is that their Tanner graphs may not be locally embeddable into the 2D grid [39, 40].”
BackgroundHierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. (2023) · arXiv · doi:10.48550/arxiv.2303.04798 · Cited by 20
Raman Scattering Errors in Stimulated-Raman-Induced Logic Gates in Ba+133
Boguslawski, M. J., Wall, Z. J., Vizvary, S. R., Moore, I. D., Bareian, M., Allcock, D. T. C., Wineland, D. J., Hudson, E. R., & Campbell, W. C. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.063001 · Cited by 15
Spacetime codes of Clifford circuits
Delfosse, N., & Paetznick, A. (2023) · arXiv · doi:10.48550/arxiv.2304.05943 · Cited by 10 · cited 1×
“Edges of the inner cycle alternate between those generated by A T”
BackgroundQuantum two-block group algebra codesPreprint
Lin, H.-K., & Pryadko, L. P. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.16400 · Cited by 3 · cited 5×
“Are there more general LDPC codes compatible with our syndrome measurement circuit(s)? We expect that the same circuit applies to any two-block LDPC code based on an Abelian group [35, 36].”
BackgroundResultInfluentialTangling Schedules Eases Hardware Connectivity Requirements for Quantum Error Correction
Gehér, G. P., Crawford, O., & Campbell, E. T. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10273 · Cited by 2
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9707021 · cited 3×
“This resulted in the development of the surface code 7–10 that offers a high error threshold close to 1%, fast decoding algorithms and compatibility with the existing quantum processors relying on two-dimensional (2D) square lattice qubit connectivity.”
BackgroundMethodInfluentialMundada, P. S., Barbosa, A., Maity, S., et al. (2022) · arXiv · doi:10.48550/arxiv.2209.06864
Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
Higgott, O., & Breuckmann, N. P. (2023) · arXiv · doi:10.48550/arxiv.2308.03750
Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
McEwen, M., Bacon, D., & Gidney, C. (2023) · arXiv · doi:10.48550/arxiv.2302.02192
Fold-Transversal Clifford Gates for Quantum Codes
Breuckmann, N. P., & Burton, S. (2022) · arXiv · doi:10.48550/arxiv.2202.06647
Research works printed but not linked: 1
- Groszkowski, P., Fowler, A. & Stephens, A. M. High-threshold surface code quantum computing: threshold calculation. In Proc. APS March Meeting Abstracts W17–002 (APS, 2009).
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
“5 | Complex logical circuits using 3D codes. a , [[8,3,2]] block codes can transversally realize {CCZ, CZ, Z, CNOT} gates within each block and transversal CNOTs between blocks.”
MethodQuantum error correction below the surface code threshold
Collaborators, G. Q. A. A., Acharya, R., Abanin, D. A., Aghababaie-Beni, L., Aleiner, I., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., et al. (2025) · Nature · doi:10.1038/s41586-024-08449-y · Cited by 778
Scaling and networking a modular photonic quantum computer
Aghaee Rad, H., Ainsworth, T., Alexander, R. N., Altieri, B., Askarani, M. F., Baby, R., Banchi, L., Baragiola, B. Q., Bourassa, J. E., Chadwick, R. S., et al. (2025) · Nature · doi:10.1038/s41586-024-08406-9 · Cited by 178
“To benchmark the key functionalities 1–4 listed above, 2 core experiments were carried out using the machine.”
Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays
Xu, Q., Bonilla Ataides, J. P., Pattison, C. A., Raveendran, N., Bluvstein, D., Wurtz, J., Vasić, B., Lukin, M. D., Jiang, L., & Zhou, H. (2024) · Nature Physics · doi:10.1038/s41567-024-02479-z · Cited by 157
IBM quantum computers: evolution, performance, and future directions
AbuGhanem, M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07047-7 · Cited by 337
Metadata
- Authors
- Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J.
- Affiliations
- IBM (United States) (US)
- Corresponding author
- Maslov, Dmitri
- Venue
- Nature
- Published
- 2024-03-27
- Volume
- 627
- Issue
- 8005
- Pages
- 778-782
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- PMC
- PMC10972743
- OpenAlex
- W4393234688
- Cited by
- 456
- References
- 82
- Citations by year
- 2026: 150 · 2025: 223 · 2024: 76
- FWCI
- 65.98
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Nature (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- 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 memory, quantum error correction, LDPC codes, error threshold, syndrome measurement, logical qubits, qubit connectivity, planar graphs
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
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.