Prof. Karol Bartkiewicz (Adam Mickiewicz University)
In this lecture I will introduce the key ideas, motivation, and challenges for solving optimization problems with currently available quantum computers. I will describe quadratic unconstrained binary optimization (QUBO) class of problems and how to encode such problems in Ising Hamiltonians and their ground states. Next, I will demonstrate how such problems are solved by quantum computers by using quantum annealing and quantum approximate optimization algorithm (QAOA). As an example, I will use a max-cut problem.