Benchmarking Quantum Computing for Combinatorial Optimization
Nathan Kittichaikoonkij, Nutthapat Pongtanyavichai, Poopha Suwananek, Prabhas Chongstitvatana, Kamonluk Suksen · 2025
Quantum computers can be much faster than any classical computers in solving a certain class of problems. One of the interesting problems is the combinatorial optimization problem, which is a challenge for classical computer systems. We encode these problems into the Quadratic Unconstrained Binary Optimization (QUBO) format and then solve them with quantum solvers. In this study, we compare the performance of D-Wave’s quantum annealing system with classical solvers, namely, Gurobi and Fixstars. We demonstrate the current capabilities of the D-Wave system.