Comparing Quantum Annealing and BF-DCQO

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Farré, Pau, Ordog, Erika, Chern, Kevin, McGeoch, Catherine C.
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915500380913664
author Farré, Pau
Ordog, Erika
Chern, Kevin
McGeoch, Catherine C.
author_facet Farré, Pau
Ordog, Erika
Chern, Kevin
McGeoch, Catherine C.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2509_14358
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Comparing Quantum Annealing and BF-DCQO
Farré, Pau
Ordog, Erika
Chern, Kevin
McGeoch, Catherine C.
Quantum Physics
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.
title Comparing Quantum Annealing and BF-DCQO
topic Quantum Physics
url https://arxiv.org/abs/2509.14358