{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,19]],"date-time":"2026-11-19T22:16:46Z","timestamp":1795126606545,"version":"4.10.3"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T00:00:00Z","timestamp":1736294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T00:00:00Z","timestamp":1736294400000},"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 Commun"],"DOI":"10.1038\/s41467-024-55346-z","type":"journal-article","created":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T01:14:37Z","timestamp":1736298877000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Towards large-scale quantum optimization solvers with few qubits"],"prefix":"10.1038","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8952-6055","authenticated-orcid":false,"given":"Marco","family":"Sciorilli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lucas","family":"Borges","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taylor L.","family":"Patti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Diego","family":"Garc\u00eda-Mart\u00edn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1992-2502","authenticated-orcid":false,"given":"Giancarlo","family":"Camilo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6974-6797","authenticated-orcid":false,"given":"Anima","family":"Anandkumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leandro","family":"Aolita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,8]]},"reference":[{"key":"55346_CR1","doi-asserted-by":"crossref","unstructured":"Korte, B. H., Vygen, J., Korte, B. & Vygen, J.Combinatorial optimization, vol. 1 (Springer, 2011).","DOI":"10.1007\/978-3-642-24488-9_1"},{"key":"55346_CR2","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. arXiv 1411.4028 (2014)."},{"key":"55346_CR3","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-43176-9","volume":"9","author":"GG Guerreschi","year":"2019","unstructured":"Guerreschi, G. G. & Matsuura, A. Y. QAOA for max-cut requires hundreds of qubits for quantum speed-up. Sci. Rep. 9, 6903 (2019).","journal-title":"Sci. Rep."},{"key":"55346_CR4","doi-asserted-by":"publisher","first-page":"090504","DOI":"10.1103\/PhysRevLett.124.090504","volume":"124","author":"V Akshay","year":"2020","unstructured":"Akshay, V., Philathong, H., Morales, M. & Biamonte, J. Reachability deficits in quantum approximate optimization. Phys. Rev. Lett. 124, 090504 (2020).","journal-title":"Phys. Rev. Lett."},{"key":"55346_CR5","doi-asserted-by":"publisher","first-page":"L010401","DOI":"10.1103\/PhysRevA.104.L010401","volume":"104","author":"V Akshay","year":"2021","unstructured":"Akshay, V., Rabinovich, D., Campos, E. & Biamonte, J. Parameter concentrations in quantum approximate optimization. Phys. Rev. A 104, L010401 (2021).","journal-title":"Phys. Rev. A"},{"key":"55346_CR6","doi-asserted-by":"publisher","first-page":"042612","DOI":"10.1103\/PhysRevA.103.042612","volume":"103","author":"J Wurtz","year":"2021","unstructured":"Wurtz, J. & Love, P. Maxcut quantum approximate optimization algorithm performance guarantees for p > 1. Phys. Rev. A 103, 042612 (2021).","journal-title":"Phys. Rev. A"},{"key":"55346_CR7","doi-asserted-by":"publisher","first-page":"25396","DOI":"10.1073\/pnas.2006373117","volume":"117","author":"G Pagano","year":"2020","unstructured":"Pagano, G. et al. Quantum approximate optimization of the long-range ising model with a trapped-ion quantum simulator. Proc. Natl Acad. Sci. 117, 25396\u201325401 (2020).","journal-title":"Proc. Natl Acad. Sci."},{"key":"55346_CR8","first-page":"1745","volume":"3","author":"MP Harrigan","year":"2021","unstructured":"Harrigan, M. P. et al. Quantum approximate optimization of non-planar graph problems on a planar superconducting processor. Nat. Phys. 3, 1745 (2021).","journal-title":"Nat. Phys."},{"key":"55346_CR9","doi-asserted-by":"crossref","unstructured":"Ebadi, S. et al. Quantum optimization of maximum independent set using rydberg atom array. Science 376, 1209 (2022).","DOI":"10.1126\/science.abo6587"},{"key":"55346_CR10","doi-asserted-by":"publisher","first-page":"104001","DOI":"10.1088\/1361-6633\/ac8c54","volume":"85","author":"S Yarkoni","year":"2022","unstructured":"Yarkoni, S., Raponi, E., B\u00e4ck, T. & Schmitt, S. Quantum annealing for industry applications: introduction and review. Rep. Prog. Phys. 85, 104001 (2022).","journal-title":"Rep. Prog. Phys."},{"key":"55346_CR11","unstructured":"D\u00fcrr, C. & Hoyer, P. A quantum algorithm for finding the minimum. CoRRquant-ph\/9607014 (1996)."},{"key":"55346_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/992287.992296","volume":"35","author":"A Ambainis","year":"2004","unstructured":"Ambainis, A. Quantum search algorithms. ACM SIGACT N. 35, 22\u201335 (2004).","journal-title":"ACM SIGACT N."},{"key":"55346_CR13","doi-asserted-by":"publisher","first-page":"013056","DOI":"10.1103\/PhysRevResearch.2.013056","volume":"2","author":"A Montanaro","year":"2020","unstructured":"Montanaro, A. Quantum speedup of branch-and-bound algorithms. Phys. Rev. Res. 2, 013056 (2020).","journal-title":"Phys. Rev. Res."},{"key":"55346_CR14","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":"55346_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.22331\/q-2019-07-18-167","volume":"3","author":"E Campbell","year":"2019","unstructured":"Campbell, E., Khurana, A. & Montanaro, A. Applying quantum algorithms to constraint satisfaction problems. Quantum 3, 167 (2019).","journal-title":"Quantum"},{"key":"55346_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).","journal-title":"Quantum"},{"key":"55346_CR17","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo, M. et al. Variational quantum algorithms. Nat. Rev. Phys. 3, 625\u2013644 (2021).","journal-title":"Nat. Rev. Phys."},{"key":"55346_CR18","doi-asserted-by":"publisher","first-page":"015004","DOI":"10.1103\/RevModPhys.94.015004","volume":"94","author":"K Bharti","year":"2022","unstructured":"Bharti, K. et al. Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys. 94, 015004 (2022).","journal-title":"Rev. Mod. Phys."},{"key":"55346_CR19","unstructured":"Cerezo, M. et al. Does provable absence of barren plateaus imply classical simulability? or, why we need to rethink variational quantum computing 2312.09121 (2023)."},{"key":"55346_CR20","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1038\/s41567-021-01356-3","volume":"17","author":"D Stilck Fran\u00e7a","year":"2021","unstructured":"Stilck Fran\u00e7a, D. & Garcia-Patron, R. Limitations of optimization algorithms on noisy quantum devices. Nat. Phys. 17, 1221\u20131227 (2021).","journal-title":"Nat. Phys."},{"key":"55346_CR21","doi-asserted-by":"publisher","first-page":"120502","DOI":"10.1103\/PhysRevLett.127.120502","volume":"127","author":"L Bittel","year":"2021","unstructured":"Bittel, L. & Kliesch, M. Training variational quantum algorithms is np-hard. Phys. Rev. Lett. 127, 120502 (2021).","journal-title":"Phys. Rev. Lett."},{"key":"55346_CR22","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-35364-5","volume":"13","author":"ER Anschuetz","year":"2022","unstructured":"Anschuetz, E. R. & Kiani, B. T. Quantum variational algorithms are swamped with traps. Nat. Commun. 13, 7760 (2022).","journal-title":"Nat. Commun."},{"key":"55346_CR23","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-07090-4","volume":"9","author":"JR McClean","year":"2018","unstructured":"McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R. & Neven, H. Barren plateaus in quantum neural network training landscapes. Nat. Commun. 9, 4812 (2018).","journal-title":"Nat. Commun."},{"key":"55346_CR24","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-27045-6","volume":"12","author":"S Wang","year":"2021","unstructured":"Wang, S. et al. Noise-induced barren plateaus in variational quantum algorithms. Nat. Commun. 12, 6961 (2021).","journal-title":"Nat. Commun."},{"key":"55346_CR25","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Mart\u00edn, D., Larocca, M. & Cerezo, M. Effects of noise on the overparametrization of quantum neural networks. Phys. Rev. Research 6, 013295 (2024).","DOI":"10.1103\/PhysRevResearch.6.013295"},{"key":"55346_CR26","doi-asserted-by":"crossref","unstructured":"Fuller, B. et al. Approximate solutions of combinatorial problems via quantum relaxations. IEEE Trans. Quantum Eng. 5, 1\u201315 (2021).","DOI":"10.1109\/TQE.2024.3421294"},{"key":"55346_CR27","doi-asserted-by":"publisher","first-page":"033142","DOI":"10.1103\/PhysRevResearch.4.033142","volume":"4","author":"TL Patti","year":"2022","unstructured":"Patti, T. L., Kossaifi, J., Anandkumar, A. & Yelin, S. F. Variational quantum optimization with multibasis encodings. Phys. Rev. Res. 4, 033142 (2022).","journal-title":"Phys. Rev. Res."},{"key":"55346_CR28","doi-asserted-by":"publisher","first-page":"454","DOI":"10.22331\/q-2021-05-04-454","volume":"5","author":"B Tan","year":"2021","unstructured":"Tan, B., Lemonde, M.-A., Thanasilp, S., Tangpanitanon, J. & Angelakis, D. G. Qubit-efficient encoding schemes for binary optimisation problems. Quantum 5, 454 (2021).","journal-title":"Quantum"},{"key":"55346_CR29","doi-asserted-by":"crossref","unstructured":"Huber, E. X., Tan, B. Y. L., Griffin, P. R. & Angelakis, D. G. Exponential qubit reduction in optimization for financial transaction settlement. EPJ Quantum Technol. 11, 52 (2024).","DOI":"10.1140\/epjqt\/s40507-024-00262-w"},{"key":"55346_CR30","doi-asserted-by":"crossref","unstructured":"Leonidas, I. D., Dukakis, A., Tan, B. & Angelakis, D. G. Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors. Adv. Quantum Technol. 7, 5 (2024).","DOI":"10.1002\/qute.202300309"},{"key":"55346_CR31","unstructured":"Tene-Cohen, Y., Kelman, T., Lev, O. & Makmal, A. A variational qubit-efficient maxcut heuristic algorithm. arXiv: 2308.10383 (2023)."},{"key":"55346_CR32","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.22331\/q-2023-11-21-1186","volume":"7","author":"MR Perelshtein","year":"2023","unstructured":"Perelshtein, M. R. et al. Nisq-compatible approximate quantum algorithm for unconstrained and constrained discrete optimization. Quantum 7, 1186 (2023).","journal-title":"Quantum"},{"key":"55346_CR33","doi-asserted-by":"crossref","unstructured":"Abbas, A. et al. Challenges and opportunities in quantum optimization. Nature Reviews Physics 6, 718\u2013735 (2024).","DOI":"10.1038\/s42254-024-00770-9"},{"key":"55346_CR34","unstructured":"Ye, Y. Gset test problems. https:\/\/web.stanford.edu\/~yyye\/yyye\/Gset\/ (unpublished)."},{"key":"55346_CR35","unstructured":"Choi, C. & Ye, Y. Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver. https:\/\/web.stanford.edu\/~yyye\/yyye\/cgsdp1.pdf (2000)."},{"key":"55346_CR36","doi-asserted-by":"crossref","unstructured":"Burer, S. & Monteiro, R. D. C. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. Ser. B. 95, 329\u2013357 (2003).","DOI":"10.1007\/s10107-002-0352-8"},{"key":"55346_CR37","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1287\/ijoc.2017.0798","volume":"30","author":"I Dunning","year":"2018","unstructured":"Dunning, I., Gupta, S. & Silberholz, J. What works best when? a systematic evaluation of heuristics for Max-Cut and QUBO. INFORMS J. Comput. 30, 608\u2013624 (2018).","journal-title":"INFORMS J. Comput."},{"key":"55346_CR38","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-21728-w","volume":"12","author":"M Cerezo","year":"2021","unstructured":"Cerezo, M., Sone, A., Volkoff, T., Cincio, L. & Coles, P. J. Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat. Commun. 12, 1791 (2021).","journal-title":"Nat. Commun."},{"key":"55346_CR39","doi-asserted-by":"crossref","unstructured":"Wang, S. et al. Noise-induced barren plateaus in variational quantum algorithms. Nat. Commun. 12, 6961 (2021).","DOI":"10.1038\/s41467-021-27045-6"},{"key":"55346_CR40","doi-asserted-by":"crossref","unstructured":"Fontana, E. et al. Characterizing barren plateaus in quantum ans\u00e4tze with the adjoint representation. Nat Commun 15, 7171 (2024).","DOI":"10.1038\/s41467-024-49910-w"},{"key":"55346_CR41","doi-asserted-by":"crossref","unstructured":"Ragone, M. et al. A Lie algebraic theory of barren plateaus for deep parameterized quantum circuits. Nature Commun 15, 7172 (2024).","DOI":"10.1038\/s41467-024-49909-3"},{"key":"55346_CR42","doi-asserted-by":"publisher","first-page":"045015","DOI":"10.1088\/2058-9565\/ac7d06","volume":"7","author":"A Arrasmith","year":"2022","unstructured":"Arrasmith, A., Holmes, Z., Cerezo, M. & Coles, P. J. Equivalence of quantum barren plateaus to cost concentration and narrow gorges. Quantum Sci. Technol. 7, 045015 (2022).","journal-title":"Quantum Sci. Technol."},{"key":"55346_CR43","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00220-016-2706-8","volume":"346","author":"FGSL Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, F. G. S. L., Harrow, A. W. & Horodecki, M. Local random quantum circuits are approximate polynomial-designs. Commun. Math. Phys. 346, 397\u2013434 (2016).","journal-title":"Commun. Math. Phys."},{"key":"55346_CR44","doi-asserted-by":"publisher","first-page":"795","DOI":"10.22331\/q-2022-09-08-795","volume":"6","author":"J Haferkamp","year":"2022","unstructured":"Haferkamp, J. Random quantum circuits are approximate unitary t-designs in depth $${{\\mathcal{O}}}(n{t}^{5+o(1)})$$. Quantum 6, 795 (2022).","journal-title":"Quantum"},{"key":"55346_CR45","first-page":"021050","volume":"7","author":"Y Li","year":"2017","unstructured":"Li, Y. & Benjamin, S. C. Efficient variational quantum simulator incorporating active error minimization. Phys. Rev. X 7, 021050 (2017).","journal-title":"Phys. Rev. X"},{"key":"55346_CR46","doi-asserted-by":"publisher","first-page":"180509","DOI":"10.1103\/PhysRevLett.119.180509","volume":"119","author":"K Temme","year":"2017","unstructured":"Temme, K., Bravyi, S. & Gambetta, J. M. Error mitigation for short-depth quantum circuits. Phys. Rev. Lett. 119, 180509 (2017).","journal-title":"Phys. Rev. Lett."},{"key":"55346_CR47","doi-asserted-by":"crossref","unstructured":"Cai, Z. et al. Quantum error mitigation. Rev. Mod. Phys. 95, (2023).","DOI":"10.1103\/RevModPhys.95.045005"},{"key":"55346_CR48","unstructured":"Chermoshentsev, D. A. et al. Polynomial unconstrained binary optimisation inspired by optical simulation. ArXiv: 2106.13167 (2022)."},{"key":"55346_CR49","doi-asserted-by":"publisher","first-page":"052331","DOI":"10.1103\/PhysRevA.77.052331","volume":"77","author":"JD Biamonte","year":"2008","unstructured":"Biamonte, J. D. Nonperturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins. Phys. Rev. A 77, 052331 (2008).","journal-title":"Phys. Rev. A"},{"key":"55346_CR50","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-022-00546-y","volume":"8","author":"A Glos","year":"2022","unstructured":"Glos, A., Krawiec, A. & Zimbor\u00e1s, Z. Diagnosing barren plateaus with tools from quantum optimal control. NPJ Quantum Inf. 8, 39 (2022).","journal-title":"NPJ Quantum Inf."},{"key":"55346_CR51","doi-asserted-by":"publisher","first-page":"015003","DOI":"10.1103\/RevModPhys.92.015003","volume":"92","author":"S McArdle","year":"2020","unstructured":"McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C. & Yuan, X. Quantum computational chemistry. Rev. Mod. Phys. 92, 015003 (2020).","journal-title":"Rev. Mod. Phys."},{"key":"55346_CR52","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-43908-6","volume":"14","author":"M Rudolph","year":"2023","unstructured":"Rudolph, M. et al. Synergistic pretraining of parametrized quantum circuits via tensor networks. Nat. Commun. 14, 8367 (2023).","journal-title":"Nat. Commun."},{"key":"55346_CR53","doi-asserted-by":"publisher","unstructured":"Karp, R. M. Reducibility among Combinatorial Problems, 85\u2013103 (Springer US, Boston, MA, 1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"55346_CR54","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J. Some optimal inapproximability results. J. ACM 48, 798\u2013859 (2001).","journal-title":"J. ACM"},{"key":"55346_CR55","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1137\/S0097539797328847","volume":"29","author":"L Trevisan","year":"2000","unstructured":"Trevisan, L., Sorkin, G. B., Sudan, M. & Williamson, D. P. Gadgets, approximation, and linear programming. SIAM J. Comput. 29, 2074\u20132097 (2000).","journal-title":"SIAM J. Comput."},{"key":"55346_CR56","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M. X. & Williamson, D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995).","journal-title":"J. ACM"},{"key":"55346_CR57","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0012-365X(86)90192-5","volume":"58","author":"S Poljak","year":"1986","unstructured":"Poljak, S. & Turz\u00edk, D. A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. Discret. Math. 58, 99\u2013104 (1986).","journal-title":"Discret. Math."},{"key":"55346_CR58","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0012-365X(98)00115-0","volume":"194","author":"S Bylka","year":"1999","unstructured":"Bylka, S., Idzik, A. & Tuza, Z. Maximum cuts: improvementsand local algorithmic analogues of the edwards-erdos inequality. Discret. Math. 194, 39\u201358 (1999).","journal-title":"Discret. Math."},{"key":"55346_CR59","unstructured":"Rinaldi, G. Rudy graph generator. http:\/\/www-user.tu-chemnitz.de\/~helmberg\/rudy.tar.gz (unpublished)."},{"key":"55346_CR60","unstructured":"Pataki, G. & Schmieta, S. H. The DIMACS library of mixed semidefinite-quadratic-linear programs. http:\/\/archive.dimacs.rutgers.edu\/Challenges\/Seventh\/Instances\/ (unpublished)."},{"key":"55346_CR61","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1016\/j.engappai.2012.09.001","volume":"26","author":"U Benlic","year":"2013","unstructured":"Benlic, U. & Hao, J.-K. Breakout local search for the Max-Cut problem. Eng. Appl. Artif. Intell. 26, 1162\u20131173 (2013).","journal-title":"Eng. Appl. Artif. Intell."},{"key":"55346_CR62","doi-asserted-by":"publisher","first-page":"015018","DOI":"10.1088\/2058-9565\/ac39f5","volume":"7","author":"S Efthymiou","year":"2021","unstructured":"Efthymiou, S. et al. Qibo: a framework for quantum simulation with hardware acceleration. Quantum Sci. Technol. 7, 015018 (2021).","journal-title":"Quantum Sci. Technol."},{"key":"55346_CR63","doi-asserted-by":"publisher","first-page":"814","DOI":"10.22331\/q-2022-09-22-814","volume":"6","author":"S Efthymiou","year":"2022","unstructured":"Efthymiou, S., Lazzarin, M., Pasquale, A. & Carrazza, S. Quantum simulation with just-in-time compilation. Quantum 6, 814 (2022).","journal-title":"Quantum"},{"key":"55346_CR64","unstructured":"Patti, T. L., Kossaifi, J., Yelin, S. F. & Anandkumar, A. Tensorly-quantum: quantum machine learning with tensor methods. ArXiv: 2112.10239 (2021)."}],"container-title":["Nature Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41467-024-55346-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41467-024-55346-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41467-024-55346-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T02:04:10Z","timestamp":1736301850000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41467-024-55346-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,8]]},"references-count":64,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["55346"],"URL":"https:\/\/doi.org\/10.1038\/s41467-024-55346-z","relation":{},"ISSN":["2041-1723"],"issn-type":[{"value":"2041-1723","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,8]]},"assertion":[{"value":"13 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 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"}}],"article-number":"476"}}