{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,4]],"date-time":"2026-11-04T23:53:14Z","timestamp":1793836394770,"version":"4.6.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T00:00:00Z","timestamp":1744502400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T00:00:00Z","timestamp":1744502400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NTNU Norwegian University of Science and Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Quantum computing is rapidly advancing, harnessing the power of qubits\u2019 superposition and entanglement for computational advantages over classical systems. However, scalability poses a primary challenge for these machines. By implementing a hybrid workflow between classical and quantum computing instances, D-Wave has succeeded in pushing this boundary to the realm of industrial use. Furthermore, they have recently opened up to mixed integer linear programming (MILP) problems, expanding their applicability to many relevant problems in the field of optimisation. However, the extent of their suitability for diverse problem categories and their computational advantages remains unclear. This study conducts a comprehensive examination by applying a selection of diverse case studies to benchmark the performance of D-Wave\u2019s hybrid solver against that of industry-leading solvers such as CPLEX, Gurobi, and IPOPT. The findings indicate that D-Wave\u2019s hybrid solver is currently most advantageous for integer quadratic objective functions and shows potential for quadratic constraints. To illustrate this, we applied it to a real-world energy problem, specifically the MILP unit commitment problem. While D-Wave can solve such problems, its performance has not yet matched that of its classical counterparts.<\/jats:p>","DOI":"10.1038\/s41598-025-96220-2","type":"journal-article","created":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T11:38:56Z","timestamp":1744544336000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers"],"prefix":"10.1038","volume":"15","author":[{"given":"Finley Alexander","family":"Quinton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Per Arne Sevle","family":"Myhr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mostafa","family":"Barani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pedro","family":"Crespo del Granado","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongyu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,13]]},"reference":[{"key":"96220_CR1","doi-asserted-by":"publisher","first-page":"2100061","DOI":"10.1002\/qute.202100061","volume":"4","author":"GJ Mooney","year":"2021","unstructured":"Mooney, G. J., White, G. A., Hill, C. D. & Hollenberg, L. C. Whole-device entanglement in a 65-qubit superconducting quantum computer. Adv. Quantum Technol. 4, 2100061. https:\/\/doi.org\/10.1002\/qute.202100061 (2021).","journal-title":"Adv. Quantum Technol."},{"key":"96220_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505\u2013510. https:\/\/doi.org\/10.1038\/s41586-019-1666-5 (2019).","journal-title":"Nature"},{"key":"96220_CR3","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1038\/s41586-024-08445-2","volume":"638","author":"MA Quantum","year":"2025","unstructured":"Quantum, M. A. et al. Interferometric single-shot parity measurement in inas-al hybrid devices. Nature 638, 651\u2013655 (2025).","journal-title":"Nature"},{"key":"96220_CR4","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R. P. Simulating physics with computers. Int. J. Theor. Phys. 21, 467\u2013488. https:\/\/doi.org\/10.1007\/BF02650179 (1982).","journal-title":"Int. J. Theor. Phys."},{"key":"96220_CR5","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/BF01011339","volume":"22","author":"P Benioff","year":"1980","unstructured":"Benioff, P. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by turing machines. J. Stat. Phys. 22, 563\u2013591. https:\/\/doi.org\/10.1007\/BF01011339 (1980).","journal-title":"J. Stat. Phys."},{"key":"96220_CR6","doi-asserted-by":"publisher","first-page":"3408","DOI":"10.1103\/PhysRevLett.80.3408","volume":"80","author":"I Chuang","year":"1998","unstructured":"Chuang, I., Gershenfeld, N. & Kubinec, M. Experimental implementation of fast quantum searching. Phys. Rev. Lett. 80, 3408\u20133411. https:\/\/doi.org\/10.1103\/PhysRevLett.80.3408 (1998).","journal-title":"Phys. Rev. Lett."},{"key":"96220_CR7","doi-asserted-by":"publisher","first-page":"140501","DOI":"10.1103\/PhysRevLett.106.140501","volume":"106","author":"L Banchi","year":"2011","unstructured":"Banchi, L., Bayat, A., Verrucchi, P. & Bose, S. Nonperturbative entangling gates between distant qubits using uniform cold atom chains. Phys. Rev. Lett. 106, 140501. https:\/\/doi.org\/10.1103\/PhysRevLett.106.140501 (2011).","journal-title":"Phys. Rev. Lett."},{"key":"96220_CR8","doi-asserted-by":"publisher","DOI":"10.1063\/1.5088164","author":"CD Bruzewicz","year":"2019","unstructured":"Bruzewicz, C. D., Chiaverini, J., McConnell, R. & Sage, J. M. Trapped-ion quantum computing: Progress and challenges. Appl. Phys. Rev. https:\/\/doi.org\/10.1063\/1.5088164 (2019).","journal-title":"Appl. Phys. Rev."},{"key":"96220_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1103\/RevModPhys.79.135","volume":"79","author":"P Kok","year":"2007","unstructured":"Kok, P. et al. Linear optical quantum computing with photonic qubits. Rev. Modern Phys. 79, 135. https:\/\/doi.org\/10.1103\/RevModPhys.79.135 (2007).","journal-title":"Rev. Modern Phys."},{"key":"96220_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1146\/annurev-conmatphys-030212-184248","volume":"4","author":"C Kloeffel","year":"2013","unstructured":"Kloeffel, C. & Loss, D. Prospects for spin-based quantum computing in quantum dots. Annu. Rev. Condens. Matter. Phys. 4, 51\u201381. https:\/\/doi.org\/10.1146\/annurev-conmatphys-030212-184248 (2013).","journal-title":"Annu. Rev. Condens. Matter. Phys."},{"key":"96220_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1038\/nature08812","volume":"464","author":"TD Ladd","year":"2010","unstructured":"Ladd, T. D. et al. Quantum computers. Nature 464, 45\u201353. https:\/\/doi.org\/10.1038\/nature08812 (2010).","journal-title":"Nature"},{"key":"96220_CR12","volume-title":"Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice","author":"CC McGeoch","year":"2022","unstructured":"McGeoch, C. C. Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice (Springer,  2022)."},{"key":"96220_CR13","doi-asserted-by":"publisher","unstructured":"Devoret, M. H., Wallraff, A. & Martinis, J. M. Superconducting Qubits: A Short Review. https:\/\/doi.org\/10.48550\/arXiv.cond-mat\/0411174 (2004).","DOI":"10.48550\/arXiv.cond-mat\/0411174"},{"key":"96220_CR14","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/s0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P. W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484\u20131509. https:\/\/doi.org\/10.1137\/s0097539795293172 (1997).","journal-title":"SIAM J. Comput."},{"key":"96220_CR15","doi-asserted-by":"publisher","unstructured":"Cleve, R. & Watrous, J. Fast parallel circuits for the quantum Fourier transform. In Proceedings 41st Annual Symposium on Foundations of Computer Science, 526\u2013536. https:\/\/doi.org\/10.1109\/SFCS.2000.892140 (2000).","DOI":"10.1109\/SFCS.2000.892140"},{"key":"96220_CR16","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1038\/s41586-022-04940-6","volume":"607","author":"AJ Daley","year":"2022","unstructured":"Daley, A. J. et al. Practical quantum advantage in quantum simulation. Nature 607, 667\u2013676. https:\/\/doi.org\/10.1038\/s41586-022-04940-6 (2022).","journal-title":"Nature"},{"key":"96220_CR17","doi-asserted-by":"publisher","first-page":"3007","DOI":"10.1038\/s41467-019-10988-2","volume":"10","author":"HR Grimsley","year":"2019","unstructured":"Grimsley, H. R., Economou, S. E., Barnes, E. & Mayhall, N. J. An adaptive variational algorithm for exact molecular simulations on a quantum computer. Nat. Commun. 10, 3007. https:\/\/doi.org\/10.1038\/s41467-019-10988-2 (2019).","journal-title":"Nat. Commun."},{"key":"96220_CR18","doi-asserted-by":"publisher","unstructured":"Chatterjee, Y., Bourreau, E. & Ran\u010di\u0107, M.\u00a0J. Solving various np-hard problems using exponentially fewer qubits on a quantum computer. https:\/\/doi.org\/10.48550\/arXiv.2301.06978 (2023).","DOI":"10.48550\/arXiv.2301.06978"},{"key":"96220_CR19","doi-asserted-by":"publisher","DOI":"10.3389\/frqst.2023.1128576","author":"R Au-Yeung","year":"2023","unstructured":"Au-Yeung, R., Chancellor, N. & Halffmann, P. Np-hard but no longer hard to solve? Using quantum computing to tackle optimization problems. Front. Quantum Sci. Technol. https:\/\/doi.org\/10.3389\/frqst.2023.1128576 (2023).","journal-title":"Front. Quantum Sci. Technol."},{"key":"96220_CR20","doi-asserted-by":"publisher","unstructured":"Van Dam, W., Mosca, M. & Vazirani, U. How powerful is adiabatic quantum computation? In Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 279\u2013287. https:\/\/doi.org\/10.1109\/SFCS.2001.959902(2001).","DOI":"10.1109\/SFCS.2001.959902"},{"key":"96220_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2021.3049230","volume":"2","author":"S Harwood","year":"2021","unstructured":"Harwood, S. et al. Formulating and solving routing problems on quantum computers. IEEE Trans. Quantum Eng. 2, 1\u201317. https:\/\/doi.org\/10.1109\/TQE.2021.3049230 (2021).","journal-title":"IEEE Trans. Quantum Eng."},{"key":"96220_CR22","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1103\/PhysRevLett.51.2167","volume":"51","author":"B Simon","year":"1983","unstructured":"Simon, B. Holonomy, the quantum adiabatic theorem, and berry\u2019s phase. Phys. Rev. Lett. 51, 2167. https:\/\/doi.org\/10.1103\/PhysRevLett.51.2167 (1983).","journal-title":"Phys. Rev. Lett."},{"key":"96220_CR23","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/ijoc.2023.1268","volume":"35","author":"O Parekh","year":"2023","unstructured":"Parekh, O. Synergies between operations research and quantum information science. INFORMS J. Comput. 35, 266\u2013273. https:\/\/doi.org\/10.1287\/ijoc.2023.1268 (2023).","journal-title":"INFORMS J. Comput."},{"key":"96220_CR24","doi-asserted-by":"publisher","unstructured":"Abbas, A. et al. Quantum optimization: Potential, challenges, and the path forward. https:\/\/doi.org\/10.48550\/arXiv.2312.02279 (2023).","DOI":"10.48550\/arXiv.2312.02279"},{"key":"96220_CR25","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2017.05.014","volume":"87","author":"A Syrichas","year":"2017","unstructured":"Syrichas, A. & Crispin, A. Large-scale vehicle routing problems: Quantum annealing, tunings and results. Comput. Oper. Res. 87, 52\u201362. https:\/\/doi.org\/10.1016\/j.cor.2017.05.014 (2017).","journal-title":"Comput. Oper. Res."},{"key":"96220_CR26","doi-asserted-by":"publisher","first-page":"e17651","DOI":"10.1002\/aic.17651","volume":"68","author":"DE Bernal","year":"2022","unstructured":"Bernal, D. E. et al. Perspectives of quantum computing for chemical engineering. AIChE J. 68, e17651. https:\/\/doi.org\/10.1002\/aic.17651 (2022).","journal-title":"AIChE J."},{"key":"96220_CR27","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, 845\u2013869. https:\/\/doi.org\/10.1007\/s10589-016-9844-y (2016).","journal-title":"Comput. Optim. Appl."},{"key":"96220_CR28","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ejor.2017.08.025","volume":"265","author":"F Glover","year":"2018","unstructured":"Glover, F., Lewis, M. & Kochenberger, G. Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems. Eur. Oper. Res. 265, 829\u2013842. https:\/\/doi.org\/10.1016\/j.ejor.2017.08.025 (2018).","journal-title":"Eur. Oper. Res."},{"key":"96220_CR29","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.cor.2009.07.002","volume":"37","author":"J Gu","year":"2010","unstructured":"Gu, J., Gu, M., Cao, C. & Gu, X. A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem. Comput. Oper. Res. 37, 927\u2013937. https:\/\/doi.org\/10.1016\/j.cor.2009.07.002 (2010).","journal-title":"Comput. Oper. Res."},{"key":"96220_CR30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2341","author":"G Nannicini","year":"2022","unstructured":"Nannicini, G. Fast quantum subroutines for the simplex method. Oper. Res. https:\/\/doi.org\/10.1287\/opre.2022.2341 (2022).","journal-title":"Oper. Res."},{"key":"96220_CR31","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejor.2010.05.039","volume":"207","author":"Y Liu","year":"2010","unstructured":"Liu, Y. & Koehler, G. J. Using modifications to Grover\u2019s search algorithm for quantum global optimization. Eur. J. Oper. Res. 207, 620\u2013632. https:\/\/doi.org\/10.1016\/j.ejor.2010.05.039 (2010).","journal-title":"Eur. J. Oper. Res."},{"key":"96220_CR32","doi-asserted-by":"publisher","unstructured":"Koniorczyk, M., Krawiec, K., Botelho, L., Be\u0161inovi\u0107, N. & Domino, K. Solving rescheduling problems in heterogeneous urban railway networks using hybrid quantum-classical approach. https:\/\/doi.org\/10.48550\/arXiv.2309.0676 (2023).","DOI":"10.48550\/arXiv.2309.0676"},{"key":"96220_CR33","doi-asserted-by":"publisher","first-page":"29","DOI":"10.3389\/fict.2017.00029","volume":"4","author":"F Neukart","year":"2017","unstructured":"Neukart, F. et al. Traffic flow optimization using a quantum annealer. Front. ICT 4, 29. https:\/\/doi.org\/10.3389\/fict.2017.00029 (2017).","journal-title":"Front. ICT"},{"key":"96220_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.4.013006","author":"S Mugel","year":"2022","unstructured":"Mugel, S. et al. Dynamic portfolio optimization with real datasets using quantum processors and quantum-inspired tensor networks. Phys. Rev. Res. https:\/\/doi.org\/10.1103\/physrevresearch.4.013006 (2022).","journal-title":"Phys. Rev. Res."},{"key":"96220_CR35","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ac8c54","author":"S Yarkoni","year":"2022","unstructured":"Yarkoni, S., Raponi, E., B\u00e4ck, T. & Schmitt, S. Quantum annealing for industry applications: Introduction and review. Rep. Progress Phys. https:\/\/doi.org\/10.1088\/1361-6633\/ac8c54 (2022).","journal-title":"Rep. Progress Phys."},{"key":"96220_CR36","unstructured":"Mohseni, N. et al. A competitive showcase of quantum versus classical algorithms in energy coalition formation. arXiv:2405.11917 (2024)."},{"key":"96220_CR37","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover, F. Tabu search: A tutorial. Interfaces 20, 74\u201394. https:\/\/doi.org\/10.1287\/inte.20.4.74 (1990).","journal-title":"Interfaces"},{"key":"96220_CR38","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, 671\u2013680. https:\/\/doi.org\/10.1126\/science.220.4598.671 (1983).","journal-title":"Science"},{"key":"96220_CR39","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. arXiv:1411.4028 (2014)."},{"key":"96220_CR40","unstructured":"McGeoch, C. & Farr\u00e9, P. An overview (D-Wave Systems Inc., Burnaby, BC, Canada, Tech. Rep, The d-wave advantage system, 2020)."},{"key":"96220_CR41","unstructured":"Cplex, IBM ILOG. IBM ILOG CPLEX Optimization Studio 22.1.0. https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.0?topic=documentation-introducing-ilog-cplex-optimization-studio-2210 (2022)."},{"key":"96220_CR42","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer 10.0 documentation. https:\/\/www.gurobi.com\/documentation\/10.0\/ (2022)."},{"key":"96220_CR43","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A. & Biegler, L. T. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357. https:\/\/doi.org\/10.1007\/s10107-004-0559-y (2006).","journal-title":"Math. Program."},{"key":"96220_CR44","unstructured":"D-Wave Systems Inc. D-Wave Hybrid Solver Service: An Overview. https:\/\/www.dwavesys.com\/resources\/white-paper\/d-wave-hybrid-solver-service-an-overview\/ (2020)."},{"key":"96220_CR45","unstructured":"D-Wave Systems Inc. Hybrid Solvers for Quadratic Optimization. https:\/\/www.dwavesys.com\/media\/soxph512\/hybrid-solvers-for-quadratic-optimization.pdf (2022)."},{"key":"96220_CR46","doi-asserted-by":"publisher","first-page":"4350","DOI":"10.1021\/nn103584t","volume":"5","author":"Z-H Sheng","year":"2011","unstructured":"Sheng, Z.-H. et al. Catalyst-free synthesis of nitrogen-doped graphene via thermal annealing graphite oxide with melamine and its excellent electrocatalysis. ACS Nano 5, 4350\u20134358. https:\/\/doi.org\/10.1021\/nn103584t (2011).","journal-title":"ACS Nano"},{"key":"96220_CR47","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. https:\/\/doi.org\/10.1103\/PhysRevE.58.5355 (1998).","journal-title":"Phys. Rev. E"},{"key":"96220_CR48","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1103\/PhysRev.28.1049","volume":"28","author":"E Schr\u00f6dinger","year":"1926","unstructured":"Schr\u00f6dinger, E. An undulatory theory of the mechanics of atoms and molecules. Phys. Rev. 28, 1049\u20131070. https:\/\/doi.org\/10.1103\/PhysRev.28.1049 (1926).","journal-title":"Phys. Rev."},{"key":"96220_CR49","unstructured":"D-Wave Systems Inc. Ocean Software Suite. https:\/\/docs.ocean.dwavesys.com\/en\/stable\/ (2023)."},{"key":"96220_CR50","doi-asserted-by":"publisher","unstructured":"Boothby, K., Bunyk, P., Raymond, J. & Roy, A. Next-generation topology of d-wave quantum processors. https:\/\/doi.org\/10.48550\/arXiv.2003.00133 (2020).","DOI":"10.48550\/arXiv.2003.00133"},{"key":"96220_CR51","doi-asserted-by":"publisher","first-page":"18628","DOI":"10.1038\/srep18628","volume":"6","author":"A Perdomo-Ortiz","year":"2016","unstructured":"Perdomo-Ortiz, A., O\u2019Gorman, B., Fluegemann, J., Biswas, R. & Smelyanskiy, V. N. Determination and correction of persistent biases in quantum annealers. Sci. Rep. 6, 18628 (2016).","journal-title":"Sci. Rep."},{"key":"96220_CR52","unstructured":"Amin, M.\u00a0H. et al. Quantum error mitigation in quantum annealing. arXiv:2311.01306 (2023)."},{"key":"96220_CR53","doi-asserted-by":"publisher","first-page":"021008","DOI":"10.1103\/PhysRevX.4.021008","volume":"4","author":"HG Katzgraber","year":"2014","unstructured":"Katzgraber, H. G., Hamze, F. & Andrist, R. S. Glassy chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines. Phys. Rev. X 4, 021008. https:\/\/doi.org\/10.1103\/PhysRevX.4.021008 (2014).","journal-title":"Phys. Rev. X"},{"key":"96220_CR54","unstructured":"Boothby, K., King, A.\u00a0D. & Raymond, J. Zephyr topology of d-wave quantum processors. https:\/\/www.dwavesys.com\/media\/2uznec4s\/14-1056a-a_zephyr_topology_of_d-wave_quantum_processors.pdf (2021)."},{"key":"96220_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher, M. L. The Lagrangian relaxation method for solving integer programming problems. Manag. Sci 27, 1\u201318. https:\/\/doi.org\/10.1287\/mnsc.27.1.1 (1981).","journal-title":"Manag. Sci"},{"key":"96220_CR56","volume-title":"Introduction to Operations Research","author":"FS Hillier","year":"2001","unstructured":"Hillier, F. S. Introduction to Operations Research (McGraw Hill, 2001)."},{"key":"96220_CR57","doi-asserted-by":"publisher","first-page":"730685","DOI":"10.3389\/fphy.2021.730685","volume":"9","author":"S Yu","year":"2021","unstructured":"Yu, S. & Nabil, T. Applying the Hubbard\u2013Stratonovich transformation to solve scheduling problems under inequality constraints with quantum annealing. Front. Phys. 9, 730685. https:\/\/doi.org\/10.3389\/fphy.2021.730685 (2021).","journal-title":"Front. Phys."},{"key":"96220_CR58","doi-asserted-by":"publisher","unstructured":"Yarkoni, S. et al. Solving the shipment rerouting problem with quantum optimization techniques. In Mes, M., Lalla-Ruiz, E. & Vo\u00df, S. (eds.) Computational Logistics, 502\u2013517. https:\/\/doi.org\/10.1007\/978-3-030-87672-2_33 (2021).","DOI":"10.1007\/978-3-030-87672-2_33"},{"key":"96220_CR59","doi-asserted-by":"publisher","unstructured":"Ottaviani, D. & Amendola, A. Low rank non-negative matrix factorization with d-wave 2000q. https:\/\/doi.org\/10.48550\/arXiv.1808.08721 (2018).","DOI":"10.48550\/arXiv.1808.08721"},{"key":"96220_CR60","doi-asserted-by":"publisher","unstructured":"Kuramata, M., Katsuki, R. & Nakata, K. Larger sparse quadratic assignment problem optimization using quantum annealing and a bit-flip heuristic algorithm. In 2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA), 556\u2013565. https:\/\/doi.org\/10.1109\/ICIEA52957.2021.9436749 (2021).","DOI":"10.1109\/ICIEA52957.2021.9436749"},{"key":"96220_CR61","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10479-021-04310-x","volume":"307","author":"H Hu","year":"2021","unstructured":"Hu, H. & Sotirov, R. The linearization problem of a binary quadratic problem and its applications. Ann. Oper. Res. 307, 229\u2013249. https:\/\/doi.org\/10.1007\/s10479-021-04310-x (2021).","journal-title":"Ann. Oper. Res."},{"key":"96220_CR62","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi, E. et al. A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem. Science 292, 472\u2013475. https:\/\/doi.org\/10.1126\/science.1057726 (2001).","journal-title":"Science"},{"key":"96220_CR63","first-page":"857","volume":"32","author":"B Knueven","year":"2020","unstructured":"Knueven, B., Ostrowski, J. & Watson, J.-P. On mixed-integer programming formulations for the unit commitment problem. INFORMS J. Comput. 32, 857\u2013876 (2020).","journal-title":"INFORMS J. Comput."},{"key":"96220_CR64","unstructured":"Coffrin, C. Power grid lib - unit commitment. https:\/\/github.com\/power-grid-lib\/pglib-uc\/tree\/master (2019). GitHub repository."},{"key":"96220_CR65","doi-asserted-by":"publisher","first-page":"4897","DOI":"10.1109\/TPWRS.2013.2251373","volume":"28","author":"G Morales-Espa\u00f1a","year":"2013","unstructured":"Morales-Espa\u00f1a, G., Latorre, J. M. & Ramos, A. Tight and compact MILP formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 28, 4897\u20134908. https:\/\/doi.org\/10.1109\/TPWRS.2013.2251373 (2013).","journal-title":"IEEE Trans. Power Syst."},{"key":"96220_CR66","unstructured":"D-Wave. The Most Connected and Powerful Quantum Computer Built for Business. https:\/\/www.dwavesys.com\/solutions-and-products\/systems\/ (2022)."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-96220-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-96220-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-96220-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T11:39:06Z","timestamp":1744544346000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-96220-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,13]]},"references-count":66,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["96220"],"URL":"https:\/\/doi.org\/10.1038\/s41598-025-96220-2","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,13]]},"assertion":[{"value":"23 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2025","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 that they have no known competing financial interests or personal relationships that could influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"12733"}}