CoChat

Quantum annealing applications, challenges and limitations for optimisation problems compared to classical solvers

Open access
Quinton, Finley Alexander, Myhr, Per Arne Sevle, Barani, Mostafa, Crespo del Granado, Pedro, Zhang, Hongyu · 2025 · Scientific Reports

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41598-025-96220-2

Cites

56 of 56 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Mean objective function value and computational time comparison between CPLEX, Gurobi, IPOPT and D-Wave’s hybrid solver for the BLP with a single linear constraint. The results are averaged over 5 runs and the minimum and maximum deviation from the mean value is shown by the vertical lines.
Fig. 1 Mean objective function value and computational time comparison between CPLEX, Gurobi, IPOPT and D-Wave’s hybrid solver for the BLP with a single linear constraint. The results are averaged over 5 runs and the minimum and maximum deviation from the mean value is shown by the vertical lines.CC BY · PubMed Central
Fig. 2 Mean objective function value (a) and computational time (b) comparison between CPLEX, Gurobi, IPOPT and D-Wave’s hybrid solver for the BLP with increasingly more constraints. The results are averaged over 5 runs and the minimum and maximum deviation from the mean value is shown by the vertical lines.
Fig. 2 Mean objective function value (a) and computational time (b) comparison between CPLEX, Gurobi, IPOPT and D-Wave’s hybrid solver for the BLP with increasingly more constraints. The results are averaged over 5 runs and the minimum and maximum deviation from the mean value is shown by the vertical lines.CC BY · PubMed Central
Fig. 3 Mean objective function value (top) and computational time (bottom) comparison between two classical solvers and D-Wave’s hybrid solver for the BLP with a single quadratic constraint. In (a) the complexity scales with the number of variables. In (b), the variables are fixed to 500 whereas the complexity scales with increasing C as stated in Eq. (10). All results are averaged over 5 runs, and the vertical lines show the minimum and maximum deviation from the mean value. Gurobi’s solve time is significantly larger than all other solvers and is thereby excluded here for visibility.
Fig. 3 Mean objective function value (top) and computational time (bottom) comparison between two classical solvers and D-Wave’s hybrid solver for the BLP with a single quadratic constraint. In (a) the complexity scales with the number of variables. In (b), the variables are fixed to 500 whereas the complexity scales with increasing C as stated in Eq. (10). All results are averaged over 5 runs, and the vertical lines show the minimum and maximum deviation from the mean value. Gurobi’s solve time is significantly larger than all other solvers and is thereby excluded here for visibility.CC BY · PubMed Central
Fig. 4 Comparison of the objective function value (a) and computational time (b) between D-Wave and the previously introduced classical solvers for BQP with 500 binary variables. The results are averaged over 5 runs. The run time is limited to 1000s, resulting in CPLEX not finding the optimal solution for increasing C.
Fig. 4 Comparison of the objective function value (a) and computational time (b) between D-Wave and the previously introduced classical solvers for BQP with 500 binary variables. The results are averaged over 5 runs. The run time is limited to 1000s, resulting in CPLEX not finding the optimal solution for increasing C.CC BY · PubMed Central
Fig. 5 Mean relative difference of D-Wave’s hybrid solution and those supplied by CPLEX and IPOPT for the BQP. The vertical lines indicate the difference between CPLEX’s and IPOPT’s mean solution to the maximum and minimum solution provided by D-Wave within all 5 runs.
Fig. 5 Mean relative difference of D-Wave’s hybrid solution and those supplied by CPLEX and IPOPT for the BQP. The vertical lines indicate the difference between CPLEX’s and IPOPT’s mean solution to the maximum and minimum solution provided by D-Wave within all 5 runs.CC BY · PubMed Central
Fig. 6 Solution distribution from D-Wave’s LeapHybridCQM solver for the full-scale unit commitment problem. (a) shows the results of 50 runs with the solver’s default chosen run time of 20s. (b) shows the solution for the same problem with 6 runs for an increased run time of 150s and 2 runs for one of 400s. Each run supplies a sampleset with on average 100 solutions each.
Fig. 6 Solution distribution from D-Wave’s LeapHybridCQM solver for the full-scale unit commitment problem. (a) shows the results of 50 runs with the solver’s default chosen run time of 20s. (b) shows the solution for the same problem with 6 runs for an increased run time of 150s and 2 runs for one of 400s. Each run supplies a sampleset with on average 100 solutions each.CC BY · PubMed Central
Fig. 7 Solution distribution of the Reduced-1 unit commitment problem. (a) shows the objective function values of 70 runs (blue) given by D-Wave’s LeapHybridCQM solver with an average of 100 solutions each. The feasible solutions are highlighted in orange. (b) shows the absolute difference between the optimal classical and the best feasible hybrid solution for each run for the Reduced-1 problem. Only one of the 70 runs did not obtain a feasible solution.
Fig. 7 Solution distribution of the Reduced-1 unit commitment problem. (a) shows the objective function values of 70 runs (blue) given by D-Wave’s LeapHybridCQM solver with an average of 100 solutions each. The feasible solutions are highlighted in orange. (b) shows the absolute difference between the optimal classical and the best feasible hybrid solution for each run for the Reduced-1 problem. Only one of the 70 runs did not obtain a feasible solution.CC BY · PubMed Central
Fig. 8 Solution distribution of the Reduced-2 unit commitment problem. (a) shows the objective function values of 70 runs (blue) given by D-Wave’s LeapHybridCQM solver with an average of 100 solutions each. The feasible solutions are highlighted in orange. (b) shows the absolute difference between the optimal classical and the best feasible hybrid solution for each run for the Reduced-2 problem. A feasible solution was found in every run.
Fig. 8 Solution distribution of the Reduced-2 unit commitment problem. (a) shows the objective function values of 70 runs (blue) given by D-Wave’s LeapHybridCQM solver with an average of 100 solutions each. The feasible solutions are highlighted in orange. (b) shows the absolute difference between the optimal classical and the best feasible hybrid solution for each run for the Reduced-2 problem. A feasible solution was found in every run.CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 56 references

Research works printed but not linked: 4

  1. Abbas, A. et al. Quantum optimization: Potential, challenges, and the path forward. https://doi.org/10.48550/arXiv.2312.02279 (2023). · DOI
  2. 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
  3. Mohseni, N. et al. A competitive showcase of quantum versus classical algorithms in energy coalition formation. arXiv:2405.11917 (2024). · arXiv
  4. 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

See all 100

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)
OpenAlex
W4409397231
Cited by
46
References
53
Citations by year
2026: 28 · 2025: 18
FWCI
18.39
Type
journal article
Language
en
Open access
Licence
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.