{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T21:51:57Z","timestamp":1768945917059,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"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":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s42484-026-00351-2","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T08:37:50Z","timestamp":1768898270000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Future of quantum computing"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1333-4045","authenticated-orcid":false,"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9903-837X","authenticated-orcid":false,"given":"Andrew M.","family":"Childs","sequence":"additional","affiliation":[]},{"given":"Edward","family":"Farhi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3220-7682","authenticated-orcid":false,"given":"Aram W.","family":"Harrow","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8326-8912","authenticated-orcid":false,"given":"Barry C.","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"key":"351_CR1","unstructured":"Aaronson S (2013) D-Wave: Truth finally starts to emerge. https:\/\/scottaaronson.blog\/?p=1400. Accessed 18 June 2025"},{"key":"351_CR2","unstructured":"Aaronson S (2024) Podcasts! https:\/\/scottaaronson.blog\/?m=202412. Accessed 18 June 2025"},{"key":"351_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1038\/nphys3272","volume":"11","author":"S Aaronson","year":"2015","unstructured":"Aaronson S (2015) Read the fine print. Nat Phys 11:291","journal-title":"Nat Phys"},{"key":"351_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.4086\/toc.2014.v010a006","volume":"18","author":"S Aaronson","year":"2014","unstructured":"Aaronson S, Ambainis A (2014) The need for structure in quantum speedups. Theory Comput 18:133","journal-title":"Theory Comput"},{"key":"351_CR5","doi-asserted-by":"crossref","unstructured":"Aharonov D, Ben-Or M (1997) Fault-tolerant quantum computation with constant error. In: 1997 Proceedings 29th annual ACM symposium on the theory of computing, pp 176\u2013188","DOI":"10.1145\/258533.258579"},{"key":"351_CR6","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R Beals","year":"2001","unstructured":"Beals R, Buhrman H, Cleve R, Mosca M, De Wolf R (2001) Quantum lower bounds by polynomials. J ACM 48:778","journal-title":"J ACM"},{"key":"351_CR7","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein E, Vazirani U (1997) Quantum complexity theory. SIAM J Comput 26:1411","journal-title":"SIAM J Comput"},{"key":"351_CR8","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex Optimization. Cambridge University Press, Cambridge UK","DOI":"10.1017\/CBO9780511804441"},{"key":"351_CR9","unstructured":"Brown M (1947) Stone Soup. Scribner, New York"},{"key":"351_CR10","doi-asserted-by":"crossref","unstructured":"Childs AM, Cleve R, Deotto E et al (2003) Exponential algorithmic speedup by a quantum walk. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing. STOC \u201903, (Association for Computing Machinery, New York,) pp 59\u201368","DOI":"10.1145\/780542.780552"},{"issue":"03","key":"351_CR11","doi-asserted-by":"publisher","first-page":"1430002","DOI":"10.1142\/S0219749914300022","volume":"12","author":"E Cohen","year":"2014","unstructured":"Cohen E, Tamir B (2014) D-wave and predecessors: From simulated to quantum annealing. Int J Quantum Inf 12(03):1430002. https:\/\/doi.org\/10.1142\/S0219749914300022","journal-title":"Int J Quantum Inf"},{"key":"351_CR12","unstructured":"D\u00edez-Valle P, G\u00f3mez-Ruiz FJ, Porras D et al (2025) Universal resources for qaoa and quantum annealing. arXiv:2506.03241 [quant-ph]"},{"key":"351_CR13","doi-asserted-by":"publisher","first-page":"5442","DOI":"10.1103\/PhysRevLett.81.5442","volume":"81","author":"E Farhi","year":"1998","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M (1998) Limit on the speed of quantum computation in determining parity. Phys Rev Lett 81:5442","journal-title":"Phys Rev Lett"},{"key":"351_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.22331\/q-2022-07-07-759","volume":"6","author":"E Farhi","year":"2022","unstructured":"Farhi E, Goldstone E, Gutmann S, Zhou L (2022) The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size. Quantum 6:759","journal-title":"Quantum"},{"key":"351_CR15","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv:1411.4028 [quant-ph]"},{"key":"351_CR16","unstructured":"Farhi E, Harrow AW (2019) Quantum supremacy through the quantum approximate optimization algorithm. arXiv:1602.07674 [quant-ph]"},{"key":"351_CR17","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman RP (1982) Simulating physics with computers. Int J Theor Phys 21:467","journal-title":"Int J Theor Phys"},{"key":"351_CR18","unstructured":"Field H (2024) OpenAI dissolves team focused on long-term AI risks, less than one year after announcing it. CNBC"},{"key":"351_CR19","unstructured":"Gallon D, Jentzen A, von Wurstemberger P (2024) An overview of diffusion models for generative artificial intelligence. arXiv:2412.01371 [cs.LG]"},{"key":"351_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.160501","volume":"100","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti V, Lloyd S, Maccone L (2008) Quantum random access memory. Phys Rev Lett 100:160501","journal-title":"Phys Rev Lett"},{"key":"351_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L Grover","year":"1997","unstructured":"Grover L (1997) Quantum mechanics helps in searching for a needle in a haystack. Phys Rev Lett 79:325","journal-title":"Phys Rev Lett"},{"key":"351_CR22","unstructured":"Harrow AW (2020) Small quantum computers and large classical data sets. arXiv:2004.00026 [quant-ph]"},{"key":"351_CR23","unstructured":"Jordan SP, Shutty N, Wootters M, et al (2024) Optimization by decoded quantum interferometry. arXiv:2408.08292 [quant-ph]"},{"key":"351_CR24","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1137\/S0097539704445226","volume":"35","author":"J Kempe","year":"2006","unstructured":"Kempe J, Kitaev A, Regev O (2006) The complexity of the local Hamiltonian problem. SIAM J Comput 35:1070","journal-title":"SIAM J Comput"},{"key":"351_CR25","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1038\/s41586-023-06095-4","volume":"619","author":"D Layden","year":"2023","unstructured":"Layden D, Mazzola G, Mishmash MRV, amd Motta PW, Kim J-S, Sheldon S, (2023) Quantum-enhanced Markov chain Monte Carlo. Nature 619:282","journal-title":"Nature"},{"key":"351_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.6.013071","volume":"6","author":"S Leontica","year":"2024","unstructured":"Leontica S, Amaro D (2024) Exploring the neighborhood of 1-layer qaoa with instantaneous quantum polynomial circuits. Phys Rev Res 6:013071","journal-title":"Phys Rev Res"},{"issue":"4","key":"351_CR27","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab9f93","volume":"5","author":"Y Li","year":"2020","unstructured":"Li Y, Zhou RG, Xu R et al (2020) A quantum deep convolutional neural network for image recognition. Quantum Sci Technol 5(4):044003","journal-title":"Quantum Sci Technol"},{"key":"351_CR28","unstructured":"Prokofiew A, Sharma N, Schnetzer S (2024) Studies of the Fermi-Hubbard model using quantum computing. arXiv:2408.16175 [physics.comp-ph]"},{"key":"351_CR29","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: Discrete logarithms and factoring. In: Proceedings 35th annual symposium on foundations of computer science, SFCS \u201894\u2019, pp 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"key":"351_CR30","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon DR (1997) On the power of quantum computation. SIAM J Comput 26:1474","journal-title":"SIAM J Comput"},{"key":"351_CR31","doi-asserted-by":"crossref","unstructured":"van Laarhoven PJM, Aarts EHL (1987) Simulated annealing: Theory and Applications, Mathematics and Its Applications, vol 37. Reidel, Dordrecht","DOI":"10.1007\/978-94-015-7744-1"},{"key":"351_CR32","unstructured":"Vaswani A, Shazeer N, Parmar N et al (2017) Attention is all you need. In: Proceedings of the 31st international conference on neural information processing systems. Curran Associates Inc., Red Hook, NY, USA, NIPS\u201917, pp 6000\u20136010"},{"key":"351_CR33","doi-asserted-by":"publisher","unstructured":"Yamakawa T, Zhandry M (2024) Verifiable quantum advantage without structure. J ACM 71. https:\/\/doi.org\/10.1145\/3658665","DOI":"10.1145\/3658665"},{"key":"351_CR34","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s100320050034","volume":"2","author":"J Zhou","year":"1999","unstructured":"Zhou J, Gan Q, Krzy\u017cak A, Suen CY (1999) Recognition of handwritten numerals by quantum neural network with fuzzy features. Int J Doc Anal Recognit 2:30","journal-title":"Int J Doc Anal Recognit"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00351-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-026-00351-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00351-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T08:37:55Z","timestamp":1768898275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-026-00351-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,20]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["351"],"URL":"https:\/\/doi.org\/10.1007\/s42484-026-00351-2","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,20]]},"assertion":[{"value":"26 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"3"}}