I am a PhD candidate at the German Aerospace Center (DLR) and the university of Cologne (UoC), supervised by Prof. Matthias Sperl. I'm broadly interested in the area of quantum algorithms, optimization, and spin glasses.

I primarily explore the limitations of near-term quantum algorithms. Given the state of the current Noisy-Intermediate-Scale Quantum (NISQ) computer, I ask

1. Are there any advantage in using heuristic algorithms like the Quantum Approximate Optimization Algorithm (QAOA)? Currently it seems that no advantage is possible at log depth but it is still an open question at polynomial depth.

2. Does the order of limits matter for variational quantum algorithms? If not when is limit swapping valid? My work argues that the overlap gap property prevents limit swapping and supports a conjecture that limit swapping is valid when it is absent.
   
   

Short bio:

2023- : PhD candidate at DLR and UoC.

2020-2023: M.Sc, UoC

2015-2020: B.Sc (Hons.) & B.A (Hons.) in Physics and Philosophy, NUS