{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T12:30:35Z","timestamp":1766493035285,"version":"3.48.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-2118310"],"award-info":[{"award-number":["OAC-2118310"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMR1719875"],"award-info":[{"award-number":["DMR1719875"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMR-2039380"],"award-info":[{"award-number":["DMR-2039380"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-2118310"],"award-info":[{"award-number":["OAC-2118310"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-2118310"],"award-info":[{"award-number":["OAC-2118310"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-2118310"],"award-info":[{"award-number":["OAC-2118310"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-2118310"],"award-info":[{"award-number":["OAC-2118310"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000936","name":"Gordon and Betty Moore Foundation","doi-asserted-by":"publisher","award":["GBMF10436"],"award-info":[{"award-number":["GBMF10436"]}],"id":[{"id":"10.13039\/100000936","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput Sci"],"DOI":"10.1038\/s43588-025-00897-4","type":"journal-article","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:04:57Z","timestamp":1762250697000},"page":"1158-1167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning to decode logical circuits"],"prefix":"10.1038","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3166-3053","authenticated-orcid":false,"given":"Yiqing","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Chao","family":"Wan","sequence":"additional","affiliation":[]},{"given":"Yichen","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8407-1110","authenticated-orcid":false,"given":"Jin Peng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Kilian Q.","family":"Weinberger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9554-4443","authenticated-orcid":false,"given":"Eun-Ah","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,4]]},"reference":[{"key":"897_CR1","first-page":"676\u2013681","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":"897_CR2","doi-asserted-by":"publisher","first-page":"58\u201365","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":"897_CR3","unstructured":"Lacroix, N. et al. Scaling and logic in the color code on a superconducting quantum processor. Preprint at https:\/\/arxiv.org\/abs\/2412.14256 (2024)."},{"key":"897_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":"897_CR5","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":"897_CR6","unstructured":"Gottesman, D. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology (1997)."},{"key":"897_CR7","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1103\/PhysRevA.55.900","volume":"55","author":"E Knill","year":"1997","unstructured":"Knill, E. & Laflamme, R. Theory of quantum error-correcting codes. Phys. Rev. A 55, 900 (1997).","journal-title":"Phys. Rev. A"},{"key":"897_CR8","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R. & van Tilborg, H. On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24, 384\u2013386 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"897_CR9","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy, A. The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43, 1757\u20131766 (1997).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"897_CR10","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":"897_CR11","doi-asserted-by":"publisher","first-page":"180501","DOI":"10.1103\/PhysRevLett.108.180501","volume":"108","author":"AG Fowler","year":"2012","unstructured":"Fowler, A. G., Whiteside, A. C. & Hollenberg, L. C. L. Towards practical classical processing for the surface code. Phys. Rev. Lett. 108, 180501 (2012).","journal-title":"Phys. Rev. Lett."},{"key":"897_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3505637","volume":"3","author":"O Higgott","year":"2022","unstructured":"Higgott, O. PyMatching: a Python package for decoding quantum codes with minimum-weight perfect matching. ACM Trans. Quant. Comput. 3, 1\u201316 (2022).","journal-title":"ACM Trans. Quant. Comput."},{"key":"897_CR13","unstructured":"Fowler, A. G. Optimal complexity correction of correlated errors in the surface code. Preprint at https:\/\/arxiv.org\/abs\/1310.0863 (2013)."},{"key":"897_CR14","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":"897_CR15","doi-asserted-by":"publisher","first-page":"012317","DOI":"10.1103\/PhysRevA.89.012317","volume":"89","author":"N Delfosse","year":"2014","unstructured":"Delfosse, N. Decoding color codes by projection onto surface codes. Phys. Rev. A 89, 012317 (2014).","journal-title":"Phys. Rev. A"},{"key":"897_CR16","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.22331\/q-2023-12-12-1205","volume":"7","author":"A Paler","year":"2023","unstructured":"Paler, A. & Fowler, A. G. Pipelined correlated minimum weight perfect matching of the surface code. Quantum 7, 1205 (2023).","journal-title":"Quantum"},{"key":"897_CR17","doi-asserted-by":"publisher","first-page":"020326","DOI":"10.1103\/PRXQuantum.6.020326","volume":"6","author":"K Sahay","year":"2025","unstructured":"Sahay, K., Lin, Y., Huang, S., Brown, K. R. & Puri, S. Error correction of transversal cnot gates for scalable surface-code computation. PRX Quantum 6, 020326 (2025).","journal-title":"PRX Quantum"},{"key":"897_CR18","unstructured":"Wan, K. H., Webber, M., Fowler, A. G. & Hensinger, W. K. An iterative transversal CNOT decoder. Preprint at https:\/\/arxiv.org\/abs\/2407.20976 (2024)."},{"key":"897_CR19","doi-asserted-by":"publisher","unstructured":"Varbanov, B. M., Serra-Peralta, M., Byfield, D. & Terhal, B. M. Neural network decoder for near-term surface-code experiments. Phys. Rev. Res. https:\/\/doi.org\/10.1103\/physrevresearch.7.013029 (2025).","DOI":"10.1103\/physrevresearch.7.013029"},{"key":"897_CR20","doi-asserted-by":"publisher","first-page":"834\u2013840","DOI":"10.1038\/s41586-024-08148-8","volume":"635","author":"J Bausch","year":"2024","unstructured":"Bausch, J. et al. Learning high-accuracy error decoding for quantum processors. Nature 635, 834\u2013840 (2024).","journal-title":"Nature"},{"key":"897_CR21","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. Modern Phys. 87, 307 (2015).","journal-title":"Rev. Modern Phys."},{"key":"897_CR22","doi-asserted-by":"publisher","first-page":"48","DOI":"10.22331\/q-2018-01-29-48","volume":"2","author":"P Baireuther","year":"2018","unstructured":"Baireuther, P., O\u2019Brien, T. E., Tarasinski, B. & Beenakker, C. W. J. Machine-learning-assisted correction of correlated qubit errors in a topological code. Quantum 2, 48 (2018).","journal-title":"Quantum"},{"key":"897_CR23","doi-asserted-by":"publisher","first-page":"013003","DOI":"10.1088\/1367-2630\/aaf29e","volume":"21","author":"P Baireuther","year":"2019","unstructured":"Baireuther, P., Caio, M. D., Criger, B., Beenakker, C. W. J. & O\u2019Brien, T. E. Neural network decoder for topological color codes with circuit level noise. New J. Phys. 21, 013003 (2019).","journal-title":"New J. Phys."},{"key":"897_CR24","doi-asserted-by":"publisher","first-page":"920\u2013926","DOI":"10.1038\/s41586-024-08449-y","volume":"638","author":"Google Quantum AI and Collaborators.","year":"2025","unstructured":"Google Quantum AI and Collaborators. Quantum error correction below the surface code threshold. Nature 638, 920\u2013926 (2025).","journal-title":"Nature"},{"key":"897_CR25","doi-asserted-by":"publisher","unstructured":"Bengio, Y., Louradour, J., Collobert, R. & Weston, J. Curriculum learning. In Proc. 26th Annual International Conference on Machine Learning 41\u201348 (ACM, 2009); https:\/\/doi.org\/10.1145\/1553374.1553380","DOI":"10.1145\/1553374.1553380"},{"key":"897_CR26","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":"897_CR27","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":"897_CR28","unstructured":"Cain, M. et al. Fast correlated decoding of transversal logical algorithms. Preprint at https:\/\/arxiv.org\/abs\/2505.13587 (2025)."},{"key":"897_CR29","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":"897_CR30","doi-asserted-by":"publisher","unstructured":"Zhou, H. et al. Low-overhead transversal fault tolerance for universal quantum computation. Nature https:\/\/doi.org\/10.1038\/s41586-025-09543-5 (2025)","DOI":"10.1038\/s41586-025-09543-5"},{"key":"897_CR31","doi-asserted-by":"publisher","first-page":"180501","DOI":"10.1103\/PhysRevLett.97.180501","volume":"97","author":"H Bombin","year":"2006","unstructured":"Bombin, H. & Martin-Delgado, M. A. Topological quantum distillation. Phys. Rev. Lett. 97, 180501 (2006).","journal-title":"Phys. Rev. Lett."},{"key":"897_CR32","first-page":"1338","volume":"14","author":"D Gottesman","year":"2014","unstructured":"Gottesman, D. Fault-tolerant quantum computation with constant overhead. Quantum Inf. Comput. 14, 1338\u20131372 (2014).","journal-title":"Quantum Inf. Comput."},{"key":"897_CR33","unstructured":"Knill, E. Fault-tolerant postselected quantum computation: schemes. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/0402171 (2004)."},{"key":"897_CR34","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":"897_CR35","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":"897_CR36","doi-asserted-by":"publisher","first-page":"123011","DOI":"10.1088\/1367-2630\/14\/12\/123011","volume":"14","author":"D Horsman","year":"2012","unstructured":"Horsman, D., Fowler, A. G., Devitt, S. & Meter, R. V. Surface code quantum computing by lattice surgery. New J. Phys. 14, 123011 (2012).","journal-title":"New J. Phys."},{"key":"897_CR37","doi-asserted-by":"publisher","first-page":"62","DOI":"10.22331\/q-2018-05-04-62","volume":"2","author":"D Litinski","year":"2018","unstructured":"Litinski, D. & von Oppen, F. Lattice surgery with a twist: simplifying Clifford gates of surface codes. Quantum 2, 62 (2018).","journal-title":"Quantum"},{"key":"897_CR38","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart, D. E., Hintont, G. E. & Williams, R. J. Learning representations by back-propagating errors. Nature 323, 533\u2013536 (1986).","journal-title":"Nature"},{"key":"897_CR39","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S. & Schmidhuber, J. Long short-term memory. Neural Comput. 9, 1735\u20131780 (1997).","journal-title":"Neural Comput."},{"key":"897_CR40","unstructured":"Combes, J., Granade, C., Ferrie, C. & Flammia, S. T. Logical randomized benchmarking. Preprint at https:\/\/arxiv.org\/abs\/1702.03688 (2017)."},{"key":"897_CR41","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":"897_CR42","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.22331\/q-2025-01-20-1600","volume":"9","author":"O Higgott","year":"2025","unstructured":"Higgott, O. & Gidney, C. Sparse Blossom: correcting a million errors per core second with minimum-weight matching. Quantum 9, 1600 (2025).","journal-title":"Quantum"},{"key":"897_CR43","unstructured":"Higgott, O. stimbposd: surface code decoder based on belief propagation and ordered statistics decoding. GitHub https:\/\/github.com\/oscarhiggott\/stimbposd (2023)."},{"key":"897_CR44","doi-asserted-by":"publisher","unstructured":"Zhou, Y. Data for \u2018learning to decode logical circuits\u2019. Zenodo https:\/\/doi.org\/10.5281\/zenodo.17196063 (2025).","DOI":"10.5281\/zenodo.17196063"},{"key":"897_CR45","doi-asserted-by":"publisher","unstructured":"Zhou, Y., Multi-Core Circuit Decoder (MCCD). Zenodo https:\/\/doi.org\/10.5281\/zenodo.17196115 (2025).","DOI":"10.5281\/zenodo.17196115"}],"container-title":["Nature Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s43588-025-00897-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-025-00897-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-025-00897-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:48:57Z","timestamp":1766486937000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s43588-025-00897-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,4]]},"references-count":45,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["897"],"URL":"https:\/\/doi.org\/10.1038\/s43588-025-00897-4","relation":{},"ISSN":["2662-8457"],"issn-type":[{"type":"electronic","value":"2662-8457"}],"subject":[],"published":{"date-parts":[[2025,11,4]]},"assertion":[{"value":"11 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}