# QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems

arXiv: https://arxiv.org/abs/2404.15852 · HTML: https://mlsanity.com/paper/2404.15852/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- Builds on 11 of its 81 references that are in the map.
- First posted on arXiv 24 Apr 2024.

## Builds on (most cited first, 11 of 11)

- [Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks](https://mlsanity.com/paper/2007.00017/) (2020)
- [Quantum computing for energy systems optimization: Challenges and opportunities](https://mlsanity.com/paper/2003.00254/) (2020)
- [A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone](https://mlsanity.com/paper/2112.12545/) (2021)
- [A Comprehensive Survey on the Multiple Travelling Salesman Problem: Applications, Approaches and Taxonomy](https://mlsanity.com/paper/2102.12772/) (2021)
- [Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers](https://mlsanity.com/paper/2303.01977/) (2023)
- [Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity](https://mlsanity.com/paper/1903.06322/) (2019)
- [Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem](https://mlsanity.com/paper/2012.04984/) (2020)
- [The Impact of Quantum Computing on Present Cryptography](https://mlsanity.com/paper/1804.00200/) (2018)
- [Focusing on the Hybrid Quantum Computing -- Tabu Search Algorithm: new results on the Asymmetric Salesman Problem](https://mlsanity.com/paper/2102.05919/) (2021)
- [A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem](https://mlsanity.com/paper/2005.12478/) (2020)
- [Analyzing the behaviour of D'WAVE quantum annealer: fine-tuning parameterization and tests with restrictive Hamiltonian formulations](https://mlsanity.com/paper/2207.00253/) (2022)

## Built on by (most cited first, 3 of 3)

- [D-Wave's Nonlinear-Program Hybrid Solver: Description and Performance Analysis](https://mlsanity.com/paper/2410.07980/) (2024)
- [On the Transfer of Knowledge in Quantum Algorithms](https://mlsanity.com/paper/2501.14120/) (2025)
- [A Data-Driven Approach to Dataflow-Aware Online Scheduling for Graph Neural Network Inference](https://mlsanity.com/paper/2411.16342/) (2024)

## Abstract (arXiv)

In this paper, we propose a quantum computing oriented benchmark for combinatorial optimization. This benchmark, coined as QOPTLib, is composed of 40 instances equally distributed over four well-known problems: Traveling Salesman Problem, Vehicle Routing Problem, one-dimensional Bin Packing Problem and the Maximum Cut Problem. The sizes of the instances in QOPTLib not only correspond to computationally addressable sizes, but also to the maximum length approachable with non-zero likelihood of getting a good result. In this regard, it is important to highlight that hybrid approaches are also taken into consideration. Thus, this benchmark constitutes the first effort to provide users a general-purpose dataset. Also in this paper, we introduce a first full solving of QOPTLib using two solvers based on quantum annealing. Our main intention with this is to establish a preliminary baseline, hoping to inspire other researchers to beat these outcomes with newly proposed quantum-based algorithms.