{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T11:56:50Z","timestamp":1782907010232,"version":"3.54.5"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11128-019-2418-z","type":"journal-article","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T16:03:42Z","timestamp":1566317022000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Quantum annealing learning search for solving QUBO problems"],"prefix":"10.1007","volume":"18","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"}]}],"member":"297","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"key":"2418_CR1","unstructured":"Abbott, A.A., Calude, C.S., Dinneen, M.J., Hua, R.: A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing. (2018). CoRR, abs\/1803.04340"},{"issue":"6","key":"2418_CR2","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1287\/opre.35.6.867","volume":"35","author":"S Anily","year":"1987","unstructured":"Anily, S., Federgruen, A.: Ergodicity in parametric non-stationary Markov chains: applications to simulated annealing methods. Oper. Res. 35(6), 867\u2013874 (1987)","journal-title":"Oper. Res."},{"key":"2418_CR3","doi-asserted-by":"publisher","first-page":"657","DOI":"10.2307\/3214097","volume":"24","author":"S Anily","year":"1987","unstructured":"Anily, S., Federgruen, A.: Simulated annealing methods with general acceptance probabilities. J. Appl. Probab. 24, 657\u2013667 (1987)","journal-title":"J. Appl. Probab."},{"key":"2418_CR4","doi-asserted-by":"crossref","unstructured":"Bian, Z., Chudak, F., Macready, W., Roy, A., Sebastiani, R., Varotti, S.: Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report. In: Proc. FroCoS 2017\u2014The 11th International Symposium on Frontiers of Combining Systems LNCS, Springer (2017)","DOI":"10.1007\/978-3-319-66167-4_9"},{"key":"2418_CR5","unstructured":"Corporate Headquarters D-wave problem-solving handbook (2018)"},{"key":"2418_CR6","doi-asserted-by":"crossref","unstructured":"Das, A., Chakrabarti, B.K.: Quantum annealing and related optimization methods Springer Lecture Notes in Physics 679 (2005)","DOI":"10.1007\/11526216"},{"key":"2418_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1137\/0329008","volume":"29","author":"U Faigle","year":"1991","unstructured":"Faigle, U., Kern, W.: Note on the convergence of simulated annealing algorithms. SIAM J. Control Optim. 29, 153\u2013159 (1991)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"2418_CR8","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.: Some convergence results for probabilistic tabu search. ORSA J. Comput. 4(1), 32\u201337 (1992)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"2418_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2013part 1. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"2418_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search\u2013part 2. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"2418_CR11","doi-asserted-by":"crossref","unstructured":"H\u00e4ggstr\u00f6m, O.: Finite Markov chains and algorithmic applications. In: London Mathematical Society Student Texts. Cambridge University Press, Cambridge, pp. 23\u201327 (2002)","DOI":"10.1017\/CBO9780511613586"},{"key":"2418_CR12","unstructured":"Johnson, M.W.: Future hardware directions of quantum annealing. Qubits Europe 2018, D-Wave Users Conference (2018)"},{"key":"2418_CR13","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58, 5355 (1998)","journal-title":"Phys. Rev. E"},{"key":"2418_CR14","doi-asserted-by":"publisher","DOI":"10.2200\/S00585ED1V01Y201407QMC008","author":"CC McGeoch","year":"2014","unstructured":"McGeoch, C.C.: Adiabatic quantum computation and quantum annealing: theory and practice. Synth. Lect. Quantum Comput. (2014). \n                    https:\/\/doi.org\/10.2200\/S00585ED1V01Y201407QMC008","journal-title":"Synth. Lect. Quantum Comput."},{"key":"2418_CR15","doi-asserted-by":"publisher","DOI":"10.1063\/1.2995837","author":"S Morita","year":"2008","unstructured":"Morita, S., Nishimori, H.: Mathematical foundation of quantum annealing. J. Math. Phys. (2008). \n                    https:\/\/doi.org\/10.1063\/1.2995837","journal-title":"J. Math. Phys."},{"issue":"3","key":"2418_CR16","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s10589-016-9844-y","volume":"65","author":"G Rosenberg","year":"2016","unstructured":"Rosenberg, G., Vazifeh, M., Woods, B., Haber, E.: Building an iterative heuristic solver for a quantum annealer. Comput. Optim. Appl. 65(3), 845\u2013869 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"2418_CR17","unstructured":"Tran, T.T., Do, M., Rieffel, E.G., Frank, J., Wang, Z., O\u2019Gorman, B., Venturelli, D., Beck, J.C.: A hybrid quantum-classical approach to solving scheduling problems. In: Ninth Annual Symposium on Combinatorial Search (2016)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-019-2418-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-019-2418-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-019-2418-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T23:58:48Z","timestamp":1597795128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-019-2418-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,20]]},"references-count":17,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["2418"],"URL":"https:\/\/doi.org\/10.1007\/s11128-019-2418-z","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,20]]},"assertion":[{"value":"15 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"303"}}