Thema der Dissertation:
Sampling and the complexity of nature
Abstract: The randomness of measurement outcomes is an intrinsic feature of quantum theory. The question I address in my thesis is: Can we exploit this randomness computationally? I investigate the complexity-theoretic and physical foundations of quantum sampling algorithms as well as their classical counterparts. In particular, I assess the computational power of quantum systems simulating themselves, the possibility of verifying quantum computations in the presence of a quantum speedup, and the possibility to improve existing classical sampling algorithms with respect to the so-called `sign problem' -- an overarching theme of my work. A key application of my work is the quest to experimentally demonstrate the speedup of quantum over classical computation, so-called “quantum computational supremacy”.
Zeit & Ort
24.11.2020 | 16:00