T

traveling salesman problem

How do you encode combinatorial optimization problems when they have inequality constraints on quantum computers? well, the usual approach is using slack variables. But, this approach is quite expensive and makes the search for possible solutions even harder. In this work, https://arxiv.org/abs/2211.13914, we present “unbalanced penalization” a new approach to encode the inequality constraints of combinatorial optimization problems.