.png){kind=icon}
.png){kind=icon}
Return
The Quantum Optimization Benchmarking Library
.png){kind=icon}
OA
AI
DOI：10.1038/s43588-026-00991-1.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recent progress has brought benchmarking of (heuristic) quantum algorithms at scale within reach. Particularly in combinatorial optimization, it is key to empirically analyze and track progress towards quantum advantage. This work introduces a systematic, fair and comparable benchmarking framework for quantum optimization methods by presenting ten model-independent problem classes that are challenging for classical methods. Track records of specific instances and solutions are given in an accompanying open-source repository. While the individual properties of the problem classes vary, they all become challenging from less than 100 to, at most, an order of 100,000 decision variables. We reference results from state-of-the-art solvers for instances across all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems, which illustrate standardized benchmark reporting. The presented problem instances may be approached with classical or quantum algorithms executed on varying hardware platforms to drive the field towards quantum advantage. This Resource presents the Quantum Optimization Benchmarking Library, which enables fair, reproducible benchmarks of quantum heuristics for ten difficult combinatorial optimization classes with baseline results to track progress towards quantum advantage.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K
Organization
View more organizations