{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T22:42:20Z","timestamp":1781908940422,"version":"3.54.5"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T00:00:00Z","timestamp":1742428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T00:00:00Z","timestamp":1742428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Mach Intell"],"DOI":"10.1038\/s42256-025-01001-1","type":"journal-article","created":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T06:07:31Z","timestamp":1742450851000},"page":"374-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Quantum circuit optimization with AlphaTensor"],"prefix":"10.1038","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2200-901X","authenticated-orcid":false,"given":"Francisco J. R.","family":"Ruiz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tuomas","family":"Laakkonen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3189-9162","authenticated-orcid":false,"given":"Johannes","family":"Bausch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matej","family":"Balog","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammadamin","family":"Barekatain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8124-2359","authenticated-orcid":false,"given":"Francisco J. H.","family":"Heras","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Novikov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathan","family":"Fitzpatrick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernardino","family":"Romera-Paredes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"van de Wetering","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7341-1917","authenticated-orcid":false,"given":"Alhussein","family":"Fawzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konstantinos","family":"Meichanetzidis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-7997","authenticated-orcid":false,"given":"Pushmeet","family":"Kohli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,20]]},"reference":[{"key":"1001_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R. P. Simulating physics with computers. Int. J. Theor. Phys. 21, 467\u2013488 (1982).","journal-title":"Int. J. Theor. Phys."},{"key":"1001_CR2","unstructured":"Manin, Y. I. Computable and Noncomputable (Sovetskoe Radio, 1980)."},{"key":"1001_CR3","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P. W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484\u20131509 (1997).","journal-title":"SIAM J. Comput."},{"key":"1001_CR4","doi-asserted-by":"publisher","first-page":"7001","DOI":"10.1021\/acs.jctc.2c00574","volume":"18","author":"NS Blunt","year":"2022","unstructured":"Blunt, N. S. et al. Perspective on the current state-of-the-art of quantum computing for drug discovery applications. J. Chem. Theory Comput. 18, 7001\u20137023 (2022).","journal-title":"J. Chem. Theory Comput."},{"key":"1001_CR5","unstructured":"Dalzell, A. M. et al. Quantum Algorithms: a Survey of Applications and End-to-End Complexities. (Cambridge Univ. Press, in the press)."},{"key":"1001_CR6","unstructured":"Gottesman, D. The Heisenberg Representation of Quantum Computers (Los Alamos National Laboratory, 1998); https:\/\/arxiv.org\/abs\/quant-ph\/9807006"},{"key":"1001_CR7","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":"1001_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1038\/nature23460","volume":"549","author":"ET Campbell","year":"2017","unstructured":"Campbell, E. T., Terhal, B. M. & Vuillot, C. Roads towards fault-tolerant universal quantum computation. Nature 549, 172\u2013179 (2017).","journal-title":"Nature"},{"key":"1001_CR9","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\u20131105 (1996).","journal-title":"Phys. Rev. A"},{"key":"1001_CR10","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":"1001_CR11","doi-asserted-by":"publisher","unstructured":"Eastin, B. & Knill, E. Restrictions on transversal encoded quantum gate sets. Phys. Rev. Lett. https:\/\/doi.org\/10.1103\/physrevlett.102.110502 (2009).","DOI":"10.1103\/physrevlett.102.110502"},{"key":"1001_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.22331\/q-2019-04-30-135","volume":"3","author":"C Gidney","year":"2019","unstructured":"Gidney, C. & Fowler, A. G. Efficient magic state factories with a catalyzed $$\\left\\vert CCZ\\right\\rangle$$ to $$\\left\\vert CCZ\\right\\rangle$$ transformation. Quantum 3, 135 (2019).","journal-title":"Quantum"},{"key":"1001_CR13","unstructured":"Gidney, C., Shutty, N. & Jones, C. Magic state cultivation: growing T states as cheap as CNOT gates. Preprint at https:\/\/arxiv.org\/abs\/2409.17595 (2024)."},{"key":"1001_CR14","unstructured":"van de Wetering, J. & Amy, M. Optimising quantum circuits is generally hard. Preprint at https:\/\/arxiv.org\/abs\/2310.05958 (2023)."},{"key":"1001_CR15","doi-asserted-by":"publisher","unstructured":"Amy, M., Maslov, D. & Mosca, M. Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. https:\/\/doi.org\/10.1109\/TCAD.2014.2341953 (2014).","DOI":"10.1109\/TCAD.2014.2341953"},{"key":"1001_CR16","first-page":"1261","volume":"14","author":"D Gosset","year":"2014","unstructured":"Gosset, D., Kliuchnikov, V., Mosca, M. & Russo, V. An algorithm for the T-count. Quantum Inf. Comput. 14, 1261\u20131276 (2014).","journal-title":"Quantum Inf. Comput."},{"key":"1001_CR17","doi-asserted-by":"publisher","first-page":"015004","DOI":"10.1088\/2058-9565\/aad604","volume":"4","author":"LE Heyfron","year":"2018","unstructured":"Heyfron, L. E. & Campbell, E. T. An efficient quantum compiler that reduces T count. Quantum Sci. Technol. 4, 015004 (2018).","journal-title":"Quantum Sci. Technol."},{"key":"1001_CR18","doi-asserted-by":"crossref","unstructured":"Nam, Y., Ross, N. J., Su, Y., Childs, A. M. & Maslov, D. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Inf. 4, 23 (2018).","DOI":"10.1038\/s41534-018-0072-4"},{"key":"1001_CR19","doi-asserted-by":"publisher","first-page":"4771","DOI":"10.1109\/TIT.2019.2906374","volume":"65","author":"M Amy","year":"2019","unstructured":"Amy, M. & Mosca, M. T-count optimization and Reed-Muller codes. IEEE Trans. Inf. Theory 65, 4771\u20134784 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1001_CR20","doi-asserted-by":"publisher","unstructured":"Kissinger, A. & van de Wetering, J. Reducing the number of non-Clifford gates in quantum circuits. Phys. Rev. A https:\/\/doi.org\/10.1103\/PhysRevA.102.022406 (2020).","DOI":"10.1103\/PhysRevA.102.022406"},{"key":"1001_CR21","doi-asserted-by":"crossref","unstructured":"Gheorghiu, V., Mosca, M. & Mukhopadhyay, P. T-count and T-depth of any multi-qubit unitary. npj Quantum Inf. 8, 141 (2022).","DOI":"10.1038\/s41534-022-00651-y"},{"key":"1001_CR22","doi-asserted-by":"publisher","first-page":"044001","DOI":"10.1088\/2058-9565\/ac5d20","volume":"7","author":"A Kissinger","year":"2022","unstructured":"Kissinger, A. & van de Wetering, J. Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions. Quantum Sci. Technol. 7, 044001 (2022).","journal-title":"Quantum Sci. Technol."},{"key":"1001_CR23","doi-asserted-by":"crossref","unstructured":"de Beaudrap, N., Bian, X. & Wang, Q. Techniques to reduce \u03c0\/4-parity-phase circuits, motivated by the ZX calculus. In 16th International Conference on Quantum Physics and Logic 131\u2013149 (EPTCS, 2020).","DOI":"10.4204\/EPTCS.318.9"},{"key":"1001_CR24","unstructured":"de Beaudrap, N., Bian, X. & Wang, Q. Fast and effective techniques for T-count reduction via spider nest identities. In Conference on the Theory of Quantum Computation, Communication and Cryptography (ed. Flammia, S. T.) 11:1\u201311:23 (Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, 2020)."},{"key":"1001_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/s41586-022-05172-4","volume":"610","author":"A Fawzi","year":"2022","unstructured":"Fawzi, A. et al. Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610, 47\u201353 (2022).","journal-title":"Nature"},{"key":"1001_CR26","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1038\/s42005-021-00684-3","volume":"4","author":"L Moro","year":"2021","unstructured":"Moro, L., Paris, M. G. A., Restelli, M. & Prati, E. Quantum compiling by deep reinforcement learning. Commun. Phys. 4, 178 (2021).","journal-title":"Commun. Phys."},{"key":"1001_CR27","unstructured":"F\u00f6sel, T., Niu, M. Y., Marquardt, F. & Li, L. Quantum circuit optimization with deep reinforcement learning. Preprint at https:\/\/arxiv.org\/abs\/2103.07585 (2021)."},{"key":"1001_CR28","doi-asserted-by":"crossref","unstructured":"Quetschlich, N., Burgholzer, L. & Wille, R. Compiler optimization for quantum computing using reinforcement learning. In 2023 60th ACM\/IEEE Design Automation Conference 1\u20136 (IEEE, 2023).","DOI":"10.1109\/DAC56929.2023.10248002"},{"key":"1001_CR29","unstructured":"Ostaszewski, M., Trenkwalder, L. M., Masarczyk, W., Scerri, E. & Dunjko, V. Reinforcement learning for optimization of variational quantum circuit architectures. Adv. Neural Inf. Process. Syst. 34, 18182\u201318194 (2021)."},{"key":"1001_CR30","unstructured":"Kuo, E.-J., Fang, Y.-L. L. & Chen, S. Y.-C. Quantum architecture search via deep reinforcement learning. Preprint at https:\/\/arxiv.org\/abs\/2104.07715 (2021)."},{"key":"1001_CR31","unstructured":"Yao, J., Li, H., Bukov, M., Lin, L. & Ying, L. Monte Carlo tree search based hybrid optimization of variational quantum circuits. In Proc. Mathematical and Scientific Machine Learning (eds Dong, B. et al.) 49\u201364 (PMLR, 2022)."},{"key":"1001_CR32","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-32349-2","volume":"13","author":"X Zhu","year":"2023","unstructured":"Zhu, X. & Hou, X. Quantum architecture search via truly proximal policy optimization. Sci. Rep. 13, 5157 (2023).","journal-title":"Sci. Rep."},{"key":"1001_CR33","doi-asserted-by":"publisher","first-page":"062615","DOI":"10.1103\/PhysRevA.108.062615","volume":"108","author":"B Rosenhahn","year":"2023","unstructured":"Rosenhahn, B. & Osborne, T. J. Monte Carlo graph search for quantum circuit optimization. Phys. Rev. A 108, 062615 (2023).","journal-title":"Phys. Rev. A"},{"key":"1001_CR34","doi-asserted-by":"crossref","unstructured":"Cheung, D., Maslov, D., Mathew, J. & Pradhan, D. K. On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography. In Theory of Quantum Computation, Communication, and Cryptography (eds Kawano, Y. & Mosca, M.) 96\u2013104 (Springer, 2008).","DOI":"10.1007\/978-3-540-89304-2_9"},{"key":"1001_CR35","first-page":"293","volume":"145","author":"A Karatsuba","year":"1962","unstructured":"Karatsuba, A. & Ofman, Y. Multiplication of many-digital numbers by automatic computers. Proc. USSR Acad. Sci. 145, 293\u2013294 (1962).","journal-title":"Proc. USSR Acad. Sci."},{"key":"1001_CR36","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C. H. Time\/space trade-offs for reversible computation. SIAM J. Comput. 18, 766\u2013776 (1989).","journal-title":"SIAM J. Comput."},{"key":"1001_CR37","unstructured":"Gidney, C. Asymptotically efficient quantum Karatsuba multiplication. (2019)."},{"key":"1001_CR38","doi-asserted-by":"crossref","unstructured":"Gidney, C. Halving the cost of quantum addition. Quantum 2, 74 (2018).","DOI":"10.22331\/q-2018-06-18-74"},{"key":"1001_CR39","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":"1001_CR40","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":"1001_CR41","doi-asserted-by":"publisher","unstructured":"Vandaele, V., Martiel, S., Perdrix, S. & Vuillot, C. Optimal Hadamard gate count for Clifford + T synthesis of Pauli rotations sequences. ACM Trans. Quantum Comput. https:\/\/doi.org\/10.1145\/3639062 (2024).","DOI":"10.1145\/3639062"},{"key":"1001_CR42","doi-asserted-by":"crossref","unstructured":"Jones, C. Low-overhead constructions for the fault-tolerant Toffoli gate. Phys. Rev. A 87, 022328 (2013).","DOI":"10.1103\/PhysRevA.87.022328"},{"key":"1001_CR43","doi-asserted-by":"crossref","unstructured":"Beverland, M., Campbell, E., Howard, M. & Kliuchnikov, V. Lower bounds on the non-Clifford resources for quantum computations. Quantum Sci. Technol. 5, 035009 (2020).","DOI":"10.1088\/2058-9565\/ab8963"},{"key":"1001_CR44","unstructured":"Amy, M. Feynman. Quantum circuit analysis toolkit. GitHub https:\/\/github.com\/meamy\/feynman (2016)."},{"key":"1001_CR45","unstructured":"Zhang, F. & Chen, J. Optimizing T gates in Clifford + T circuit as \u03c0\/4 rotations around Paulis. Preprint at https:\/\/arxiv.org\/abs\/1903.12456 (2019)."},{"key":"1001_CR46","doi-asserted-by":"crossref","unstructured":"Munson, A., Coecke, B. & Wang, Q. AND-gates in ZX-calculus: spider nest identities and QBC-completeness. In Proc. 17th International Conference on Quantum Physics and Logic (eds Valiron, B et al.) 230\u2013255 (EPTCS, 2020).","DOI":"10.4204\/EPTCS.340.12"},{"key":"1001_CR47","doi-asserted-by":"crossref","unstructured":"de Moura, L. & Bj\u00f8rner, N. in Tools and Algorithms for the Construction and Analysis of Systems (eds Ramakrishnan, C. R. & Rehof, J.) 337\u2013340 (Springer, 2008).","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"1001_CR48","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"PL Montgomery","year":"2005","unstructured":"Montgomery, P. L. Five, six, and seven-term Karatsuba-like formulae. IEEE Trans. Comput. 54, 362\u2013369 (2005).","journal-title":"IEEE Trans. Comput."},{"key":"1001_CR49","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TC.2007.1024","volume":"56","author":"H Fan","year":"2007","unstructured":"Fan, H. & Hasan, M. A. Comments on \u2018five, six, and seven-term Karatsuba-like formulae\u2019. IEEE Trans. Comput. 56, 716\u2013717 (2007).","journal-title":"IEEE Trans. Comput."},{"key":"1001_CR50","doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Detrey, J., Estibals, N. & Zimmermann, P. in Arithmetic of Finite Fields (eds \u00d6zbudak, F. & Rodr\u00edguez-Henr\u00edquez, F.) 168\u2013186 (Springer, 2012).","DOI":"10.1007\/978-3-642-31662-3_12"},{"key":"1001_CR51","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":"1001_CR52","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1038\/s42254-019-0086-7","volume":"1","author":"R Or\u00fas","year":"2019","unstructured":"Or\u00fas, R. Tensor networks for complex quantum systems. Nat. Rev. Phys. 1, 538\u2013550 (2019).","journal-title":"Nat. Rev. Phys."},{"key":"1001_CR53","doi-asserted-by":"publisher","first-page":"030305","DOI":"10.1103\/PRXQuantum.2.030305","volume":"2","author":"J Lee","year":"2021","unstructured":"Lee, J. et al. Even more efficient quantum computations of chemistry through tensor hypercontraction. PRX Quantum 2, 030305 (2021).","journal-title":"PRX Quantum"},{"key":"1001_CR54","doi-asserted-by":"publisher","first-page":"033055","DOI":"10.1103\/PhysRevResearch.3.033055","volume":"3","author":"V von Burg","year":"2021","unstructured":"von Burg, V. et al. Quantum computing enhanced computational catalysis. Phys. Rev. Res. 3, 033055 (2021).","journal-title":"Phys. Rev. Res."},{"key":"1001_CR55","unstructured":"Gidney, C. & Jones, C. A CCCZ gate performed with 6 T gates. Preprint at https:\/\/arxiv.org\/abs\/2106.11513 (2021)."},{"key":"1001_CR56","doi-asserted-by":"publisher","first-page":"052602","DOI":"10.1103\/PhysRevA.104.052602","volume":"104","author":"M Amy","year":"2021","unstructured":"Amy, M. & Ross, N. J. Phase-state duality in reversible circuit design. Phys. Rev. A 104, 052602 (2021).","journal-title":"Phys. Rev. A"},{"key":"1001_CR57","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M. & Roetteler, M. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32, 818\u2013830 (2013).","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"1001_CR58","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver, D. et al. A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play. Science 362, 1140\u20131144 (2018).","journal-title":"Science"},{"key":"1001_CR59","unstructured":"Vaswani, A. et al. Attention is all you need. In Advances in Neural Information Processing Systems (eds Guyun, U. et al.) (Curran Associates, 2017)."},{"key":"1001_CR60","unstructured":"Ho, J., Kalchbrenner, N., Weissenborn, D. & Salimans, T. Axial attention in multidimensional transformers. Preprint at https:\/\/arxiv.org\/abs\/1912.12180 (2019)."},{"key":"1001_CR61","unstructured":"Hubert, T. et al. Learning and planning in complex action spaces. In Proc. 38th International Conference on Machine Learning 4476\u20134486 (PMLR, 2021)."},{"key":"1001_CR62","first-page":"102","volume":"5","author":"CM Dawson","year":"2005","unstructured":"Dawson, C. M. et al. Quantum computing and polynomial equations over the finite field Z2. Quantum Inf. Comput. 5, 102\u2013112 (2005).","journal-title":"Quantum Inf. Comput."},{"key":"1001_CR63","doi-asserted-by":"publisher","unstructured":"Ruiz, F. J. R. AlphaTensor-Quantum GitHub repository. Zenodo https:\/\/doi.org\/10.5281\/zenodo.14679491 (2025).","DOI":"10.5281\/zenodo.14679491"},{"key":"1001_CR64","unstructured":"DeepMind et al. The DeepMind JAX ecosystem. GitHub https:\/\/github.com\/google-deepmind\/mctx (2020)."},{"key":"1001_CR65","doi-asserted-by":"publisher","unstructured":"Laakkonen, T. Circuit-to-tensor GitHub repository. Zenodo https:\/\/doi.org\/10.5281\/zenodo.14680969 (2025).","DOI":"10.5281\/zenodo.14680969"}],"container-title":["Nature Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s42256-025-01001-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-025-01001-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-025-01001-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T23:24:18Z","timestamp":1767050658000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s42256-025-01001-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,20]]},"references-count":65,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["1001"],"URL":"https:\/\/doi.org\/10.1038\/s42256-025-01001-1","relation":{},"ISSN":["2522-5839"],"issn-type":[{"value":"2522-5839","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,20]]},"assertion":[{"value":"8 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 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"}}]}}