{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T04:57:32Z","timestamp":1781845052686,"version":"3.54.5"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"8005","license":[{"start":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T00:00:00Z","timestamp":1711497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T00:00:00Z","timestamp":1711497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nature"],"published-print":{"date-parts":[[2024,3,28]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The accumulation of physical errors<jats:sup>1\u20133<\/jats:sup> prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction<jats:sup>4<\/jats:sup> promises a solution by encoding <jats:italic>k<\/jats:italic> logical qubits onto a larger number <jats:italic>n<\/jats:italic> 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<jats:sup>5<\/jats:sup>. 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<jats:sup>6<\/jats:sup>. Our approach achieves an error threshold of 0.7%\u00a0for the standard circuit-based noise model, on par with the surface code<jats:sup>7\u201310<\/jats:sup> that for 20\u2009years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-<jats:italic>n<\/jats:italic> code in our family requires <jats:italic>n<\/jats:italic> ancillary qubits and a depth-8 circuit with\u00a0CNOT 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\u00a0million 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\u00a0physical 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.<\/jats:p>","DOI":"10.1038\/s41586-024-07107-7","type":"journal-article","created":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T17:03:24Z","timestamp":1711559004000},"page":"778-782","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":403,"title":["High-threshold and low-overhead fault-tolerant quantum memory"],"prefix":"10.1038","volume":"627","author":[{"given":"Sergey","family":"Bravyi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9786-8196","authenticated-orcid":false,"given":"Andrew W.","family":"Cross","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jay M.","family":"Gambetta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7381-4556","authenticated-orcid":false,"given":"Dmitri","family":"Maslov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Rall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theodore J.","family":"Yoder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,27]]},"reference":[{"key":"7107_CR1","doi-asserted-by":"publisher","first-page":"062325","DOI":"10.1103\/PhysRevA.97.062325","volume":"97","author":"Y Wu","year":"2018","unstructured":"Wu, Y., Wang, S.-T. & Duan, L.-M. Noise analysis for high-fidelity quantum entangling gates in an anharmonic linear Paul trap. Phys. Rev. A 97, 062325 (2018).","journal-title":"Phys. Rev. A"},{"key":"7107_CR2","doi-asserted-by":"crossref","unstructured":"Boguslawski, M. J. et al. Raman scattering errors in stimulated-Raman-induced logic gates in 133Ba+. Phys. Rev. Lett. 131, 063001 (2023).","DOI":"10.1103\/PhysRevLett.131.063001"},{"key":"7107_CR3","doi-asserted-by":"publisher","first-page":"080502","DOI":"10.1103\/PhysRevLett.101.080502","volume":"101","author":"AA Houck","year":"2008","unstructured":"Houck, A. A. et al. Controlling the spontaneous emission of a superconducting transmon qubit. Phys. Rev. Lett. 101, 080502 (2008).","journal-title":"Phys. Rev. Lett."},{"key":"7107_CR4","doi-asserted-by":"publisher","first-page":"R2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"PW Shor","year":"1995","unstructured":"Shor, P. W. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 52, R2493 (1995).","journal-title":"Phys. Rev. A"},{"key":"7107_CR5","doi-asserted-by":"crossref","unstructured":"Nielsen, M. A. & Chuang, I. Quantum Computation and Quantum Information (Cambridge Univ Press, 2002).","DOI":"10.1119\/1.1463744"},{"key":"7107_CR6","doi-asserted-by":"crossref","unstructured":"Gottesman, D. Fault-tolerant quantum computation with constant overhead. Quant. Inf. Comput. 14, 1338\u20131372 (2014).","DOI":"10.26421\/QIC14.15-16-5"},{"key":"7107_CR7","doi-asserted-by":"publisher","unstructured":"Kitaev, A. Y. Fault-tolerant quantum computation by anyons. Ann. Phys. 303, 2\u201330 (2003); preprint at https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/9707021 (1997).","DOI":"10.48550\/arXiv.quant-ph\/9707021"},{"key":"7107_CR8","doi-asserted-by":"publisher","unstructured":"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).","DOI":"10.48550\/arXiv.quant-ph\/9811052"},{"key":"7107_CR9","doi-asserted-by":"publisher","first-page":"4452","DOI":"10.1063\/1.1499754","volume":"43","author":"E Dennis","year":"2002","unstructured":"Dennis, E., Kitaev, A., Landahl, A. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452\u20134505 (2002).","journal-title":"J. Math. Phys."},{"key":"7107_CR10","doi-asserted-by":"publisher","first-page":"052312","DOI":"10.1103\/PhysRevA.80.052312","volume":"80","author":"AG Fowler","year":"2009","unstructured":"Fowler, A. G., Stephens, A. M. & Groszkowski, P. High-threshold universal quantum computation on the surface code. Phys. Rev. A 80, 052312 (2009).","journal-title":"Phys. Rev. A"},{"key":"7107_CR11","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1126\/science.273.5278.1073","volume":"273","author":"S Lloyd","year":"1996","unstructured":"Lloyd, S. Universal quantum simulators. Science 273, 1073\u20131078 (1996).","journal-title":"Science"},{"key":"7107_CR12","doi-asserted-by":"publisher","first-page":"5388","DOI":"10.1039\/b804804e","volume":"10","author":"H Wang","year":"2008","unstructured":"Wang, H., Kais, S., Aspuru-Guzik, A. & Hoffmann, M. R. Quantum algorithm for obtaining the energy spectrum of molecular systems. Phys. Chem. Chem. Phys. 10, 5388\u20135393 (2008).","journal-title":"Phys. Chem. Chem. Phys."},{"key":"7107_CR13","doi-asserted-by":"publisher","first-page":"7555","DOI":"10.1073\/pnas.1619152114","volume":"114","author":"M Reiher","year":"2017","unstructured":"Reiher, M., Wiebe, N., Svore, K. M., Wecker, D. & Troyer, M. Elucidating reaction mechanisms on quantum computers. Proc. Natl Acad. Sci. USA 114, 7555\u20137560 (2017).","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"7107_CR14","doi-asserted-by":"publisher","first-page":"017001","DOI":"10.1103\/PRXQuantum.2.017001","volume":"2","author":"Y Alexeev","year":"2021","unstructured":"Alexeev, Y. et al. Quantum computer systems for scientific discovery. PRX Quantum 2, 017001 (2021).","journal-title":"PRX Quantum"},{"key":"7107_CR15","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-016-0004-0","volume":"3","author":"JM Gambetta","year":"2017","unstructured":"Gambetta, J. M., Chow, J. M. & Steffen, M. Building logical qubits in a superconducting quantum computing system. npj Quant. Info. 3, 2 (2017).","journal-title":"npj Quant. Info."},{"key":"7107_CR16","doi-asserted-by":"publisher","unstructured":"Mundada, P. S. et al. Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2209.06864 (2023).","DOI":"10.48550\/arXiv.2209.06864"},{"key":"7107_CR17","doi-asserted-by":"publisher","first-page":"eabb2823","DOI":"10.1126\/science.abb2823","volume":"372","author":"NP De Leon","year":"2021","unstructured":"De Leon, N. P. et al. Materials challenges and opportunities for quantum computing hardware. Science 372, eabb2823 (2021).","journal-title":"Science"},{"key":"7107_CR18","doi-asserted-by":"publisher","first-page":"181906","DOI":"10.1063\/1.3658630","volume":"99","author":"AD C\u00f3rcoles","year":"2011","unstructured":"C\u00f3rcoles, A. D. et al. Protecting superconducting qubits from radiation. Appl. Phys. Lett. 99, 181906 (2011).","journal-title":"Appl. Phys. Lett."},{"key":"7107_CR19","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1038\/s41586-020-2619-8","volume":"584","author":"AP Veps\u00e4l\u00e4inen","year":"2020","unstructured":"Veps\u00e4l\u00e4inen, A. P. et al. Impact of ionizing radiation on superconducting qubit coherence. Nature 584, 551\u2013556 (2020).","journal-title":"Nature"},{"key":"7107_CR20","doi-asserted-by":"publisher","first-page":"020356","DOI":"10.1103\/PRXQuantum.4.020356","volume":"4","author":"T Thorbeck","year":"2023","unstructured":"Thorbeck, T., Eddins, A., Lauer, I., McClure, D. T. & Carroll, M. Two-level-system dynamics in a superconducting qubit due to background ionizing radiation. PRX Quant. 4, 020356 (2023).","journal-title":"PRX Quant."},{"key":"7107_CR21","doi-asserted-by":"crossref","unstructured":"Aharonov, D. & Ben-Or, M. Fault-tolerant quantum computation with constant error. In Proc. 29th Annual ACM Symposium on Theory of Computing 176\u2013188 (ACM, 1997).","DOI":"10.1145\/258533.258579"},{"key":"7107_CR22","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1070\/RM1997v052n06ABEH002155","volume":"52","author":"AY Kitaev","year":"1997","unstructured":"Kitaev, A. Y. Quantum computations: algorithms and error correction. Russ. Math. Surv. 52, 1191 (1997).","journal-title":"Russ. Math. Surv."},{"key":"7107_CR23","doi-asserted-by":"publisher","unstructured":"Aliferis, P., Gottesman, D. & Preskill, J. Quantum accuracy threshold for concatenated distance-3 codes. Quant. Inf. Comput. 6, 97\u2013165 (2006); preprint at https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0504218 (2005).","DOI":"10.48550\/arXiv.quant-ph\/0504218"},{"key":"7107_CR24","doi-asserted-by":"publisher","first-page":"210505","DOI":"10.1103\/PhysRevLett.117.210505","volume":"117","author":"M Takita","year":"2016","unstructured":"Takita, M. et al. Demonstration of weight-four parity measurements in the surface code architecture. Phys. Rev. Lett. 117, 210505 (2016).","journal-title":"Phys. Rev. Lett."},{"key":"7107_CR25","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1038\/s41567-021-01423-9","volume":"18","author":"JF Marques","year":"2022","unstructured":"Marques, J. F. et al. Logical-qubit operations in an error-detecting surface code. Nat. Phys. 18, 80\u201386 (2022).","journal-title":"Nat. Phys."},{"key":"7107_CR26","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1038\/s41586-022-04566-8","volume":"605","author":"S Krinner","year":"2022","unstructured":"Krinner, S. et al. Realizing repeated quantum error correction in a distance-three surface code. Nature 605, 669\u2013674 (2022).","journal-title":"Nature"},{"key":"7107_CR27","doi-asserted-by":"publisher","first-page":"030501","DOI":"10.1103\/PhysRevLett.129.030501","volume":"129","author":"Y Zhao","year":"2022","unstructured":"Zhao, Y. et al. Realization of an error-correcting surface code with superconducting qubits. Phys. Rev. Lett. 129, 030501 (2022).","journal-title":"Phys. Rev. Lett."},{"key":"7107_CR28","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1038\/s41586-022-05434-1","volume":"614","author":"Google Quantum AI.","year":"2023","unstructured":"Google Quantum AI. Suppressing quantum errors by scaling a surface code logical qubit. Nature 614, 676\u2013681 (2023).","journal-title":"Nature"},{"key":"7107_CR29","doi-asserted-by":"publisher","first-page":"050504","DOI":"10.1103\/PhysRevLett.129.050504","volume":"129","author":"MA Tremblay","year":"2022","unstructured":"Tremblay, M. A., Delfosse, N. & Beverland, M. E. Constant-overhead quantum error correction with thin planar connectivity. Phys. Rev. Lett. 129, 050504 (2022).","journal-title":"Phys. Rev. Lett."},{"key":"7107_CR30","doi-asserted-by":"publisher","first-page":"3731","DOI":"10.1109\/TIT.2016.2555700","volume":"62","author":"NP Breuckmann","year":"2016","unstructured":"Breuckmann, N. P. & Terhal, B. M. Constructions and noise threshold of hyperbolic surface codes. IEEE Trans. Inf. Theory 62, 3731\u20133744 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7107_CR31","first-page":"031039","volume":"11","author":"O Higgott","year":"2021","unstructured":"Higgott, O. & Breuckmann, N. P. Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead. Phys. Rev. X 11, 031039 (2021).","journal-title":"Phys. Rev. X"},{"key":"7107_CR32","doi-asserted-by":"publisher","unstructured":"Higgott, O. & Breuckmann, N. P. Constructions and performance of hyperbolic and semi-hyperbolic floquet codes. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2308.03750 (2023).","DOI":"10.48550\/arXiv.2308.03750"},{"key":"7107_CR33","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/TIT.2013.2292061","volume":"60","author":"J-P Tillich","year":"2013","unstructured":"Tillich, J.-P. & Z\u00e9mor, G. Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength. IEEE Trans. Inf. Theory 60, 1193\u20131202 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7107_CR34","doi-asserted-by":"publisher","first-page":"6653","DOI":"10.1109\/TIT.2021.3097347","volume":"67","author":"NP Breuckmann","year":"2021","unstructured":"Breuckmann, N. P. & Eberhardt, J. N. Balanced product quantum codes. IEEE Trans. Inf. Theory 67, 6653\u20136674 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7107_CR35","doi-asserted-by":"publisher","first-page":"012311","DOI":"10.1103\/PhysRevA.88.012311","volume":"88","author":"AA Kovalev","year":"2013","unstructured":"Kovalev, A. A. & Pryadko, L. P. Quantum kronecker sum-product low-density parity-check codes with finite rate. Physi. Rev. A 88, 012311 (2013).","journal-title":"Physi. Rev. A"},{"key":"7107_CR36","doi-asserted-by":"publisher","first-page":"585","DOI":"10.22331\/q-2021-11-22-585","volume":"5","author":"P Panteleev","year":"2021","unstructured":"Panteleev, P. & Kalachev, G. Degenerate quantum LDPC codes with good finite length performance. Quantum 5, 585 (2021).","journal-title":"Quantum"},{"key":"7107_CR37","doi-asserted-by":"crossref","unstructured":"Lin, H.-K. & Pryadko, L. P. Quantum two-block group algebra codes. Phys. Rev. A 109, 022407 (2024).","DOI":"10.1103\/PhysRevA.109.022407"},{"key":"7107_CR38","doi-asserted-by":"publisher","unstructured":"Wang, R., Lin, H.-K. & Pryadko, L. P. Abelian and non-Abelian quantum two-block codes. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2306.16400 (2023).","DOI":"10.48550\/arXiv.2306.16400"},{"key":"7107_CR39","doi-asserted-by":"crossref","unstructured":"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\u2013388 (ACM, 2022).","DOI":"10.1145\/3519935.3520017"},{"key":"7107_CR40","doi-asserted-by":"crossref","unstructured":"Leverrier, A. & Z\u00e9mor, G. Quantum Tanner codes. In Proc. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) 872\u2013883 (IEEE, 2022).","DOI":"10.1109\/FOCS54457.2022.00117"},{"key":"7107_CR41","doi-asserted-by":"publisher","first-page":"2315","DOI":"10.1109\/TIT.2004.834737","volume":"50","author":"DJC MacKay","year":"2004","unstructured":"MacKay, D. J. C., Mitchison, G. & McFadden, P. L. Sparse-graph codes for quantum error correction. IEEE Trans. Inf. Theory 50, 2315\u20132330 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7107_CR42","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TIT.2021.3119384","volume":"68","author":"P Panteleev","year":"2021","unstructured":"Panteleev, P. & Kalachev, G. Quantum LDPC codes with almost linear minimum distance. IEEE Trans. Inf. Theory 68, 213\u2013229 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7107_CR43","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1098\/rspa.1996.0136","volume":"452","author":"A Steane","year":"1996","unstructured":"Steane, A. Multiple-particle interference and quantum error correction. Proc. R. Soc. London A Math. Phys. Eng. Sci. 452, 2551\u20132577 (1996).","journal-title":"Proc. R. Soc. London A Math. Phys. Eng. Sci."},{"key":"7107_CR44","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"AR Calderbank","year":"1996","unstructured":"Calderbank, A. R. & Shor, P. W. Good quantum error-correcting codes exist. Phys. Rev. A 54, 1098 (1996).","journal-title":"Phys. Rev. A"},{"key":"7107_CR45","doi-asserted-by":"publisher","unstructured":"Delfosse, N. & Paetznick, A. Spacetime codes of Clifford circuits. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2304.05943 (2023).","DOI":"10.48550\/arXiv.2304.05943"},{"key":"7107_CR46","doi-asserted-by":"publisher","unstructured":"McEwen, M., Bacon, D. & Gidney, C. Relaxing hardware requirements for surface code circuits using time-dynamics. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2302.02192 (2023).","DOI":"10.48550\/arXiv.2302.02192"},{"key":"7107_CR47","first-page":"031007","volume":"13","author":"O Higgott","year":"2023","unstructured":"Higgott, O., Bohdanowicz, T. C., Kubica, A., Flammia, S. T. & Campbell, E. T. Improved decoding of circuit noise and fragile boundaries of tailored surface codes. Phys. Rev. X 13, 031007 (2023).","journal-title":"Phys. Rev. X"},{"key":"7107_CR48","doi-asserted-by":"crossref","unstructured":"Geher, G. P., Crawford, O. & Campbell, E. T. Tangling schedules eases hardware connectivity requirements for quantum error correction. In 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) 342\u2013343 (IEEE, 2023).","DOI":"10.1109\/QCE57702.2023.10273"},{"key":"7107_CR49","unstructured":"Groszkowski, P., Fowler, A. & Stephens, A. M. High-threshold surface code quantum computing: threshold calculation. In Proc. APS March Meeting Abstracts W17\u2013002 (APS, 2009)."},{"key":"7107_CR50","doi-asserted-by":"publisher","unstructured":"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).","DOI":"10.1126\/sciadv.abn1717"},{"key":"7107_CR51","doi-asserted-by":"crossref","unstructured":"Bravyi, S., Dial, O., Gambetta, J. M., Gil, D. & Nazario, Z. The future of quantum computing with superconducting qubits. J. Appl. Phys. 132, 160902 (2022).","DOI":"10.1063\/5.0082975"},{"key":"7107_CR52","unstructured":"Chow, J., Dial, O. & Gambetta, J. IBM Quantum breaks the 100-qubit processor barrier. IBM https:\/\/research.ibm.com\/blog\/127-qubit-quantum-processor-eagle (2021)."},{"key":"7107_CR53","unstructured":"Nation, P., Paik, H., Cross, A. & Nazario, Z. The IBM Quantum heavy hex lattice. IBM https:\/\/research.ibm.com\/blog\/heavy-hex-lattice (2021)."},{"key":"7107_CR54","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-021-00464-5","volume":"7","author":"JB Hertzberg","year":"2021","unstructured":"Hertzberg, J. B. et al. Laser-annealing Josephson junctions for yielding scaled-up superconducting quantum processors. npj Quantum Inf. 7, 129 (2021).","journal-title":"npj Quantum Inf."},{"key":"7107_CR55","doi-asserted-by":"publisher","first-page":"064007","DOI":"10.1103\/PhysRevApplied.6.064007","volume":"6","author":"DC McKay","year":"2016","unstructured":"McKay, D. C. et al. Universal gate for fixed-frequency qubits via a tunable bus. Phys. Rev. Appl. 6, 064007 (2016).","journal-title":"Phys. Rev. Appl."},{"key":"7107_CR56","doi-asserted-by":"publisher","first-page":"080505","DOI":"10.1103\/PhysRevLett.127.080505","volume":"127","author":"J Stehlik","year":"2021","unstructured":"Stehlik, J. et al. Tunable coupling architecture for fixed-frequency transmon superconducting qubits. Phys. Rev. Lett. 127, 080505 (2021).","journal-title":"Phys. Rev. Lett."},{"key":"7107_CR57","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505\u2013510 (2019).","journal-title":"Nature"},{"key":"7107_CR58","doi-asserted-by":"publisher","first-page":"080501","DOI":"10.1103\/PhysRevLett.114.080501","volume":"114","author":"DC McKay","year":"2015","unstructured":"McKay, D. C., Naik, R., Reinhold, P., Bishop, L. S. & Schuster, D. I. High-contrast qubit interactions using multimode cavity QED. Phys. Rev. Lett. 114, 080501 (2015).","journal-title":"Phys. Rev. Lett."},{"key":"7107_CR59","doi-asserted-by":"publisher","first-page":"299","DOI":"10.15446\/recolma.v50n2.62214","volume":"50","author":"J Haah","year":"2016","unstructured":"Haah, J. Algebraic methods for quantum codes on lattices. Rev. Colomb. de Mat. 50, 299\u2013349 (2016).","journal-title":"Rev. Colomb. de Mat."},{"key":"7107_CR60","doi-asserted-by":"publisher","first-page":"050505","DOI":"10.1103\/PhysRevLett.129.050505","volume":"129","author":"N Baspin","year":"2022","unstructured":"Baspin, N. & Krishna, A. Quantifying nonlocality: how outperforming local quantum codes is expensive. Phys. Rev. Lett. 129, 050505 (2022).","journal-title":"Phys. Rev. Lett."},{"key":"7107_CR61","doi-asserted-by":"publisher","first-page":"050503","DOI":"10.1103\/PhysRevLett.104.050503","volume":"104","author":"S Bravyi","year":"2010","unstructured":"Bravyi, S., Poulin, D. & Terhal, B. Tradeoffs for reliable quantum information storage in 2D systems. Phys. Rev. Lett. 104, 050503 (2010).","journal-title":"Phys. Rev. Lett."},{"key":"7107_CR62","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T. & Scharbrodt, M. The thickness of graphs: a survey. Graphs Comb. 14, 59\u201373 (1998).","journal-title":"Graphs Comb."},{"key":"7107_CR63","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J Pach","year":"2001","unstructured":"Pach, J. & Wenger, R. Embedding planar graphs at fixed vertex locations. Graphs Comb. 17, 717\u2013728 (2001).","journal-title":"Graphs Comb."},{"key":"7107_CR64","doi-asserted-by":"publisher","unstructured":"Pattison, C. A., Krishna, A. & Preskill, J. Hierarchical memories: simulating quantum LDPC codes with local gates. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2303.04798 (2023).","DOI":"10.48550\/arXiv.2303.04798"},{"key":"7107_CR65","doi-asserted-by":"publisher","first-page":"043423","DOI":"10.1103\/PhysRevResearch.2.043423","volume":"2","author":"J Roffe","year":"2020","unstructured":"Roffe, J., White, D. R., Burton, S. & Campbell, E. Decoding across the quantum low-density parity-check code landscape. Phys. Rev. Res. 2, 043423 (2020).","journal-title":"Phys. Rev. Res."},{"key":"7107_CR66","unstructured":"Roffe, J. LDPC: Python tools for low density parity check codes. PyPI https:\/\/pypi.org\/project\/ldpc\/ (2022)."},{"key":"7107_CR67","doi-asserted-by":"publisher","unstructured":"Breuckmann, N. P. & Burton, S. Fold-transversal Clifford gates for quantum codes. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2202.06647 (2022).","DOI":"10.48550\/arXiv.2202.06647"},{"key":"7107_CR68","doi-asserted-by":"publisher","unstructured":"Landahl, A. J., Anderson, J. T. & Rice, P. R. Fault-tolerant quantum computing with color codes. Preprint at https:\/\/doi.org\/10.48550\/arXiv.1108.5738 (2011).","DOI":"10.48550\/arXiv.1108.5738"}],"container-title":["Nature"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41586-024-07107-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41586-024-07107-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41586-024-07107-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T17:09:00Z","timestamp":1711559340000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41586-024-07107-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,27]]},"references-count":68,"journal-issue":{"issue":"8005","published-print":{"date-parts":[[2024,3,28]]}},"alternative-id":["7107"],"URL":"https:\/\/doi.org\/10.1038\/s41586-024-07107-7","relation":{},"ISSN":["0028-0836","1476-4687"],"issn-type":[{"value":"0028-0836","type":"print"},{"value":"1476-4687","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,27]]},"assertion":[{"value":"25 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"US Patent Application 18\/527304 (filed on 3 December 2023 and naming S.B., A.W.C., J.M.G., D.M., P.R., Kevin Tien and T.J.Y. as co-inventors) contains technical aspects from this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}