Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage
Preprint
Abstract
Combinatorial optimization problems are one of the target applications of current quantum technology, mainly because of their industrial relevance, the difficulty of solving large instances of them classically, and their equivalence to Ising Hamiltonians using the quadratic unconstrained binary optimization (QUBO) formulation. Many of these applications have inequality constraints, usually encoded as penalization terms in the QUBO formulation using additional variables known as slack variables. The slack variables have two disadvantages: (i) these variables extend the search space of optimal and suboptimal solutions, and (ii) the variables add extra qubits and connections to the quantum algorithm. Recently, a new method known as unbalanced penalization has been presented to avoid using slack variables. This method offers a trade-off between additional slack variables to ensure that the optimal solution is given by the ground state of the Ising Hamiltonian, and using an unbalanced heuristic function to penalize the region where the inequality constraint is violated with the only certainty that the optimal solution will be in the vicinity of the ground state. This work tests the unbalanced penalization method using real quantum hardware on D-Wave Advantage for the traveling salesman problem (TSP). The results show that the unbalanced penalization method outperforms the solutions found using slack variables and sets a new record for the largest TSP solved with quantum technology.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Unbalanced penalization: a new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithmsQuantum Science and Technology, 2024
- Application-Oriented Performance Benchmarks for Quantum ComputingIEEE Transactions on Quantum Engineering, 2023
- Constrained quantum optimization for extractive summarization on a trapped-ion quantum computerScientific Reports, 2022
- An investigation of IBM quantum computing device performance on combinatorial optimisation problemsNeural Computing and Applications, 2022
- Dynamic portfolio optimization with real datasets using quantum processors and quantum-inspired tensor networksPhysical Review Research, 2022
- Garden optimization problems for benchmarking quantum annealersQuantum Information Processing, 2021
- Breaking limitation of quantum annealer in solving optimization problems under constraintsScientific Reports, 2020
- The unconstrained binary quadratic programming problem: a surveyJournal of Combinatorial Optimization, 2014
- The worst-case time complexity for generating all maximal cliques and computational experimentsTheoretical Computer Science, 2006
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation1994