Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers
Open accessThe DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Abstract
Quantum computing is rapidly advancing, harnessing the power of qubits’ 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’s hybrid solver against that of industry-leading solvers such as CPLEX, Gurobi, and IPOPT. The findings indicate that D-Wave’s 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures








Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592 · cited 1×
“The first attempts in the 90s used nuclear magnetic resonance [6], later, a plethora of different ideas has shown promise such as cold atoms [7], trapped ions [8], photon-based [9] and others [10, 11].”
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
Sheng, Z.-H., Shao, L., Chen, J.-J., Bao, W.-J., Wang, F.-B., & Xia, X.-H. (2011) · ACS Nano · doi:10.1021/nn103584t · Cited by 2,573
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · cited 1×
“In quantum annealing, the quantum mechanical phenomenon of tunnelling through a potential barrier, rather than the classical process of “climbing” over it, is utilised to escape local minima and potentially find a global one, as explained by Kadowaki and Nishimori (1998) [47].”
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, M. L. (1981) · Management Science · doi:10.1287/mnsc.27.1.1 · Cited by 2,109
Research works printed but not linked: 4
- Abbas, A. et al. Quantum optimization: Potential, challenges, and the path forward. https://doi.org/10.48550/arXiv.2312.02279 (2023). · DOI
- Koniorczyk, M., Krawiec, K., Botelho, L., Bešinović, 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). · arXiv · doi:10.48550/arxiv.2309.0676
- Mohseni, N. et al. A competitive showcase of quantum versus classical algorithms in energy coalition formation. arXiv:2405.11917 (2024). · arXiv
- Knueven, B., Ostrowski, J. & Watson, J.-P. On mixed-integer programming formulations for the unit commitment problem. INFORMS J. Comput. 32, 857–876 (2020).
Cited by
A Survey of Quantum Machine Learning: Foundations, Algorithms, Frameworks, Data and Applications
Rodríguez-Díaz, F., Gutiérrez‐Avilés, D., Troncoso, A., & Alvarez, F. M. (2025) · ACM Computing Surveys · doi:10.1145/3764582 · Cited by 70
Quantum-machine-assisted drug discovery
Zhou, Y., Chen, J., Cheng, J., Cao, X., Zhang, Y., Karemore, G., Žitnik, M., Chong, F. T., Liu, J., Fu, T., et al. (2026) · npj Drug Discovery. · doi:10.1038/s44386-025-00033-2 · Cited by 33
Salloum, H., Zhanalin, S., Badr, A. A., & Kholodov, Y. A. (2025) · Scientific Reports · doi:10.1038/s41598-025-04568-2 · Cited by 23
Quantum Multiview Feature Selection With Configurable Kernel Circuits and Adaptive Fusion
Li, J., Xu, H., Chen, G., & Zhang, S. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3650093 · Cited by 19
Quantum Circuit Design for Decoded Quantum Interferometry
Patamawisut, N., Benchasattabuse, N., Hajdušek, M., & Meter, R. V. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00041 · Cited by 18
Metadata
- Authors
- Quinton, F. A., Myhr, P. A. S., Barani, M., Crespo del Granado, P., & Zhang, H.
- Affiliations
- Norwegian University of Science and Technology (NO)
- Corresponding author
- Quinton, Finley Alexander
- Venue
- Scientific Reports
- Published
- 2025-04-13
- Volume
- 15
- Issue
- 1
- Pages
- 12733-12733
- ISSN
- 2045-2322 (ISSN-L)
- PMC
- PMC11994798
- OpenAlex
- W4409397231
- Cited by
- 46
- References
- 53
- Citations by year
- 2026: 28 · 2025: 18
- FWCI
- 18.39
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Scientific Reports (publishedVersion, cc-by)
- Europe PMC (PubMed Central) (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- ePrints Soton (University of Southampton) (acceptedVersion)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- NTNU Norwegian University of Science and Technology
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- quantum annealing, D-Wave, hybrid quantum-classical solvers, mixed-integer linear programming, combinatorial optimization, unit commitment, energy optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers. https://app.cochat.ai/papers/10.1038/s41598-025-96220-2
- The paper
- Quinton, F. A., Myhr, P. A. S., Barani, M., Crespo del Granado, P., & Zhang, H. (2025). Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers. Scientific Reports. https://doi.org/10.1038/s41598-025-96220-2
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.