Springe direkt zu Inhalt

Quantum algorithms, learning and verification

A quantum algorithm for the Abelian state hidden subgroup problem.

A quantum algorithm for the Abelian state hidden subgroup problem.

Quantum algorithms, learning and verification explore how quantum computers can outperform classical computation and how their correct functioning can be reliably certified. Our research develops rigorous quantum algorithms for a wide range of computational tasks, including combinatorial optimization, quantum machine learning, and quantum simulation, while seeking a deeper understanding of the fundamental capabilities and limitations of quantum computation. Quantum learning theory aims to learn or test properties of quantum systems from limited data. We also develop methods for benchmarking, verification, and Hamiltonian learning based on randomized measurements and classical shadows, enabling the reliable characterization of increasingly complex quantum devices.

Selected recent group publications

Group reviews