Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe

Q: Fachverband Quantenoptik und Photonik

Q 8: QI Poster I (joint session QI/Q)

Q 8.45: Poster

Montag, 6. März 2023, 16:30–19:00, Empore Lichthof

Portfolio Optimization using a Quantum Computer — •Matthias Hüls and Daniel Braun — Institut für Theoretische Physik, Eberhard Karls Universität Tübingen, Deutschland

Entering the era of Noisy Intermediate-Scale Quantum (NISQ) devices, hopes are raising to already make practical use of the existing quantum processors. While deep algorithms still fail on the error prone hardware, variational algorithms show error resilience to some extend. This makes them well suited for the NISQ technology. Therefore, popular candidates like the Quantum Approximate Optimization Algorithm (QAOA), designed to solve combinatorial optimization problems, attracted much attention in recent years. In a case study, we benchmark the performance of the QAOA for the portfolio optmimization problem. We focus on how the characteristics of a given problem instance influence the algorithms performance and deduce a criterion for distinguishing between 'easy' and 'hard' instances.