HackerPapers

arXiv:2509.14358quant-ph

Comparing Quantum Annealing and BF-DCQO

Pau Farré, Erika Ordog, Kevin Chern, Catherine C. McGeoch

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
6 pages, 4 figures
Journal reference
DOI
Subjects
quant-phQuantum Physics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Oct 2025 to Oct 2025. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.