Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms

Solving combinatorial optimization problems of the kind that can be codified by quadratic unconstrained binary optimization (QUBO) is a promising application of quantum computation. Some problems of this class suitable for practical applications such as the traveling salesman problem (TSP), the bin...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Montanez-Barrera, Alejandro, Willsch, Dennis, Maldonado-Romo, Alberto, Michielsen, Kristel
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 07.06.2024
Subjects:	Algorithms Codification Combinatorial analysis Cost function Knapsack problem Operations research Optimization Quantum computing Qubits (quantum computing) Slack variables Traveling salesman problem
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!