Tobias Stollenwerk

---

There are few candidates for quantum algorithms which might outperform
classical approaches while being amenable to noisy quantum computing
devices.
Beside quantum simulation algorithms, quantum algorithms for approximate
optimization are promising candidates.
The target application for these approaches is finding approximate
solutions to combinatorial optimization problems.
In this talk I will give an overview on quantum approximate optimization
approaches,
while mainly focusing on the quantum approximate optimization algorithm
(QAOA), quantum annealing and variations thereof.
I will demonstrate these concepts by considering a particular real-world
planning problem, the flight-gate assignment problem [1].
In addition, I will cover novel approaches for the diagrammatic analysis
of parametrized quantum circuits, like QAOA.
Here I will demonstrate how such methods can be employed to help with
the performance investigation of QAOA and other variational quantum
algorithms.

[1] https://ieeexplore.ieee.org/document/9222273
[2] https://arxiv.org/abs/2204.01307

---

Forschungszentrum Jülich
Seminar Room 0.03, ETP
Contact: David Gross