{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:29:25Z","timestamp":1770820165272,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["21-71-10135"],"award-info":[{"award-number":["21-71-10135"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-03943-0","type":"journal-article","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T21:50:12Z","timestamp":1683755412000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evaluating the convergence of tabu enhanced hybrid quantum optimization"],"prefix":"10.1007","volume":"22","author":[{"given":"Enrico","family":"Blanzieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Pastorello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valter","family":"Cavecchia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2364-5939","authenticated-orcid":false,"given":"Alexander","family":"Rumyantsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariia","family":"Maltseva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,9]]},"reference":[{"key":"3943_CR1","first-page":"678","volume-title":"Quantum Computation and Quantum Information, 10th Anniversary","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 10th Anniversary, p. 678. Cambridge University Press, Cambridge, New York (2010)"},{"issue":"2","key":"3943_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-02518-1","volume":"5","author":"CC McGeoch","year":"2014","unstructured":"McGeoch, C.C.: Adiabatic quantum computation and quantum annealing: theory and practice. Synth. Lect. Quantum Comput. 5(2), 1\u201393 (2014)","journal-title":"Synth. Lect. Quantum Comput."},{"issue":"3","key":"3943_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1214\/16-STS560","volume":"31","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Wu, S., Zou, J.: Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers. Stat. Sci. 31(3), 298\u2013362 (2016). https:\/\/doi.org\/10.1214\/16-STS560","journal-title":"Stat. Sci."},{"issue":"2","key":"3943_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1080\/00107514.2018.1450720","volume":"59","author":"SE Venegas-Andraca","year":"2018","unstructured":"Venegas-Andraca, S.E., Cruz-Santos, W., McGeoch, C., Lanzagorta, M.: A cross-disciplinary introduction to quantum annealing-based algorithms. Contemp. Phys 59(2), 174\u2013197 (2018). https:\/\/doi.org\/10.1080\/00107514.2018.1450720","journal-title":"Contemp. Phys"},{"issue":"5","key":"3943_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.102.052414","volume":"102","author":"L Gentini","year":"2020","unstructured":"Gentini, L., Cuccoli, A., Pirandola, S., Verrucchi, P., Banchi, L.: Noise-resilient variational hybrid quantum-classical optimization. Phys. Rev. A 102(5), 052414 (2020). https:\/\/doi.org\/10.1103\/PhysRevA.102.052414","journal-title":"Phys. Rev. A"},{"issue":"3","key":"3943_CR6","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.90.032001","volume":"90","author":"S Endo","year":"2021","unstructured":"Endo, S., Cai, Z., Benjamin, S.C., Yuan, X.: Hybrid quantum-classical algorithms and quantum error mitigation. J. Phys. Soc. Jpn. 90(3), 032001 (2021). https:\/\/doi.org\/10.7566\/JPSJ.90.032001","journal-title":"J. Phys. Soc. Jpn."},{"key":"3943_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.22331\/q-2020-08-31-314","volume":"4","author":"R Sweke","year":"2020","unstructured":"Sweke, R., Wilde, F., Meyer, J., Schuld, M., Faehrmann, P.K., Meynard-Piganeau, B., Eisert, J.: Stochastic gradient descent for hybrid quantum-classical optimization. Quantum 4, 314 (2020)","journal-title":"Quantum"},{"issue":"11","key":"3943_CR8","doi-asserted-by":"publisher","first-page":"873","DOI":"10.3390\/en9110873","volume":"9","author":"C-W Lee","year":"2016","unstructured":"Lee, C.-W., Lin, B.-Y.: Application of hybrid quantum Tabu search with support vector regression (SVR) for load forecasting. Energies 9(11), 873 (2016). https:\/\/doi.org\/10.3390\/en9110873","journal-title":"Energies"},{"issue":"10","key":"3943_CR9","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.: Quantum annealing learning search for solving qubo problems. Quantum Inf. Process. 18(10), 303 (2019). https:\/\/doi.org\/10.1007\/s11128-019-2418-z","journal-title":"Quantum Inf. Process."},{"key":"3943_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s42484-020-00030-w","author":"D Pastorello","year":"2021","unstructured":"Pastorello, D., Blanzieri, E., Cavecchia, V.: Learning adiabatic quantum algorithms over optimization problems. Quantum Mach. Intell. (2021). https:\/\/doi.org\/10.1007\/s42484-020-00030-w","journal-title":"Quantum Mach. Intell."},{"issue":"45","key":"3943_CR11","doi-asserted-by":"publisher","first-page":"13903","DOI":"10.1088\/0305-4470\/39\/45\/004","volume":"39","author":"S Morita","year":"2006","unstructured":"Morita, S., Nishimori, H.: Convergence theorems for quantum annealing. J. Phys. A Math. Gen. 39(45), 13903\u201313920 (2006). https:\/\/doi.org\/10.1088\/0305-4470\/39\/45\/004","journal-title":"J. Phys. A Math. Gen."},{"key":"3943_CR12","unstructured":"Apers, S., Gily\u00e9n, A., Jeffery, S.: A unified framework of quantum walk search, 13 (2021)"},{"key":"3943_CR13","doi-asserted-by":"publisher","unstructured":"Santos, R.A.M., Portugal, R.: Quantum hitting time on the complete graph. arXiv:0912.1217 [quant-ph] (2009). https:\/\/doi.org\/10.1142\/S0219749910006605. Accessed 2021-10-04","DOI":"10.1142\/S0219749910006605"},{"issue":"1\u20132","key":"3943_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00453-011-9521-6","volume":"63","author":"F Magniez","year":"2012","unstructured":"Magniez, F., Nayak, A., Richter, P.C., Santha, M.: On the hitting times of quantum versus random walks. Algorithmica 63(1\u20132), 91\u2013116 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9521-6","journal-title":"Algorithmica"},{"issue":"3","key":"3943_CR15","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/aa99c7","volume":"51","author":"R Balu","year":"2018","unstructured":"Balu, R., Liu, C., Venegas-Andraca, S.E.: Probability distributions for Markov chains based quantum walks. J. Phys. A Math. Theor. 51(3), 035301 (2018). https:\/\/doi.org\/10.1088\/1751-8121\/aa99c7","journal-title":"J. Phys. A Math. Theor."},{"issue":"1","key":"3943_CR16","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). https:\/\/doi.org\/10.1287\/ijoc.4.1.32","journal-title":"ORSA J. Comput."},{"issue":"1","key":"3943_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(01)00263-3","volume":"119","author":"F Glover","year":"2002","unstructured":"Glover, F.: Tabu search and finite convergence. Discret. Appl. Math. 119(1), 3\u201336 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00263-3","journal-title":"Discret. Appl. Math."},{"key":"3943_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/0-306-48056-5_10","volume-title":"Handbook of Metaheuristics","author":"D Henderson","year":"2003","unstructured":"Henderson, D., Jacobson, S.H., Johnson, A.W.: The theory and practice of simulated annealing. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 287\u2013319. Springer, Boston, MA (2003)"},{"issue":"2","key":"3943_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02022562","volume":"41","author":"BL Fox","year":"1993","unstructured":"Fox, B.L.: Integrating and accelerating tabu search, simulated annealing, and genetic algorithms. Ann. Oper. Res. 41(2), 47\u201367 (1993). https:\/\/doi.org\/10.1007\/BF02022562","journal-title":"Ann. Oper. Res."},{"key":"3943_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61601-4","volume-title":"Quantum Computing for the Quantum Curious","author":"C Hughes","year":"2021","unstructured":"Hughes, C., Isaacson, J., Perry, A., Sun, R.F., Turner, J.: Quantum Computing for the Quantum Curious. Springer, Cham (2021)"},{"key":"3943_CR21","doi-asserted-by":"publisher","unstructured":"Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 42\u201351 (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.8","DOI":"10.1109\/FOCS.2004.8"},{"key":"3943_CR22","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum Computation by Adiabatic Evolution (2000)"},{"issue":"10","key":"3943_CR23","doi-asserted-by":"publisher","DOI":"10.1063\/1.2798382","volume":"48","author":"S Jansen","year":"2007","unstructured":"Jansen, S., Ruskai, M.-B., Seiler, R.: Bounds for the adiabatic approximation with applications to quantum computation. J. Math. Phys. 48(10), 102111 (2007). https:\/\/doi.org\/10.1063\/1.2798382","journal-title":"J. Math. Phys."},{"key":"3943_CR24","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\u20135363 (1998). https:\/\/doi.org\/10.1103\/PhysRevE.58.5355","journal-title":"Phys. Rev. E"},{"issue":"1\u20132","key":"3943_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(01)00264-5","volume":"119","author":"AW Johnson","year":"2002","unstructured":"Johnson, A.W., Jacobson, S.H.: On the convergence of generalized hill climbing algorithms. Discret. Appl. Math. 119(1\u20132), 37\u201357 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00264-5","journal-title":"Discret. Appl. Math."},{"key":"3943_CR26","volume-title":"The Art of Computer Programming. Addison-Wesley Series in Computer Science and Information Processing","author":"DE Knuth","year":"2011","unstructured":"Knuth, D.E.: The Art of Computer Programming. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley Publishing Company, Boston, MA (2011)"},{"key":"3943_CR27","volume-title":"Applied Probability and Queues. Stochastic Modelling and Applied Probability","author":"S Asmussen","year":"2003","unstructured":"Asmussen, S.: Applied Probability and Queues. Stochastic Modelling and Applied Probability. Springer, New York (2003)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-03943-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-03943-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-03943-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T15:16:26Z","timestamp":1686410186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-03943-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,9]]},"references-count":27,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["3943"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-03943-0","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,9]]},"assertion":[{"value":"16 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2023","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 have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"205"}}