Unbalanced-penalizations-QUBO

Project information

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.

QUBO QAOA Optimization Combinatoria... bin packing ... traveling sa... knapsack pro...

4 Commits
1 Branch
0 Tags

README

Created on

January 02, 2023

Loading