Answers are grounded in this paper and cite their sources.
In this paper, we investigate the capabilities of analog quantum computers in solving well-known optimisation problems, with a specific focus on the Max-Cut and Capacitated Vehicle Routing Problem (CVRP). Our aim is to evaluate the performance of the D-Wave Advantage machine in addressing these complex challenges. We selected instances from the literature for these two problems based on the machine's capacity, specifically considering its number of qubits and the topology of its qubit network. For the Max-Cut problem, we utilise a fully quantum approach, employing an Ising model to find optimal solutions. For the CVRP, we adopt a hybrid quantum-classical methodology, following a cluster first-route second scheme. Our findings suggest that quantum computers are a promising tool for rapidly solving optimisation problems, although we observed limitations in terms of scalability.
No takes yet. Share an insight, caveat, or question.
Deleplanque et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: