In this seminar, we focus on how one can solve combinatorial optimization problems within the Quadratic Unconstrained Binary Optimization (QUBO) framework. The use of this framework is inspired by adiabatic quantum computation. Nowadays, the most competitive solution approaches are based on dedicated hardware. At the same time, quantum algorithms can be used to solve these problems, e.g. Quantum Approximate Optimization Algorithms (QAOAs).

In this seminar, we present research papers on this topic. Prerequisites are very good knowledge of linear algebra and some basic knowledge in computer science (computation with bit strings).