Inter-generational comparison of quantum annealers in solving hard scheduling problems
Bibek Pokharel, Zoe Gonzalez Izquierdo, P. Aaron Lott, Elena Strbac,, Krzysztof Osiewalski, Emmanuel Papathanasiou, Alexei Kondratyev, Davide, Venturelli, and Eleanor Rieffel

TL;DR
This study compares four generations of quantum annealers on complex scheduling problems, revealing significant performance improvements and better scaling with hardware upgrades and optimized parameters.
Contribution
It provides an inter-generational performance comparison of quantum annealers and identifies key factors like hardware upgrades and parameter optimization that enhance their efficiency.
Findings
Advantage outperforms older models significantly.
Optimizing ferromagnetic couplings improves both TTS and scaling.
Scaling exponent reduced from 1.01 to 0.173 across generations.
Abstract
We compare the performance of four quantum annealers, the D-Wave Two, 2X, 2000Q, and Advantage in solving an identical ensemble of a parametrized family of scheduling problems. These problems are NP-complete and, in fact, equivalent to vertex coloring problems. They are also practically motivated and closely connected to planning problems from artificial intelligence. We examine factors contributing to the performance differences while separating the contributions from hardware upgrades, support for shorter anneal times, and possible optimization of ferromagnetic couplings. While shorter anneal times can improve the time to solution (TTS) at any given problem size, the scaling of TTS with respect to the problem size worsens for shorter anneal times. In contrast, optimizing the ferromagnetic coupling improves both the absolute TTS and the scaling. There is a statistically significant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Neural Networks and Reservoir Computing
