Appears in collection : CEMRACS 2025: Quantum Computing / CEMRACS 2025: Calcul quantique

The potential of quantum algorithms for solving optimization problems has been explored since the early days of quantum computing. This course introduces some of the key ideas and algorithms developed in this context, along with their fundamental limitations. Depending on the available time, topics covered may include: quantum optimization algorithms inspired by physics (adiabatic algorithms, variational algorithms, QAOA, quantum annealing, etc.), quantum algorithms for convex optimization (acceleration of first- and second-order methods, oracular problems, etc.), applications to combinatorial optimization (graph problems, quadratic binary optimization, etc.).