Papers
Topics
Authors
Recent
Search
2000 character limit reached

Comparing Quantum Annealing and BF-DCQO

Published 17 Sep 2025 in quant-ph | (2509.14358v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.

HackerNews

  1. Comparing Quantum Annealing and BF-DCQO (2 points, 0 comments) 

Reddit

  1. Comparing Quantum Annealing and BF-DCQO (10 points, 2 comments) 

alphaXiv

  1. Comparing Quantum Annealing and BF-DCQO (4 likes, 0 questions)