2025/09/17 by Pau Farré, Erika Ordog, Farré, Pau +5 · 1 voice · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.2509.14358
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.