A comprehensive benchmark of an Ising machine on the Max-Cut problem

QUBO formulations of combinatorial optimization problems allow for solving them using various quantum heuristics. While large-scale quantum computations are currently still out of reach, we can already numerically test such QUBO formulations on a perhaps surprisingly large scale. In this work, we benchmark Fujitsu’s Digital Annealer (DA) on the Max-Cut problem, which captures the main complexity of the QUBO problem. We make a comprehensive benchmark against leading other heuristic algorithms on graphs with up to 53,000 variables by focusing on the wall-clock time. Moreover, we compare the DA performance against published performance results of the D-Wave hybrid quantum-classical annealer and the recently proposed QIS3 heuristic. Based on performance statistics for over 2,000 graphs from the MQLib, we find that the DA yields competitive results. We hope that this benchmark demonstrates the extent to which large QUBO instances can be heuristically solved today, yielding consistent results across different solvers.

Subjects

Quantum Physics

Emerging Technologies

DDC Class

539: Matter; Molecular Physics; Atomic and Nuclear physics; Radiation; Quantum Physics

006: Special computer methods

Lizenz

https://creativecommons.org/licenses/by/4.0/

Publication version

submittedVersion

Name

2507.22117v1.pdf

Size

1.59 MB

Format

Adobe PDF

Options

A comprehensive benchmark of an Ising machine on the Max-Cut problem