Comparing Quantum Annealing and BF-DCQO
Abstract
Recent work [1] has claimed that a gate-model quantum-classical hybrid algorithm called bias-field digitized counterdiabatic quantum optimization (BF-DCQO) [2] outperforms D-Wave's annealing quantum computers in optimization tasks. We find the opposite to be true, and demonstrate that D-Wave's quantum annealers find solutions of far greater quality than claimed in Ref. [1], while using far less computation time. We also present evidence that suggests the quantum component of the hybrid approach makes minimal contributions to solution quality.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.