Quantum Optimization Benchmarking Library - The Intractable Decathlon

Abstract

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.

64 pages, 21 figures. Link to QOBLIB repository: https://git.zib.de/qopt/qoblib-quantum-optimization-benchmarking-library

References in corpus (30)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Ising formulations of many NP problems
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Warm-starting quantum optimization
• Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
• Grover Adaptive Search for Constrained Polynomial Binary Optimization
• Exact Algorithms for Maximum Independent Set
• Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Benchmarking the performance of portfolio optimization with QAOA
• Progress in Mathematical Programming Solvers from 2001 to 2020
• Variational Benchmarks for Quantum Many-Body Problems
• Benchmarking quantum computers
• QUARK: A Framework for Quantum Computing Application Benchmarking
• Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way
• Low Autocorrelation Binary Sequences
• Towards large-scale quantum optimization solvers with few qubits
• Analysis of The Vehicle Routing Problem Solved via Hybrid Quantum Algorithms in Presence of Noisy Channels
• Applying quantum approximate optimization to the heterogeneous vehicle routing problem
• RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
• Benchmarking the performance of quantum computing software
• Squeezing and quantum approximate optimization
• Optimization by Decoded Quantum Interferometry
• Which algorithm to select in sports timetabling?
• Benchmarking Quantum Computers: Towards a Standard Performance Evaluation Approach
• Alleviating the quantum Big-$M$ problem
• AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer