Learnability of the output distributions of local quantum circuits. - Marcel Hinsche; Marios Ioannou; Alexander Nietner; Jonas Haferkamp; Yihui Quek; Dominik Hangleiter; Jean-Pierre Seifert; Jens Eisert; Ryan Sweke (CoRR, 2021)

A single T-gate makes distribution learning hard. - Marcel Hinsche; Marios Ioannou; Alexander Nietner; Jonas Haferkamp; Yihui Quek; Dominik Hangleiter; Jean-Pierre Seifert; Jens Eisert; Ryan Sweke (CoRR, 2022)

Random quantum circuits are approximate unitary t-designs in depth O(nt5+o(1)). - Jonas Haferkamp (Quantum, 2022)

On the average-case complexity of learning output distributions of quantum circuits. - Alexander Nietner; Marios Ioannou; Ryan Sweke; Richard Kueng; Jens Eisert; Marcel Hinsche; Jonas Haferkamp (CoRR, 2023)

Incompressibility and spectral gaps of random circuits. - Chi-Fang Chen; Jeongwan Haah; Jonas Haferkamp; Yunchao Liu; Tony Metger; Xinyu Tan (CoRR, 2024)

Random unitaries in extremely low depth. - Thomas Schuster; Jonas Haferkamp; Hsin-Yuan Huang (CoRR, 2024)

On the sample complexity of purity and inner product estimation. - Weiyuan Gong; Jonas Haferkamp; Qi Ye; Zhihan Zhang (CoRR, 2024)

UniqueQMA vs QMA: oracle separation and eigenstate thermalization hypothesis. - Anurag Anshu; Jonas Haferkamp; Yeongwoo Hwang; Quynh T. Nguyen (CoRR, 2024)

Efficient Quantum Pseudorandomness from Hamiltonian Phase States. - John Bostanci; Jonas Haferkamp; Dominik Hangleiter; Alexander Poremba (IACR Cryptol. ePrint Arch., 2024)

Quantum complexity phase transitions in monitored random circuits. - Ryotaro Suzuki; Jonas Haferkamp; Jens Eisert; Philippe Faist (Quantum, 2025)

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood. - Sitan Chen; Weiyuan Gong; Jonas Haferkamp; Yihui Quek (CoRR, 2025)