The Digital Annealer finds better Max-Cut solutions than selected classical heuristics on a majority of medium-to-large instances, but its advantage depends on instance size and numeric precision.
Aaronson,The limits of quantum computers, Scientific American (2008)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A comprehensive benchmark of an Ising machine on the Max-Cut problem
The Digital Annealer finds better Max-Cut solutions than selected classical heuristics on a majority of medium-to-large instances, but its advantage depends on instance size and numeric precision.