Quantum Optimization Benchmarking Library - The Intractable Decathlon
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , , , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916922544619520 |
|---|---|
| author | Koch, Thorsten Neira, David E. Bernal Chen, Ying Cortiana, Giorgio Egger, Daniel J. Heese, Raoul Hegade, Narendra N. Cadavid, Alejandro Gomez Huang, Rhea Itoko, Toshinari Kleinert, Thomas Xavier, Pedro Maciel Mohseni, Naeimeh Montanez-Barrera, Jhon A. Nakano, Koji Nannicini, Giacomo O'Meara, Corey Pauckert, Justin Proissl, Manuel Ramesh, Anurag Schicker, Maximilian Shimada, Noriaki Takeori, Mitsuharu Valls, Victor Van Bulck, David Woerner, Stefan Zoufal, Christa |
| author_facet | Koch, Thorsten Neira, David E. Bernal Chen, Ying Cortiana, Giorgio Egger, Daniel J. Heese, Raoul Hegade, Narendra N. Cadavid, Alejandro Gomez Huang, Rhea Itoko, Toshinari Kleinert, Thomas Xavier, Pedro Maciel Mohseni, Naeimeh Montanez-Barrera, Jhon A. Nakano, Koji Nannicini, Giacomo O'Meara, Corey Pauckert, Justin Proissl, Manuel Ramesh, Anurag Schicker, Maximilian Shimada, Noriaki Takeori, Mitsuharu Valls, Victor Van Bulck, David Woerner, Stefan Zoufal, Christa |
| contents | Through recent progress in hardware development, quantum computers have advanced to the point where benchmarking of (heuristic) quantum algorithms at scale is within reach. Particularly in combinatorial optimization - where most algorithms are heuristics - it is key to empirically analyze their performance on hardware and track progress towards quantum advantage. To this extent, we present ten optimization problem classes that are difficult for existing classical algorithms and can (mostly) be linked to practically relevant applications, with the goal to enable systematic, fair, and comparable benchmarks for quantum optimization methods. Further, we introduce the Quantum Optimization Benchmarking Library (QOBLIB) where the problem instances and solution track records can be found. The individual properties of the problem classes vary in terms of objective and variable type, coefficient ranges, and density. Crucially, they all become challenging for established classical methods already at system sizes ranging from less than 100 to, at most, an order of 100,000 decision variables, allowing to approach them with today's quantum computers. We reference the results from state-of-the-art solvers for instances from all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems. The baseline results illustrate a standardized form to present benchmarking solutions, which has been designed to ensure comparability of the used methods, reproducibility of the respective results, and trackability of algorithmic and hardware improvements over time. We encourage the optimization community to explore the performance of available classical or quantum algorithms and hardware platforms with the benchmarking problem instances presented in this work toward demonstrating quantum advantage in optimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_03832 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Optimization Benchmarking Library - The Intractable Decathlon Koch, Thorsten Neira, David E. Bernal Chen, Ying Cortiana, Giorgio Egger, Daniel J. Heese, Raoul Hegade, Narendra N. Cadavid, Alejandro Gomez Huang, Rhea Itoko, Toshinari Kleinert, Thomas Xavier, Pedro Maciel Mohseni, Naeimeh Montanez-Barrera, Jhon A. Nakano, Koji Nannicini, Giacomo O'Meara, Corey Pauckert, Justin Proissl, Manuel Ramesh, Anurag Schicker, Maximilian Shimada, Noriaki Takeori, Mitsuharu Valls, Victor Van Bulck, David Woerner, Stefan Zoufal, Christa Quantum Physics Combinatorics Through recent progress in hardware development, quantum computers have advanced to the point where benchmarking of (heuristic) quantum algorithms at scale is within reach. Particularly in combinatorial optimization - where most algorithms are heuristics - it is key to empirically analyze their performance on hardware and track progress towards quantum advantage. To this extent, we present ten optimization problem classes that are difficult for existing classical algorithms and can (mostly) be linked to practically relevant applications, with the goal to enable systematic, fair, and comparable benchmarks for quantum optimization methods. Further, we introduce the Quantum Optimization Benchmarking Library (QOBLIB) where the problem instances and solution track records can be found. The individual properties of the problem classes vary in terms of objective and variable type, coefficient ranges, and density. Crucially, they all become challenging for established classical methods already at system sizes ranging from less than 100 to, at most, an order of 100,000 decision variables, allowing to approach them with today's quantum computers. We reference the results from state-of-the-art solvers for instances from all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems. The baseline results illustrate a standardized form to present benchmarking solutions, which has been designed to ensure comparability of the used methods, reproducibility of the respective results, and trackability of algorithmic and hardware improvements over time. We encourage the optimization community to explore the performance of available classical or quantum algorithms and hardware platforms with the benchmarking problem instances presented in this work toward demonstrating quantum advantage in optimization. |
| title | Quantum Optimization Benchmarking Library - The Intractable Decathlon |
| topic | Quantum Physics Combinatorics |
| url | https://arxiv.org/abs/2504.03832 |