{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T09:02:03Z","timestamp":1785142923035,"version":"3.55.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:00:00Z","timestamp":1783036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:00:00Z","timestamp":1783036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004329","name":"The Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["P0-8333"],"award-info":[{"award-number":["P0-8333"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    This paper benchmarks quantum, classical, and hybrid solvers on NP-hard Max-Cut and QUBO problems, emphasizing solution quality relative to known global optima. We evaluate D-Wave\u2019s fast annealing QPU and Hybrid solver against classical simulated annealing (SA) and Toshiba\u2019s simulated bifurcation machine (SBM) using 139 Max-Cut instances (100 to 10,000 nodes). For small instances (\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\le $$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mo>\u2264<\/mml:mo>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    250 nodes) with known global optima, Hybrid and SA consistently achieve optimal solutions, outperforming the QPU. For larger instances, SBM and slower SA yield superior solutions, while Hybrid and faster SA perform less effectively. Computation time varies across solvers.\n                  <\/jats:p>","DOI":"10.1007\/s11128-026-05263-5","type":"journal-article","created":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:28:18Z","timestamp":1783060098000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accuracy and performance evaluation of quantum, classical and hybrid solvers for the Max-Cut problem"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6193-3475","authenticated-orcid":false,"given":"Jaka","family":"Vodeb","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vid","family":"Er\u017een","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timotej","family":"Hrga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Janez","family":"Povh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,3]]},"reference":[{"issue":"7779","key":"5263_CR1","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J.C., Barends, R., Biswas, R., Boixo, S., Brandao, F.G., Buell, D.A.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019)","journal-title":"Nature"},{"issue":"5","key":"5263_CR2","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ab85b8","volume":"83","author":"P Hauke","year":"2020","unstructured":"Hauke, P., Katzgraber, H.G., Lechner, W., Nishimori, H., Oliver, W.D.: Perspectives of quantum annealing: Methods and implementations. Rep. Prog. Phys. 83(5), 054401 (2020)","journal-title":"Rep. Prog. Phys."},{"key":"5263_CR3","unstructured":"Myklebust, T.G.: Solving maximum cut problems by simulated annealing (2015). arXiv:1505.03068"},{"issue":"6","key":"5263_CR4","doi-asserted-by":"publisher","first-page":"7953","DOI":"10.1126\/sciadv.abe7953","volume":"7","author":"H Goto","year":"2021","unstructured":"Goto, H., Endo, K., Suzuki, M., Sakai, Y., Kanao, T., Hamakawa, Y., Hidaka, R., Yamasaki, M., Tatsumura, K.: High-performance combinatorial optimization based on classical mechanics. Sci. Adv. 7(6), 7953 (2021)","journal-title":"Sci. Adv."},{"issue":"2","key":"5263_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3514039","volume":"48","author":"N Gusmeroli","year":"2022","unstructured":"Gusmeroli, N., Hrga, T., Lu\u017ear, B., Povh, J., Siebenhofer, M., Wiegele, A.: Biqbin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints. ACM Trans. Math. Softw. (TOMS) 48(2), 1\u201331 (2022)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"2","key":"5263_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10589-021-00310-6","volume":"80","author":"T Hrga","year":"2021","unstructured":"Hrga, T., Povh, J.: Madam: a parallel exact solver for max-cut based on semidefinite programming and admm. Comput. Optim. Appl. 80(2), 347\u2013375 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"5263_CR7","doi-asserted-by":"publisher","first-page":"10327","DOI":"10.1038\/ncomms10327","volume":"7","author":"S Boixo","year":"2016","unstructured":"Boixo, S., Smelyanskiy, V.N., Shabani, A., Isakov, S.V., Dykman, M., Denchev, V.S., Amin, M.H., Smirnov, A.Y., Mohseni, M., Neven, H.: Computational multiqubit tunnelling in programmable quantum annealers. Nat. Commun. 7(1), 10327 (2016)","journal-title":"Nat. Commun."},{"issue":"3","key":"5263_CR8","volume":"6","author":"VS Denchev","year":"2016","unstructured":"Denchev, V.S., Boixo, S., Isakov, S.V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., Neven, H.: What is the computational value of finite-range tunneling? Phys. Rev. X 6(3), 031015 (2016)","journal-title":"Phys. Rev. X"},{"issue":"1","key":"5263_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-020-09315-0","volume":"26","author":"Y Pang","year":"2021","unstructured":"Pang, Y., Coffrin, C., Lokhov, A.Y., Vuffray, M.: The potential of quantum annealing for rapid solution structure identification. Constraints 26(1), 1\u201325 (2021)","journal-title":"Constraints"},{"key":"5263_CR10","unstructured":"Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A.Y., Misra, S., Coffrin, C.: On the emerging potential of quantum annealing hardware for combinatorial optimization (2022). arXiv:2210.04291"},{"issue":"1","key":"5263_CR11","doi-asserted-by":"publisher","first-page":"33957","DOI":"10.1038\/srep33957","volume":"6","author":"Y Cao","year":"2016","unstructured":"Cao, Y., Jiang, S., Perouli, D., Kais, S.: Solving set cover with pairs problem using quantum annealing. Sci. Rep. 6(1), 33957 (2016)","journal-title":"Sci. Rep."},{"issue":"6","key":"5263_CR12","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.88.061007","volume":"88","author":"J King","year":"2019","unstructured":"King, J., Yarkoni, S., Raymond, J., Ozfidan, I., King, A.D., Nevisi, M.M., Hilton, J.P., McGeoch, C.C.: Quantum annealing amid local ruggedness and global frustration. J. Phys. Soc. Jpn. 88(6), 061007 (2019)","journal-title":"J. Phys. Soc. Jpn."},{"issue":"2","key":"5263_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.94.022337","volume":"94","author":"S Mandra","year":"2016","unstructured":"Mandra, S., Zhu, Z., Wang, W., Perdomo-Ortiz, A., Katzgraber, H.G.: Strengths and weaknesses of weak-strong cluster problems: a detailed overview of state-of-the-art classical heuristics versus quantum approaches. Phys. Rev. A 94(2), 022337 (2016)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"5263_CR14","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.90.064001","volume":"90","author":"AS Koshikawa","year":"2021","unstructured":"Koshikawa, A.S., Ohzeki, M., Kadowaki, T., Tanaka, K.: Benchmark test of black-box optimization using d-wave quantum annealer. J. Phys. Soc. Jpn. 90(6), 064001 (2021)","journal-title":"J. Phys. Soc. Jpn."},{"issue":"1","key":"5263_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.12.014004","volume":"12","author":"A Perdomo-Ortiz","year":"2019","unstructured":"Perdomo-Ortiz, A., Feldman, A., Ozaeta, A., Isakov, S.V., Zhu, Z., O\u2019Gorman, B., Katzgraber, H.G., Diedrich, A., Neven, H., Kleer, J.: Readiness of quantum optimization machines for industrial applications. Phys. Rev. Appl. 12(1), 014004 (2019)","journal-title":"Phys. Rev. Appl."},{"issue":"4","key":"5263_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.2.040322","volume":"2","author":"MS K\u00f6nz","year":"2021","unstructured":"K\u00f6nz, M.S., Lechner, W., Katzgraber, H.G., Troyer, M.: Embedding overhead scaling of optimization problems in quantum annealing. PRX Quantum 2(4), 040322 (2021)","journal-title":"PRX Quantum"},{"issue":"1","key":"5263_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.012317","volume":"93","author":"Z Zhu","year":"2016","unstructured":"Zhu, Z., Ochoa, A.J., Schnabel, S., Hamze, F., Katzgraber, H.G.: Best-case performance of quantum annealers on native spin-glass benchmarks: how chaos can affect success probabilities. Phys. Rev. A 93(1), 012317 (2016)","journal-title":"Phys. Rev. A"},{"issue":"11","key":"5263_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.119.110502","volume":"119","author":"T Albash","year":"2017","unstructured":"Albash, T., Martin-Mayor, V., Hen, I.: Temperature scaling law for quantum annealing optimizers. Phys. Rev. Lett. 119(11), 110502 (2017)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"5263_CR19","volume":"8","author":"T Albash","year":"2018","unstructured":"Albash, T., Lidar, D.A.: Demonstration of a scaling advantage for a quantum annealer over simulated annealing. Phys. Rev. X 8(3), 031016 (2018)","journal-title":"Phys. Rev. X"},{"issue":"1","key":"5263_CR20","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1038\/s41467-021-20901-5","volume":"12","author":"AD King","year":"2021","unstructured":"King, A.D., Raymond, J., Lanting, T., Isakov, S.V., Mohseni, M., Poulin-Lamarre, G., Ejtemaee, S., Bernoudy, W., Ozfidan, I., Smirnov, A.Y.: Scaling advantage over path-integral Monte Carlo in quantum simulation of geometrically frustrated magnets. Nat. Commun. 12(1), 1113 (2021)","journal-title":"Nat. Commun."},{"issue":"11","key":"5263_CR21","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1038\/s41567-022-01741-6","volume":"18","author":"AD King","year":"2022","unstructured":"King, A.D., Suzuki, S., Raymond, J., Zucca, A., Lanting, T., Altomare, F., Berkley, A.J., Ejtemaee, S., Hoskinson, E., Huang, S.: Coherent quantum annealing in a programmable 2,000 qubit ising chain. Nat. Phys. 18(11), 1324\u20131328 (2022)","journal-title":"Nat. Phys."},{"issue":"7959","key":"5263_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1038\/s41586-023-05867-2","volume":"617","author":"AD King","year":"2023","unstructured":"King, A.D., Raymond, J., Lanting, T., Harris, R., Zucca, A., Altomare, F., Berkley, A.J., Boothby, K., Ejtemaee, S., Enderud, C.: Quantum critical dynamics in a 5,000-qubit programmable spin glass. Nature 617(7959), 61\u201366 (2023)","journal-title":"Nature"},{"key":"5263_CR23","unstructured":"King, A.D., Nocera, A., Rams, M.M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R.: Computational supremacy in quantum simulation (2024). arXiv:2403.00910"},{"issue":"9","key":"5263_CR24","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11128-021-03226-6","volume":"20","author":"CD Gonzalez Calaza","year":"2021","unstructured":"Gonzalez Calaza, C.D., Willsch, D., Michielsen, K.: Garden optimization problems for benchmarking quantum annealers. Quantum Inf. Process. 20(9), 305 (2021)","journal-title":"Quantum Inf. Process."},{"key":"5263_CR25","unstructured":"Inc, D.-W.S.: The Advantage System: Performance Update. https:\/\/www.dwavesys.com\/media\/kjtlcemb\/14-1054a-a_advantage_system_performance_update.pdf Accessed 2024-04-22"},{"key":"5263_CR26","doi-asserted-by":"crossref","unstructured":"McLeod, C.R., Sasdelli, M.: Benchmarking d-wave quantum annealers: spectral gap scaling of maximum cardinality matching problems. In: International Conference on Computational Science, pp. 150\u2013163. Springer (2022)","DOI":"10.1007\/978-3-031-08760-8_13"},{"issue":"4","key":"5263_CR27","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11128-022-03476-y","volume":"21","author":"D Willsch","year":"2022","unstructured":"Willsch, D., Willsch, M., Gonzalez Calaza, C.D., Jin, F., De Raedt, H., Svensson, M., Michielsen, K.: Benchmarking advantage and d-wave 2000q quantum annealers with exact cover problems. Quantum Inf. Process. 21(4), 141 (2022)","journal-title":"Quantum Inf. Process."},{"issue":"2","key":"5263_CR28","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac4d1b","volume":"7","author":"M Kowalsky","year":"2022","unstructured":"Kowalsky, M., Albash, T., Hen, I., Lidar, D.A.: 3-regular three-xorsat planted solutions benchmark of classical and quantum heuristic optimizers. Quantum Sci. Technol. 7(2), 025008 (2022)","journal-title":"Quantum Sci. Technol."},{"issue":"7","key":"5263_CR29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.118.070502","volume":"118","author":"S Mandra","year":"2017","unstructured":"Mandra, S., Zhu, Z., Katzgraber, H.G.: Exponentially biased ground-state sampling of quantum annealing machines with transverse-field driving hamiltonians. Phys. Rev. Lett. 118(7), 070502 (2017)","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"5263_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.063314","volume":"99","author":"Z Zhu","year":"2019","unstructured":"Zhu, Z., Ochoa, A.J., Katzgraber, H.G.: Fair sampling of ground-state configurations of binary optimization problems. Phys. Rev. E 99(6), 063314 (2019)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"5263_CR31","doi-asserted-by":"publisher","first-page":"0823","DOI":"10.1126\/sciadv.aau0823","volume":"5","author":"R Hamerly","year":"2019","unstructured":"Hamerly, R., Inagaki, T., McMahon, P.L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T.: Experimental investigation of performance differences between coherent ising machines and a quantum annealer. Sci. Adv. 5(5), 0823 (2019)","journal-title":"Sci. Adv."},{"issue":"1","key":"5263_CR32","doi-asserted-by":"publisher","first-page":"22858","DOI":"10.1038\/s41598-023-49966-6","volume":"13","author":"A Sharma","year":"2023","unstructured":"Sharma, A., Burns, M., Hahn, A., Huang, M.: Augmenting an electronic ising machine to effectively solve boolean satisfiability. Sci. Rep. 13(1), 22858 (2023)","journal-title":"Sci. Rep."},{"key":"5263_CR33","doi-asserted-by":"crossref","unstructured":"Pelofske, E., Hahn, G., Djidjev, H.: Increasing the hardness of posiform planting using random qubos for programmable quantum annealer benchmarking (2024). arXiv:2411.03626","DOI":"10.1038\/s44335-025-00032-6"},{"issue":"5","key":"5263_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.23.054049","volume":"23","author":"AM Dziubyna","year":"2025","unstructured":"Dziubyna, A.M., \u015amierzchalski, T., Gardas, B., Rams, M.M., Mohseni, M.: Limitations of tensor-network approaches for optimization and sampling: a comparison to quantum and classical ising machines. Phys. Rev. Appl. 23(5), 054049 (2025)","journal-title":"Phys. Rev. Appl."},{"issue":"3","key":"5263_CR35","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aab6ba","volume":"3","author":"HG Katzgraber","year":"2018","unstructured":"Katzgraber, H.G.: Viewing vanilla quantum annealing through spin glasses. Quantum Sci. Technol. 3(3), 030505 (2018)","journal-title":"Quantum Sci. Technol."},{"key":"5263_CR36","doi-asserted-by":"crossref","unstructured":"Montanez-Barrera, J., Heuvel, P., Willsch, D., Michielsen, K.: Improving performance in combinatorial optimization problems with inequality constraints: an evaluation of the unbalanced penalization method on d-wave advantage. In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 535\u2013542. IEEE (2023)","DOI":"10.1109\/QCE57702.2023.00067"},{"issue":"7716","key":"5263_CR37","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/s41586-018-0361-2","volume":"560","author":"A Radovic","year":"2018","unstructured":"Radovic, A., Williams, M., Rousseau, D., Kagan, M., Bonacorsi, D., Himmel, A., Aurisano, A., Terao, K., Wongjirad, T.: Machine learning at the energy and intensity frontiers of particle physics. Nature 560(7716), 41\u201348 (2018)","journal-title":"Nature"},{"issue":"6","key":"5263_CR38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.102.062405","volume":"102","author":"A Zlokapa","year":"2020","unstructured":"Zlokapa, A., Mott, A., Job, J., Vlimant, J.-R., Lidar, D., Spiropulu, M.: Quantum adiabatic machine learning by zooming into a region of the energy surface. Phys. Rev. A 102(6), 062405 (2020)","journal-title":"Phys. Rev. A"},{"key":"5263_CR39","doi-asserted-by":"publisher","unstructured":"Er\u017een, V., Hrga, T., Povh, J., Vodeb, J.: Max-Cut Benchmark Dataset. https:\/\/doi.org\/10.5281\/zenodo.14290290","DOI":"10.5281\/zenodo.14290290"},{"key":"5263_CR40","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Springer, Berlin (2010)"},{"issue":"3","key":"5263_CR41","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona, F., Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493\u2013513 (1988)","journal-title":"Oper. Res."},{"key":"5263_CR42","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Calculating exact ground states of spin glasses: A polyhedral approach. In: Heidelberg Colloquium on Glassy Dynamics: Proceedings of a Colloquium on Spin Glasses, Optimization and Neural Networks Held at the University of Heidelberg June 9\u201313, 1986, pp. 325\u2013353 (1987). Springer","DOI":"10.1007\/BFb0057526"},{"key":"5263_CR43","unstructured":"Liers, F.: Contributions to determining exact ground-states of ising spin-glasses and to their physics, Universit\u00e4t zu K\u00f6ln (2004). (PhD thesis)"},{"issue":"3","key":"5263_CR44","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(3), 608\u2013624 (2018)","journal-title":"INFORMS J. Comput."},{"key":"5263_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3459606","volume":"26","author":"M J\u00fcnger","year":"2021","unstructured":"J\u00fcnger, M., Lobe, E., Mutzel, P., Reinelt, G., Rendl, F., Rinaldi, G., Stollenwerk, T.: Quantum annealing versus digital computing: an experimental comparison. J. Exp. Algorithm. (JEA) 26, 1\u201330 (2021)","journal-title":"J. Exp. Algorithm. (JEA)"},{"issue":"6","key":"5263_CR46","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 (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"5263_CR47","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for max-cut and other 2-variable csps? SIAM J. Comput. 37(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5263_CR48","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M., Reinelt, G.: Experiments in quadratic 0\u20131 programming. Math. Program. 44(1), 127\u2013137 (1989)","journal-title":"Math. Program."},{"issue":"4598","key":"5263_CR49","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"5263_CR50","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u1ef3","year":"1985","unstructured":"\u010cern\u1ef3, V.: Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45, 41\u201351 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"5263_CR51","unstructured":"Wiegele, A.: Biq mac library\u2014a collection of max-cut and quadratic 0-1 programming instances of medium size. Preprint (2007)"},{"key":"5263_CR52","unstructured":"Wiegele, A.: BiqMac Library. http:\/\/biqmac.aau.at\/biqmaclib.html (2007)"},{"issue":"3","key":"5263_CR53","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05263-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-026-05263-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-026-05263-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T08:11:21Z","timestamp":1785139881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-026-05263-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,3]]},"references-count":53,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2026,7]]}},"alternative-id":["5263"],"URL":"https:\/\/doi.org\/10.1007\/s11128-026-05263-5","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,3]]},"assertion":[{"value":"8 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2026","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","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"240"}}