Jonas Haferkamp

Computer Science · Physical Sciences

13h-index626citations37works7.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(26), Quantum many-body systems(11), Quantum Information and Cryptography(9), Stochastic Gradient Optimization Techniques(8), Machine Learning and Algorithms(7)

Publications37 total

Ideal random quantum circuits pass the LXEB test
arXiv (Cornell University)·2026Open Access
Ideal random quantum circuits pass the LXEB test
arXiv (Cornell University)·2026Open Access
Incompressibility and Spectral Gaps of Random Circuits
2025
Quantum complexity in gravity, quantum field theory, and quantum information science
Physics Reports·2025· 14 citedOpen Access
Separating QMA from QCMA with a classical oracle
arXiv (Cornell University)·2025Open Access
On the average-case complexity of learning output distributions of quantum circuits
Quantum·2025· 4 citedOpen Access
Random unitaries in extremely low depth
Science·2025· 32 cited
Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
arXiv (Cornell University)·2025Open Access
Complexity-Constrained Quantum Thermodynamics
PRX Quantum·2025· 6 citedOpen Access
Quantum complexity phase transitions in monitored random circuits
Quantum·2025· 2 citedOpen Access
On the sample complexity of purity and inner product estimation
arXiv (Cornell University)·2024· 1 citedOpen Access
Efficient Quantum Pseudorandomness from Hamiltonian Phase States
arXiv (Cornell University)·2024· 1 citedOpen Access
Benchmarking bosonic and fermionic dynamics
arXiv (Cornell University)·2024· 1 citedOpen Access
Shallow Shadows: Expectation Estimation Using Low-Depth Random Clifford Circuits
Physical Review Letters·2024· 47 cited
Incompressibility and spectral gaps of random circuits
arXiv (Cornell University)·2024· 4 citedOpen Access
Complexity-constrained quantum thermodynamics
arXiv (Cornell University)·2024Open Access
One <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>T</mml:mi></mml:math> Gate Makes Distribution Learning Hard
Physical Review Letters·2023· 27 citedOpen Access
Quantum complexity phase transitions in monitored random circuits
arXiv (Cornell University)·2023· 6 citedOpen Access
On the average-case complexity of learning output distributions of quantum circuits
arXiv (Cornell University)·2023· 2 citedOpen Access
On the moments of random quantum circuits and robust quantum complexity
arXiv (Cornell University)·2023· 1 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Jens Eisert(20), Philippe Faist(7), Dominik Hangleiter(7), Marcel Hinsche(7), Nicole Yunger Halpern(6), Naga Bhavya Teja Kothakonda(5), Alexander Nietner(5), Ryan Sweke(5), Marios Ioannou(4), Ingo Roth(4), Marios Ioannou(4), Yihui Quek(4), Anthony Munson(4), Christian Bertoni(3), Juan Bermejo-Vega(3), Jean‐Pierre Seifert(3), Nicholas Hunter-Jones(3), Marek Gluza(2), Hakop Pashayan(2), Felipe Montealegre‐Mora(2)