QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial OptimizationTraveling Salesman ProblemSimilar Papers 제목 키워드 기반
Evaluate Quantum Combinatorial Optimization for Distribution Network Reconfiguration
This paper aims to implement and evaluate the performance of quantum computing on solving combinatorial optimization problems arising from the operations of the power grid. To this end, we construct a novel mixed integer…
Combinatorial OptimizationGenerative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver
Quantum computing is entering a transformative phase with the emergence of logical quantum processors, which hold the potential to tackle complex problems beyond classical capabilities. While significant progress has bee…
Combinatorial OptimizationDecoderQuantum Circuit GenerationApplication-Oriented Benchmarking of Quantum Generative Learning Using QUARK
Benchmarking of quantum machine learning (QML) algorithms is challenging due to the complexity and variability of QML systems, e.g., regarding model ansatzes, data sets, training techniques, and hyper-parameters selectio…
BenchmarkingGPUQuantum Machine LearningDQAOA-GPT: AI-Accelerated Distributed Quantum Optimization for Combinatorial Problems
While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces. Variational quantum algorithms offer a p…
Automated quantum programming via reinforcement learning for combinatorial optimization
We develop a general method for incentive-based programming of hybrid quantum-classical computing systems using reinforcement learning, and apply this to solve combinatorial optimization problems on both simulated and re…
Combinatorial Optimizationreinforcement-learningReinforcement LearningReinforcement Learning (RL)