{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T02:17:18Z","timestamp":1777601838497,"version":"3.51.4"},"reference-count":103,"publisher":"Springer Science and Business Media LLC","issue":"8084","license":[{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nature"],"published-print":{"date-parts":[[2025,10,9]]},"DOI":"10.1038\/s41586-025-09543-5","type":"journal-article","created":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T15:02:29Z","timestamp":1758726149000},"page":"303-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Low-overhead transversal fault tolerance for universal quantum computation"],"prefix":"10.1038","volume":"646","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2148-8856","authenticated-orcid":false,"given":"Hengyun","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4386-1334","authenticated-orcid":false,"given":"Chen","family":"Zhao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5298-3112","authenticated-orcid":false,"given":"Madelyn","family":"Cain","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9934-9530","authenticated-orcid":false,"given":"Dolev","family":"Bluvstein","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5775-9542","authenticated-orcid":false,"given":"Nishad","family":"Maskara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4656-9644","authenticated-orcid":false,"given":"Casey","family":"Duckering","sequence":"additional","affiliation":[]},{"given":"Hong-Ye","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Sheng-Tao","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8213-8190","authenticated-orcid":false,"given":"Aleksander","family":"Kubica","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8658-1007","authenticated-orcid":false,"given":"Mikhail D.","family":"Lukin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,24]]},"reference":[{"key":"9543_CR1","unstructured":"Dalzell, A. M. et al. Quantum Algorithms: A Survey of Applications and End-to-End Complexities (Cambridge Univ. Press, 2025)."},{"key":"9543_CR2","unstructured":"Beverland, M. E. et al. Assessing requirements to scale to practical quantum advantage. Preprint at https:\/\/arxiv.org\/abs\/2211.07629 (2022)."},{"key":"9543_CR3","doi-asserted-by":"publisher","first-page":"010103","DOI":"10.1103\/PRXQuantum.2.010103","volume":"2","author":"R Babbush","year":"2021","unstructured":"Babbush, R. et al. Focus beyond quadratic speedups for error-corrected quantum advantage. PRX Quantum 2, 010103 (2021).","journal-title":"PRX Quantum"},{"key":"9543_CR4","doi-asserted-by":"crossref","unstructured":"Gottesman, D. An introduction to quantum error correction and fault-tolerant quantum computation. Preprint at https:\/\/arxiv.org\/abs\/0904.2557 (2010).","DOI":"10.1090\/psapm\/068\/2762145"},{"key":"9543_CR5","first-page":"1338","volume":"14","author":"D Gottesman","year":"2013","unstructured":"Gottesman, D. Fault-tolerant quantum computation with constant overhead. Quantum Inf. Comput. 14, 1338\u20131372 (2013).","journal-title":"Quantum Inf. Comput."},{"key":"9543_CR6","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1103\/PhysRevLett.77.793","volume":"77","author":"AM Steane","year":"1996","unstructured":"Steane, A. M. Error correcting codes in quantum theory. Phys. Rev. Lett. 77, 793\u2013797 (1996).","journal-title":"Phys. Rev. Lett."},{"key":"9543_CR7","doi-asserted-by":"crossref","unstructured":"Shor, P. W. Fault-tolerant quantum computation. In Proc. 37th Conference on Foundations of Computer Science 56\u201365 (IEEE, 1996).","DOI":"10.1109\/SFCS.1996.548464"},{"key":"9543_CR8","unstructured":"Bravyi, S. B. & Kitaev, A. Y. D. Quantum codes on a lattice with boundary. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/9811052 (1998)."},{"key":"9543_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":"9543_CR10","doi-asserted-by":"publisher","first-page":"123011","DOI":"10.1088\/1367-2630\/14\/12\/123011","volume":"14","author":"C Horsman","year":"2012","unstructured":"Horsman, C., Fowler, A. G., Devitt, S. & Van Meter, R. Surface code quantum computing by lattice surgery. New J. Phys. 14, 123011 (2012).","journal-title":"New J. Phys."},{"key":"9543_CR11","doi-asserted-by":"publisher","first-page":"128","DOI":"10.22331\/q-2019-03-05-128","volume":"3","author":"D Litinski","year":"2019","unstructured":"Litinski, D. A game of surface codes: large-scale quantum computing with lattice surgery. Quantum 3, 128 (2019).","journal-title":"Quantum"},{"key":"9543_CR12","doi-asserted-by":"publisher","first-page":"032324","DOI":"10.1103\/PhysRevA.86.032324","volume":"86","author":"AG Fowler","year":"2012","unstructured":"Fowler, A. G., Mariantoni, M., Martinis, J. M. & Cleland, A. N. Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).","journal-title":"Phys. Rev. A"},{"key":"9543_CR13","doi-asserted-by":"publisher","first-page":"240602","DOI":"10.1103\/PhysRevLett.133.240602","volume":"133","author":"M Cain","year":"2024","unstructured":"Cain, M. et al. Correlated decoding of logical algorithms with transversal gates. Phys. Rev. Lett. 133, 240602 (2024).","journal-title":"Phys. Rev. Lett."},{"key":"9543_CR14","doi-asserted-by":"publisher","first-page":"433","DOI":"10.22331\/q-2021-04-15-433","volume":"5","author":"C Gidney","year":"2021","unstructured":"Gidney, C. & Eker\u00e5, M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433 (2021).","journal-title":"Quantum"},{"key":"9543_CR15","doi-asserted-by":"publisher","first-page":"210501","DOI":"10.1103\/PhysRevLett.107.210501","volume":"107","author":"MB Hastings","year":"2011","unstructured":"Hastings, M. B. Topological order at nonzero temperature. Phys. Rev. Lett. 107, 210501 (2011).","journal-title":"Phys. Rev. Lett."},{"key":"9543_CR16","doi-asserted-by":"publisher","first-page":"052301","DOI":"10.1103\/PhysRevA.72.052301","volume":"72","author":"R Raussendorf","year":"2005","unstructured":"Raussendorf, R. Quantum computation via translation-invariant operations on a chain of qubits. Phys. Rev. A 72, 052301 (2005).","journal-title":"Phys. Rev. A"},{"key":"9543_CR17","doi-asserted-by":"publisher","first-page":"eabn1717","DOI":"10.1126\/sciadv.abn1717","volume":"8","author":"LZ Cohen","year":"2022","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. 8, eabn1717 (2022).","journal-title":"Sci. Adv."},{"key":"9543_CR18","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1038\/s41567-024-02479-z","volume":"20","author":"Q Xu","year":"2024","unstructured":"Xu, Q. et al. Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays. Nat. Phys. 20, 1084\u20131090 (2024).","journal-title":"Nat. Phys."},{"key":"9543_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1038\/s41567-023-02325-8","volume":"20","author":"H Yamasaki","year":"2024","unstructured":"Yamasaki, H. & Koashi, M. Time-efficient constant-space-overhead fault-tolerant quantum computation. Nat. Phys. 20, 247\u2013253 (2024).","journal-title":"Nat. Phys."},{"key":"9543_CR20","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1038\/s41586-024-07107-7","volume":"627","author":"S Bravyi","year":"2024","unstructured":"Bravyi, S. et al. High-threshold and low-overhead fault-tolerant quantum memory. Nature 627, 778\u2013782 (2024).","journal-title":"Nature"},{"key":"9543_CR21","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":"9543_CR22","first-page":"031043","volume":"5","author":"H Bomb\u00edn","year":"2015","unstructured":"Bomb\u00edn, H. Single-shot fault-tolerant quantum error correction. Phys. Rev. X 5, 031043 (2015).","journal-title":"Phys. Rev. X"},{"key":"9543_CR23","doi-asserted-by":"publisher","first-page":"025006","DOI":"10.1088\/2058-9565\/aafc8f","volume":"4","author":"ET Campbell","year":"2019","unstructured":"Campbell, E. T. A theory of single-shot error correction for adversarial noise. Quantum Sci. Technol. 4, 025006 (2019).","journal-title":"Quantum Sci. Technol."},{"key":"9543_CR24","doi-asserted-by":"publisher","first-page":"020341","DOI":"10.1103\/PRXQuantum.2.020341","volume":"2","author":"ME Beverland","year":"2021","unstructured":"Beverland, M. E., Kubica, A. & Svore, K. M. Cost of universality: a comparative study of the overhead of state distillation and code switching with color codes. PRX Quantum 2, 020341 (2021).","journal-title":"PRX Quantum"},{"key":"9543_CR25","unstructured":"Delfosse, N. & Paetznick, A. Spacetime codes of Clifford circuits. Preprint at https:\/\/arxiv.org\/abs\/2304.05943 (2023)."},{"key":"9543_CR26","doi-asserted-by":"publisher","first-page":"497","DOI":"10.22331\/q-2021-07-06-497","volume":"5","author":"C Gidney","year":"2021","unstructured":"Gidney, C. Stim: a fast stabilizer circuit simulator. Quantum 5, 497 (2021).","journal-title":"Quantum"},{"key":"9543_CR27","unstructured":"Gottesman, D. Opportunities and challenges in fault-tolerant quantum computation. Preprint at https:\/\/arxiv.org\/abs\/2210.15844 (2022)."},{"key":"9543_CR28","doi-asserted-by":"publisher","first-page":"020345","DOI":"10.1103\/PRXQuantum.4.020345","volume":"4","author":"Z Cai","year":"2023","unstructured":"Cai, Z., Siegel, A. & Benjamin, S. Looped pipelines enabling effective 3D qubit lattices in a strictly 2D device. PRX Quantum 4, 020345 (2023).","journal-title":"PRX Quantum"},{"key":"9543_CR29","doi-asserted-by":"crossref","unstructured":"Duckering, C., Baker, J. M., Schuster, D. I. & Chong, F. T. Virtualized logical qubits: a 2.5D architecture for error-corrected quantum computing. In Proc. Annual International Symposium on Microarchitecture (MICRO) 173\u2013185 (IEEE, 2020).","DOI":"10.1109\/MICRO50266.2020.00026"},{"key":"9543_CR30","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":"9543_CR31","doi-asserted-by":"publisher","first-page":"022316","DOI":"10.1103\/PhysRevA.71.022316","volume":"71","author":"S Bravyi","year":"2005","unstructured":"Bravyi, S. & Kitaev, A. Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005).","journal-title":"Phys. Rev. A"},{"key":"9543_CR32","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1038\/s41586-022-04721-1","volume":"605","author":"L Postler","year":"2022","unstructured":"Postler, L. et al. Demonstration of fault-tolerant universal quantum gate operations. Nature 605, 675\u2013680 (2022).","journal-title":"Nature"},{"key":"9543_CR33","unstructured":"Ryan-Anderson, C. et al. Implementing fault-tolerant entangling gates on the five-qubit code and the color code. Preprint at https:\/\/arxiv.org\/abs\/2208.01863 (2022)."},{"key":"9543_CR34","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1038\/s41586-023-06927-3","volume":"626","author":"D Bluvstein","year":"2024","unstructured":"Bluvstein, D. et al. Logical quantum processor based on reconfigurable atom arrays. Nature 626, 58\u201365 (2024).","journal-title":"Nature"},{"key":"9543_CR35","doi-asserted-by":"publisher","first-page":"110502","DOI":"10.1103\/PhysRevLett.102.110502","volume":"102","author":"B Eastin","year":"2009","unstructured":"Eastin, B. & Knill, E. Restrictions on transversal encoded quantum gate sets. Phys. Rev. Lett. 102, 110502 (2009).","journal-title":"Phys. Rev. Lett."},{"key":"9543_CR36","first-page":"021047","volume":"8","author":"T Jochym-O\u2019Connor","year":"2018","unstructured":"Jochym-O\u2019Connor, T., Kubica, A. & Yoder, T. J. Disjointness of stabilizer codes and limitations on fault-tolerant logical gates. Phys. Rev. X 8, 021047 (2018).","journal-title":"Phys. Rev. X"},{"key":"9543_CR37","doi-asserted-by":"publisher","first-page":"023037","DOI":"10.1088\/1367-2630\/17\/2\/023037","volume":"17","author":"Y Li","year":"2015","unstructured":"Li, Y. A magic state\u2019s fidelity can be superior to the operations that created it. New J. Phys. 17, 023037 (2015).","journal-title":"New J. Phys."},{"key":"9543_CR38","unstructured":"Haah, J. What is your logical qubit. In Proc. Simons Institute Workshop on Advances in Quantum Coding Theory (Simons Institute for the Theory of Computing, 2024)."},{"key":"9543_CR39","unstructured":"Cain, M. et al. Fast correlated decoding of transversal logical algorithms. Preprint at https:\/\/arxiv.org\/abs\/2505.13587 (2025)."},{"key":"9543_CR40","unstructured":"Serra-Peralta, M., Shaw, M. H. & Terhal, B. M. Decoding across transversal Clifford gates in the surface code. Preprint at https:\/\/arxiv.org\/abs\/2505.13599 (2025)."},{"key":"9543_CR41","doi-asserted-by":"publisher","first-page":"020304","DOI":"10.1103\/PhysRevA.87.020304","volume":"87","author":"AA Kovalev","year":"2013","unstructured":"Kovalev, A. A. & Pryadko, L. P. Fault tolerance of quantum low-density parity check codes with sublinear distance scaling. Phys. Rev. A\u00a087, 020304 (2013).","journal-title":"Phys. Rev. A"},{"key":"9543_CR42","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":"9543_CR43","unstructured":"Gurobi Optimization. Gurobi Optimizer Reference Manual (Gurobi Optimization, 2024)."},{"key":"9543_CR44","doi-asserted-by":"publisher","first-page":"023019","DOI":"10.1103\/PhysRevResearch.4.023019","volume":"4","author":"IH Kim","year":"2022","unstructured":"Kim, I. H. et al. Fault-tolerant resource estimate for quantum chemical simulations: case study on Li-ion battery electrolyte molecules. Phys. Rev. Res. 4, 023019 (2022).","journal-title":"Phys. Rev. Res."},{"key":"9543_CR45","unstructured":"Fowler, A. G. & Gidney, C. Low overhead quantum computation using lattice surgery. Preprint at https:\/\/arxiv.org\/abs\/1808.06709 (2018)."},{"key":"9543_CR46","unstructured":"Turner, M. L., Campbell, E. T., Crawford, O., Gillespie, N. I. & Camps, J. Scalable decoding protocols for fast transversal logic in the surface code. Preprint at https:\/\/arxiv.org\/abs\/2505.23567 (2025)."},{"key":"9543_CR47","first-page":"145","volume":"15","author":"AG Fowler","year":"2015","unstructured":"Fowler, A. G. Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time. Quantum Inf. Comput.15, 145\u2013158 (2015).","journal-title":"Quantum Inf. Comput."},{"key":"9543_CR48","doi-asserted-by":"publisher","first-page":"050504","DOI":"10.1103\/PhysRevLett.104.050504","volume":"104","author":"G Duclos-Cianci","year":"2010","unstructured":"Duclos-Cianci, G. & Poulin, D. Fast decoders for topological quantum codes. Phys. Rev. Lett. 104, 050504 (2010).","journal-title":"Phys. Rev. Lett."},{"key":"9543_CR49","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1103\/RevModPhys.87.307","volume":"87","author":"BM Terhal","year":"2015","unstructured":"Terhal, B. M. Quantum error correction for quantum memories. Rev. Mod. Phys. 87, 307\u2013346 (2015).","journal-title":"Rev. Mod. Phys."},{"key":"9543_CR50","doi-asserted-by":"publisher","first-page":"040101","DOI":"10.1103\/PRXQuantum.2.040101","volume":"2","author":"NP Breuckmann","year":"2021","unstructured":"Breuckmann, N. P. & Eberhardt, J. N. Quantum low-density parity-check codes. PRX Quantum 2, 040101 (2021).","journal-title":"PRX Quantum"},{"key":"9543_CR51","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/TIT.2013.2292061","volume":"60","author":"JP Tillich","year":"2014","unstructured":"Tillich, J. P. & Zemor, 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 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9543_CR52","doi-asserted-by":"crossref","unstructured":"Panteleev, P. & Kalachev, G. Asymptotically good quantum and locally testable classical LDPC codes. In Proc. Annual ACM Symposium on Theory of Computing 375\u2013388 (IEEE, 2022).","DOI":"10.1145\/3519935.3520017"},{"key":"9543_CR53","doi-asserted-by":"crossref","unstructured":"Fawzi, O., Grospellier, A. & Leverrier, A. Constant overhead quantum fault-tolerance with quantum expander codes. In Proc. 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) 743\u2013754 (IEEE, 2018).","DOI":"10.1109\/FOCS.2018.00076"},{"key":"9543_CR54","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00220-024-04951-6","volume":"405","author":"S Gu","year":"2024","unstructured":"Gu, S. et al. Single-shot decoding of good quantum LDPC codes. Commun. Math. Phys. 405, 85 (2024).","journal-title":"Commun. Math. Phys."},{"key":"9543_CR55","doi-asserted-by":"publisher","first-page":"083002","DOI":"10.1088\/1367-2630\/17\/8\/083002","volume":"17","author":"H Bomb\u00edn","year":"2015","unstructured":"Bomb\u00edn, H. Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes. New J. Phys. 17, 083002 (2015).","journal-title":"New J. Phys."},{"key":"9543_CR56","doi-asserted-by":"publisher","first-page":"083026","DOI":"10.1088\/1367-2630\/17\/8\/083026","volume":"17","author":"A Kubica","year":"2015","unstructured":"Kubica, A., Yoshida, B. & Pastawski, F. Unfolding the color code. New J. Phys. 17, 083026 (2015).","journal-title":"New J. Phys."},{"key":"9543_CR57","unstructured":"Bombin, H. Transversal gates and error propagation in 3D topological codes. Preprint at https:\/\/arxiv.org\/abs\/1810.09575 (2018)."},{"key":"9543_CR58","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1137\/S0097539799359385","volume":"38","author":"D Aharonov","year":"1999","unstructured":"Aharonov, D. & Ben-Or, M. Fault-tolerant quantum computation with constant error rate. SIAM J. Comput. 38, 1207\u20131282 (1999).","journal-title":"SIAM J. Comput."},{"key":"9543_CR59","unstructured":"Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information (Cambridge Univ. Press, 2010)."},{"key":"9543_CR60","doi-asserted-by":"publisher","first-page":"1728","DOI":"10.22331\/q-2025-05-05-1728","volume":"9","author":"CA Pattison","year":"2025","unstructured":"Pattison, C. A., Krishna, A. & Preskill, J. Hierarchical memories: simulating quantum LDPC codes with local gates. Quantum 9, 1728 (2025).","journal-title":"Quantum"},{"key":"9543_CR61","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1038\/s41567-020-0948-z","volume":"16","author":"S Bravyi","year":"2020","unstructured":"Bravyi, S., Gosset, D., K\u00f6nig, R. & Tomamichel, M. Quantum advantage with noisy shallow circuits. Nat. Phys. 16, 1040\u20131045 (2020).","journal-title":"Nat. Phys."},{"key":"9543_CR62","doi-asserted-by":"publisher","first-page":"042316","DOI":"10.1103\/PhysRevA.94.042316","volume":"94","author":"JE Moussa","year":"2016","unstructured":"Moussa, J. E. Transversal Clifford gates on folded surface codes. Phys. Rev. A 94, 042316 (2016).","journal-title":"Phys. Rev. A"},{"key":"9543_CR63","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.22331\/q-2024-06-13-1372","volume":"8","author":"NP Breuckmann","year":"2024","unstructured":"Breuckmann, N. P. & Burton, S. Fold-transversal Clifford gates for quantum codes. Quantum 8, 1372 (2024).","journal-title":"Quantum"},{"key":"9543_CR64","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.22331\/q-2023-10-24-1153","volume":"7","author":"AO Quintavalle","year":"2023","unstructured":"Quintavalle, A. O., Webster, P. & Vasmer, M. Partitioning qubits in hypergraph product codes to implement logical gates. Quantum 7, 1153 (2023).","journal-title":"Quantum"},{"key":"9543_CR65","unstructured":"Bomb\u00edn, H. et al. Modular decoding: parallelizable real-time decoding for quantum computers. Preprint at https:\/\/arxiv.org\/abs\/2303.04846 (2023)."},{"key":"9543_CR66","doi-asserted-by":"publisher","first-page":"020332","DOI":"10.1103\/PRXQuantum.4.020332","volume":"4","author":"O Higgott","year":"2023","unstructured":"Higgott, O. & Breuckmann, N. P. Improved single-shot decoding of higher-dimensional hypergraph-product codes. PRX Quantum 4, 020332 (2023).","journal-title":"PRX Quantum"},{"key":"9543_CR67","unstructured":"Landahl, A. J., Anderson, J. T. & Rice, P. R. Fault-tolerant quantum computing with color codes. Preprint at https:\/\/arxiv.org\/abs\/1108.5738 (2011)."},{"key":"9543_CR68","unstructured":"Bravyi, S. & Cross, A. Doubled color codes. Preprint at https:\/\/arxiv.org\/abs\/1509.03239 (2015)."},{"key":"9543_CR69","doi-asserted-by":"crossref","unstructured":"Bacon, D., Flammia, S. T., Harrow, A. W. & Shi, J. Sparse quantum codes from quantum circuits. In Proc. Forty-Seventh Annual ACM Symposium on Theory of Computing 327\u2013334 (ACM, 2014).","DOI":"10.1145\/2746539.2746608"},{"key":"9543_CR70","first-page":"181","volume":"8","author":"P Aliferis","year":"2008","unstructured":"Aliferis, P., Gottesman, D. & Preskill, J. Accuracy threshold for postselected quantum computation. Quantum Inf. Comput. 8, 181\u2013244 (2008).","journal-title":"Quantum Inf. Comput."},{"key":"9543_CR71","doi-asserted-by":"crossref","unstructured":"Lao, L. & Criger, B. Magic state injection on the rotated surface code. In Proc. 19th ACM International Conference on Computing Frontiers 113\u2013120 (ACM, 2022).","DOI":"10.1145\/3528416.3530237"},{"key":"9543_CR72","unstructured":"Gidney, C. Cleaner magic states with hook injection. Preprint at https:\/\/arxiv.org\/abs\/2302.12292 (2023)."},{"key":"9543_CR73","doi-asserted-by":"publisher","first-page":"012312","DOI":"10.1103\/PhysRevA.100.012312","volume":"100","author":"M Vasmer","year":"2019","unstructured":"Vasmer, M. & Browne, D. E. Three-dimensional surface codes: transversal gates and fault-tolerant architectures. Phys. Rev. A 100, 012312 (2019).","journal-title":"Phys. Rev. A"},{"key":"9543_CR74","doi-asserted-by":"publisher","first-page":"4929","DOI":"10.1126\/sciadv.aay4929","volume":"6","author":"BJ Brown","year":"2020","unstructured":"Brown, B. J. A fault-tolerant non-Clifford gate for the surface code in two dimensions. Sci. Adv. 6, 4929\u20134951 (2020).","journal-title":"Sci. Adv."},{"key":"9543_CR75","unstructured":"Zhu, G., Sikander, S., Portnoy, E., Cross, A. W. & Brown, B. J. Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries. Preprint at https:\/\/arxiv.org\/abs\/2310.16982 (2023)."},{"key":"9543_CR76","first-page":"021043","volume":"6","author":"S Bravyi","year":"2016","unstructured":"Bravyi, S., Smith, G. & Smolin, J. A. Trading classical and quantum computational resources. Phys. Rev. X 6, 021043 (2016).","journal-title":"Phys. Rev. X"},{"key":"9543_CR77","first-page":"20180427","volume":"475","author":"M Yoganathan","year":"2018","unstructured":"Yoganathan, M., Jozsa, R. & Strelchuk, S. Quantum advantage of unitary Clifford circuits with magic state inputs. Proc. R. Soc. A Math. Phys. Eng. Sci. 475, 20180427 (2018).","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"key":"9543_CR78","doi-asserted-by":"publisher","first-page":"74","DOI":"10.22331\/q-2018-06-18-74","volume":"2","author":"C Gidney","year":"2018","unstructured":"Gidney, C. Halving the cost of quantum addition. Quantum 2, 74 (2018).","journal-title":"Quantum"},{"key":"9543_CR79","unstructured":"Cuccaro, S. A., Draper, T. G., Kutin, S. A. & Moulton, D. P. A new quantum ripple-carry addition circuit. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/0410184 (2004)."},{"key":"9543_CR80","first-page":"041015","volume":"8","author":"R Babbush","year":"2018","unstructured":"Babbush, R. et al. Encoding electronic spectra in quantum circuits with linear T complexity. Phys. Rev. X 8, 041015 (2018).","journal-title":"Phys. Rev. X"},{"key":"9543_CR81","unstructured":"Fowler, A. G. Time-optimal quantum computation. Preprint at https:\/\/arxiv.org\/abs\/1210.4626 (2012)."},{"key":"9543_CR82","unstructured":"Litinski, D. & Nickerson, N. Active volume: an architecture for efficient fault-tolerant quantum computers with limited non-local connections. Preprint at https:\/\/arxiv.org\/abs\/2211.15465 (2022)."},{"key":"9543_CR83","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1038\/nature03350","volume":"434","author":"E Knill","year":"2004","unstructured":"Knill, E. Quantum computing with very noisy devices. Nature 434, 39\u201344 (2004).","journal-title":"Nature"},{"key":"9543_CR84","unstructured":"Gidney, C. & Fowler, A. G. Flexible layout of surface code computations using AutoCCZ states. Preprint at https:\/\/arxiv.org\/abs\/1905.08916 (2019)."},{"key":"9543_CR85","doi-asserted-by":"publisher","first-page":"052329","DOI":"10.1103\/PhysRevA.86.052329","volume":"86","author":"S Bravyi","year":"2012","unstructured":"Bravyi, S. & Haah, J. Magic-state distillation with low overhead. Phys. Rev. A 86, 052329 (2012).","journal-title":"Phys. Rev. A"},{"key":"9543_CR86","doi-asserted-by":"publisher","first-page":"6272","DOI":"10.1038\/s41467-022-33923-4","volume":"13","author":"A Kubica","year":"2022","unstructured":"Kubica, A. & Vasmer, M. Single-shot quantum error correction with the three-dimensional subsystem toric code. Nat. Commun. 13, 6272 (2022).","journal-title":"Nat. Commun."},{"key":"9543_CR87","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1038\/s41586-022-05434-1","volume":"614","author":"R Acharya","year":"2023","unstructured":"Acharya, R. et al. Suppressing quantum errors by scaling a surface code logical qubit. Nature 614, 676\u2013681 (2023).","journal-title":"Nature"},{"key":"9543_CR88","doi-asserted-by":"publisher","first-page":"160503","DOI":"10.1103\/PhysRevLett.109.160503","volume":"109","author":"JR Wootton","year":"2012","unstructured":"Wootton, J. R. & Loss, D. High threshold error correction for the surface code. Phys. Rev. Lett. 109, 160503 (2012).","journal-title":"Phys. Rev. Lett."},{"key":"9543_CR89","unstructured":"Fowler, A. G. Optimal complexity correction of correlated errors in the surface code. Preprint at https:\/\/arxiv.org\/abs\/1310.0863 (2013)."},{"key":"9543_CR90","doi-asserted-by":"publisher","first-page":"3187","DOI":"10.1109\/TIT.2022.3143452","volume":"68","author":"N Delfosse","year":"2022","unstructured":"Delfosse, N., Londe, V. & Beverland, M. E. Toward a union-find decoder for quantum LDPC codes. IEEE Trans. Inf. Theory 68, 3187\u20133199 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9543_CR91","doi-asserted-by":"publisher","first-page":"585","DOI":"10.22331\/q-2021-11-22-585","volume":"5","author":"P Panteleev","year":"2019","unstructured":"Panteleev, P. & Kalachev, G. Degenerate quantum LDPC codes with good finite length performance. Quantum 5, 585 (2019).","journal-title":"Quantum"},{"key":"9543_CR92","unstructured":"Wu, Y., Zhong, L. & Puri, S. Hypergraph minimum-weight parity factor decoder for QEC. In Proc. 2024 APS March Meeting (American Physical Society, 2024)."},{"key":"9543_CR93","doi-asserted-by":"publisher","first-page":"083002","DOI":"10.1088\/1367-2630\/17\/8\/083002","volume":"17","author":"H Bomb\u00edn","year":"2013","unstructured":"Bomb\u00edn, H. Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes. New J. Phys. 17, 083002 (2013).","journal-title":"New J. Phys."},{"key":"9543_CR94","doi-asserted-by":"crossref","unstructured":"Liyanage, N., Wu, Y., Deters, A. & Zhong, L. Scalable quantum error correction for surface codes using FPGA. In Proc. 31st IEEE International Symposium on Field-Programmable Custom Computing Machine (FCCM) 217 (IEEE, 2023).","DOI":"10.1109\/FCCM57271.2023.00045"},{"key":"9543_CR95","doi-asserted-by":"crossref","unstructured":"Richardson, T. & Urbanke, R. Modern Coding Theory (Cambridge Univ. Press, 2008).","DOI":"10.1017\/CBO9780511791338"},{"key":"9543_CR96","doi-asserted-by":"crossref","unstructured":"Wu, Y. & Zhong, L. Fusion Blossom: fast MWPM decoders for QEC. In Proc. 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) 928\u2013938 (IEEE, 2023).","DOI":"10.1109\/QCE57702.2023.00107"},{"key":"9543_CR97","unstructured":"Grospellier, A. Constant Time Decoding of Quantum Expander Codes and Application to Fault-Tolerant Quantum Computation. PhD thesis, Sorbonne Univ. (2019)."},{"key":"9543_CR98","doi-asserted-by":"publisher","first-page":"040344","DOI":"10.1103\/PRXQuantum.4.040344","volume":"4","author":"X Tan","year":"2023","unstructured":"Tan, X., Zhang, F., Chao, R., Shi, Y. & Chen, J. Scalable surface-code decoders with parallelization in time. PRX Quantum 4, 040344 (2023).","journal-title":"PRX Quantum"},{"key":"9543_CR99","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-42482-1","volume":"14","author":"L Skoric","year":"2023","unstructured":"Skoric, L., Browne, D. E., Barnes, K. M., Gillespie, N. I. & Campbell, E. T. Parallel window decoding enables scalable fault tolerant quantum computation. Nat. Commun. 14, 7040 (2023).","journal-title":"Nat. Commun."},{"key":"9543_CR100","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1038\/s41586-022-04592-6","volume":"604","author":"D Bluvstein","year":"2022","unstructured":"Bluvstein, D. et al. A quantum processor based on coherent transport of entangled atom arrays. Nature 604, 451\u2013456 (2022).","journal-title":"Nature"},{"key":"9543_CR101","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1038\/s41586-021-03318-4","volume":"592","author":"JM Pino","year":"2021","unstructured":"Pino, J. M. et al. Demonstration of the trapped-ion quantum CCD computer architecture. Nature 592, 209\u2013213 (2021).","journal-title":"Nature"},{"key":"9543_CR102","unstructured":"Bartolucci, S. et al. Switch networks for photonic fusion-based quantum computing. Preprint at https:\/\/arxiv.org\/abs\/2109.13760 (2021)."},{"key":"9543_CR103","doi-asserted-by":"publisher","unstructured":"Zhou, H. et al. Data for \u201cLow-Overhead Transversal Fault Tolerance for Universal Quantum Computation\u201d. Zenodo https:\/\/doi.org\/10.5281\/zenodo.16552626 (2025).","DOI":"10.5281\/zenodo.16552626"}],"container-title":["Nature"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41586-025-09543-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41586-025-09543-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41586-025-09543-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T12:03:45Z","timestamp":1759925025000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41586-025-09543-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,24]]},"references-count":103,"journal-issue":{"issue":"8084","published-print":{"date-parts":[[2025,10,9]]}},"alternative-id":["9543"],"URL":"https:\/\/doi.org\/10.1038\/s41586-025-09543-5","relation":{},"ISSN":["0028-0836","1476-4687"],"issn-type":[{"value":"0028-0836","type":"print"},{"value":"1476-4687","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,24]]},"assertion":[{"value":"14 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"M.D.L. is a co-founder and shareholder, and H.Z., C.Z., C.D. and S.-T.W. are employees of QuEra Computing. US patent application PCT\/US25\/22108 (filed on 28 March 2025 and naming H.Z., M.C., C.Z., D.B., M.D.L. and C.D. as co-inventors) contains technical aspects of this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}