2 November 2025 List of Tutorials

Quantum Annealing for Constrained Optimization

We will present in this tutorial how constrained optimization problems and constraint satisfaction problems can be modeled in QUBO and solved by quantum annealing, with the help of several examples. After introducing the basic concepts of quantum annealing, QUBO, CSPs and constrained optimization problems, we will first present several encoding schemes for integer variables and basic constraints in QUBO, with various concrete examples. Then we will detail how to encode more complex constraints such as linear equations and non-linear constraints, for instance the “permutation/all-different” constraint. We will describe QUBO models for well-known constraint problems such as N-queens, Magic Square, Costas Arrays, as well as for constrained optimization problems such as the traveling Salesman Problem (TSP) and the Quadratic Assignment Problem (QAP).