{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:29Z","timestamp":1780711409628,"version":"3.54.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s42484-020-00030-w","type":"journal-article","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T14:02:38Z","timestamp":1609682558000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning adiabatic quantum algorithms over optimization problems"],"prefix":"10.1007","volume":"3","author":[{"given":"Davide","family":"Pastorello","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enrico","family":"Blanzieri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valter","family":"Cavecchia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,3]]},"reference":[{"key":"30_CR1","first-page":"1","volume":"6","author":"DW Aha","year":"1991","unstructured":"Aha DW, Kibler D, Albert MK (1991) Instance-based learning algorithms. Mach Learn 6:1","journal-title":"Mach Learn"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/S0097539705447323","volume":"37","author":"D Aharonov","year":"2007","unstructured":"Aharonov D, van Dam W, Kempe J, Landau Z, Loyd S, Regev O (2007) Adiabatic quantum computing is equivalent to standard quantum computation. SIAM J Comput 37(1):166\u2013194","journal-title":"SIAM J Comput"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"015002","DOI":"10.1103\/RevModPhys.90.015002","volume":"90","author":"T Albash","year":"2018","unstructured":"Albash T, Lidar DA (2018) Adiabatic quantum computation. Rev Mod Phys 90:015002","journal-title":"Rev Mod Phys"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"12446","DOI":"10.1073\/pnas.1002116107","volume":"107","author":"B Altshuler","year":"2010","unstructured":"Altshuler B, Krovi H, Roland J (2010) Anderson localization makes adiabatic quantum optimization fail. Proc Natl Acad Sci 107:12446","journal-title":"Proc Natl Acad Sci"},{"issue":"6","key":"30_CR5","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1287\/opre.35.6.867","volume":"35","author":"S Anily","year":"1987","unstructured":"Anily S, Federgruen A (1987a) Ergodicity in parametric nonstationary Markov chains: applications to simulated annealing methods. Oper Res 35(6):799\u2013933","journal-title":"Oper Res"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"657","DOI":"10.2307\/3214097","volume":"24","author":"S Anily","year":"1987","unstructured":"Anily S, Federgruen A (1987b) Simulated annealing methods with general acceptance probabilities. J Appl Probab 24:657\u2013667","journal-title":"J Appl Probab"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00220-006-0150-x","volume":"270","author":"D Berry","year":"2007","unstructured":"Berry D, Ahokas G, Cleve R, Sanders B (2007) Efficient quantum algorithms for simulating sparse Hamiltonians. Commun Math Phys 270:359\u2013371","journal-title":"Commun Math Phys"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1063\/1.5128231","volume":"29","author":"T Bertalan","year":"2019","unstructured":"Bertalan T, Dietrich F, Mezi\u0107 I, Kevrekidis IG (2019) On learning Hamiltonian systems from data. Chaos 29:12","journal-title":"Chaos"},{"key":"30_CR9","first-page":"3","volume":"51","author":"M Born","year":"1928","unstructured":"Born M, Fock VA (1928) Beweis des Adiabatensatzes. Z Phys A 51:3\u20134","journal-title":"Z Phys A"},{"key":"30_CR10","first-page":"1","volume":"20","author":"C Bouttier","year":"2019","unstructured":"Bouttier C, Gavra I (2019) Convergence rate of a simulated annealing algorithm with noisy observations. J Mach Learn Res 20:1\u201345","journal-title":"J Mach Learn Res"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1088\/1361-6633\/aab406","volume":"81","author":"V Dunjko","year":"2018","unstructured":"Dunjko V, Briegel HJ (2018) Machine learning & artificial intelligence in the quantum domain: a review of recent progress. Rep Prog Phys 81:7","journal-title":"Rep Prog Phys"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1287\/ijoc.4.1.32","volume":"4","author":"U Faigle","year":"1992","unstructured":"Faigle U, Kern W (1992) Some convergence results for probabilistic tabu search. ORSA J Comput 4(1):32\u201337","journal-title":"ORSA J Comput"},{"key":"30_CR13","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M (2000) Quantum computation by adiabatic evolution quant-ph report n. 0001106"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi E, Goldstone J, Gutmann S, Lapan J, Lundgren A, Preda D (2001) A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem. Science 292:472","journal-title":"Science"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(01)00263-3","volume":"19","author":"F Glover","year":"2002","unstructured":"Glover F, Hanafi S (2002) Tabu search and finite convergence. Discrete Appl Math 19:3\u201336","journal-title":"Discrete Appl Math"},{"key":"30_CR16","unstructured":"Guennenbaud G, Jacob B et al (2010) Eigen v3 http:\/\/eigen.tuxfamily.org"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"102111","DOI":"10.1063\/1.2798382","volume":"48","author":"S Jensen","year":"2007","unstructured":"Jensen S, Ruskai M, Seiler R (2007) Bounds for the adiabatic approximation with applications to quantum computation. J Math Phys 48:102111","journal-title":"J Math Phys"},{"key":"30_CR18","unstructured":"Kappen HJ (2018) Learning quantum models from quantum or classical data. arXiv:1409.1556"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1143\/JPSJ.5.435","volume":"5","author":"T Kato","year":"1950","unstructured":"Kato T (1950) On the adiabatic theorem of quantum mechanics. J Phys Soc Jpn 5:6","journal-title":"J Phys Soc Jpn"},{"key":"30_CR20","unstructured":"Lychkovskiy O (2018) Non-diagonal problem Hamiltonian for adiabatic quantum computation. arXiv:1811.09453v1 [quant-ph]"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"McClean JR, Romero J, Babbush R, Aspuru-Guzik A (2016) The theory of variational hybrid quantum-classical algorithms. New J Phys 18","DOI":"10.1088\/1367-2630\/18\/2\/023023"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"McGeoch CC (2014) Adiabatic quantum computation and quantum annealing: theory and practice. Synthesis Lectures on Quantum Computing 5","DOI":"10.2200\/S00585ED1V01Y201407QMC008"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11128-019-2418-z","volume":"18","author":"D Pastorello","year":"2019","unstructured":"Pastorello D, Blanzieri E (2019) Quantum Annealing Learning Search for solving QUBO problems. Quantum Inf Process 18:303","journal-title":"Quantum Inf Process"},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo A, et al. (2014) A variational eigenvalue solver on a quantum processor. Nat Commun 5:4213","journal-title":"Nat Commun"},{"key":"30_CR25","doi-asserted-by":"publisher","first-page":"042308","DOI":"10.1103\/PhysRevA.65.042308","volume":"65","author":"J Roland","year":"2002","unstructured":"Roland J, Cerf NJ (2002) Quantum search by local adiabatic evolution. Phys Rev A 65:042308","journal-title":"Phys Rev A"},{"key":"30_CR26","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/120871997","volume":"42","author":"RD Somma","year":"2013","unstructured":"Somma RD, Boixo S (2013) Spectral gap amplification. SIAM J Comput 42:593\u2013610","journal-title":"SIAM J Comput"},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"061002","DOI":"10.7566\/JPSJ.88.061002","volume":"88","author":"K Takahashi","year":"2019","unstructured":"Takahashi K (2019) Hamiltonian engineering for adiabatic quantum computation: lessons from shortcuts to adiabaticity. J Phys Soc Jpn 88:061002","journal-title":"J Phys Soc Jpn"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Teufel S (2003) Adiabatic perturbation theory in quantum dynamics. Lecture Notes in Mathematics 1821. Springer","DOI":"10.1007\/b13355"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-020-00030-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-020-00030-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-020-00030-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,2]],"date-time":"2021-07-02T08:21:39Z","timestamp":1625214099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-020-00030-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,3]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1007\/s42484-020-00030-w","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,3]]},"assertion":[{"value":"17 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}