On 139 Max-Cut instances, classical simulated annealing and Toshiba's SBM match or beat D-Wave's Hybrid solver on large graphs, and the fast-annealing QPU misses the global optimum on nearly all small instances.
BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
On 139 Max-Cut instances, classical simulated annealing and Toshiba's SBM match or beat D-Wave's Hybrid solver on large graphs, and the fast-annealing QPU misses the global optimum on nearly all small instances.