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

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.

References in corpus (12)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Computing
• Prospects for Spin-Based Quantum Computing
• How Powerful is Adiabatic Quantum Computation?
• Superconducting Qubits: A Short Review
• Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks
• Non-Perturbative Entangling Gates between Distant Qubits using Uniform Cold Atom Chains
• Whole-device entanglement in a 65-qubit superconducting quantum computer
• NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
• Larger Sparse Quadratic Assignment Problem Optimization Using Quantum Annealing and a Bit-Flip Heuristic Algorithm
• Synergies Between Operations Research and Quantum Information Science
• Solving various NP-Hard problems using exponentially fewer qubits on a Quantum Computer

Cited by in corpus (3)

• Quantum-machine-assisted Drug Discovery
• Quantum Circuit Design for Decoded Quantum Interferometry
• Quantitative analysis of the effectiveness of mid-anneal measurement in quantum annealing