Jonas Haferkamp

According to our database1, Jonas Haferkamp authored at least 13 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
On the Complexity of Unique Quantum Witnesses and Quantum Approximate Counting.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood.
CoRR, May, 2025

Quantum complexity phase transitions in monitored random circuits.
Quantum, 2025

On the average-case complexity of learning output distributions of quantum circuits.
Quantum, 2025

Separating QMA from QCMA with a classical oracle.
Electron. Colloquium Comput. Complex., 2025

Efficient Quantum Pseudorandomness from Hamiltonian Phase States.
Proceedings of the 20th Conference on the Theory of Quantum Computation, 2025

Incompressibility and Spectral Gaps of Random Circuits.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024
UniqueQMA vs QMA: oracle separation and eigenstate thermalization hypothesis.
CoRR, 2024

On the sample complexity of purity and inner product estimation.
CoRR, 2024

Random unitaries in extremely low depth.
CoRR, 2024

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

A single T-gate makes distribution learning hard.
CoRR, 2022

2021
Learnability of the output distributions of local quantum circuits.
CoRR, 2021


  Loading...