160 citations · 653 across the 25 of their papers we have counts for
24 papers · 1 filter
On the pseudorandomness of simple quantum processes
Jesko Dujmovic, Jonas Haferkamp, Alexander Poremba
Can simple processes appear highly complex? Gowers (Comb. Prob. Comp. '96) conjectured that repeatedly composing local random reversible operations can yield global permutations th…
Ideal random quantum circuits pass the LXEB test
Nicholas Hunter-Jones, Jonas Haferkamp
We show that noiseless random quantum circuits pass the linear cross-entropy benchmark (LXEB) test with high probability. If the circuits are linear depth, and thus form unitary 4-…
Separating QMA from QCMA with a classical oracle
John Bostanci, Jonas Haferkamp, Chinmay Nirkhe +1
We construct a classical oracle proving that, in a relativized setting, the set of languages decidable by an efficient quantum verifier with a quantum witness (QMA) is strictly big…
Anticoncentration is (almost) all you need
Markus Heinrich, Jonas Haferkamp, Ingo Roth +1
Until very recently, it was generally believed that the (approximate) 2-design property is strictly stronger than anticoncentration of random quantum circuits, mainly because it wa…
Will it glue? On short-depth designs beyond the unitary group
Lorenzo Grevink, Jonas Haferkamp, Markus Heinrich +4
We study the formation of short-depth designs beyond the unitary group. We provide a range of results on several groups of broad interest in quantum information science: the Cliffo…
Efficient Quantum Pseudorandomness from Hamiltonian Phase States
John Bostanci, Jonas Haferkamp, Dominik Hangleiter +1
Quantum pseudorandomness has found applications in many areas of quantum information, ranging from entanglement theory, to models of scrambling phenomena in chaotic quantum systems…
Benchmarking bosonic and fermionic dynamics
Jadwiga Wilkens, Marios Ioannou, Ellen Derbyshire +4
Analog quantum simulation allows for assessing static and dynamical properties of strongly correlated quantum systems to high precision. To perform simulations outside the reach of…
Random unitaries in extremely low depth
Thomas Schuster, Jonas Haferkamp, Hsin-Yuan Huang
We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over qubits in depth. In a similar manner, we construc…
Incompressibility and spectral gaps of random circuits
Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp +3
Random reversible and quantum circuits form random walks on the alternating group and unitary group , respectively. Known bounds on the spectr…
Complexity-constrained quantum thermodynamics
Anthony Munson, Naga Bhavya Teja Kothakonda, Jonas Haferkamp +3
Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodyna…
Quantum complexity phase transitions in monitored random circuits
Ryotaro Suzuki, Jonas Haferkamp, Jens Eisert +1
Recently, the dynamics of quantum systems that involve both unitary evolution and quantum measurements have attracted attention due to the exotic phenomenon of measurement-induced…
On the average-case complexity of learning output distributions of quantum circuits
Alexander Nietner, Marios Ioannou, Ryan Sweke +4
In this work, we show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model. This learning model is widely…
On the moments of random quantum circuits and robust quantum complexity
Jonas Haferkamp
We prove new lower bounds on the growth of robust quantum circuit complexity -- the minimal number of gates to approximate a unitary up to an error of in operator…
Shallow shadows: Expectation estimation using low-depth random Clifford circuits
Christian Bertoni, Jonas Haferkamp, Marcel Hinsche +3
We provide practical and powerful schemes for learning many properties of an unknown n-qubit quantum state using a sparing number of copies of the state. Specifically, we present a…
Random quantum circuits are approximate unitary -designs in depth
Jonas Haferkamp
The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the…
Equivalence of contextuality and Wigner function negativity in continuous-variable quantum optics
Jonas Haferkamp, Juani Bermejo-Vega
One of the central foundational questions of physics is to identify what makes a system quantum as opposed to classical. One seminal notion of classicality of a quantum system is t…
Learnability of the output distributions of local quantum circuits
Marcel Hinsche, Marios Ioannou, Alexander Nietner +6
There is currently a large interest in understanding the potential advantages quantum devices can offer for probabilistic modelling. In this work we investigate, within two differe…
Resource theory of quantum uncomplexity
Nicole Yunger Halpern, Naga B. T. Kothakonda, Jonas Haferkamp +3
Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state's complexity quantifies th…
Linear growth of quantum circuit complexity
Jonas Haferkamp, Philippe Faist, Naga B. T. Kothakonda +2
Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and…
Emergent statistical mechanics from properties of disordered random matrix product states
Jonas Haferkamp, Christian Bertoni, Ingo Roth +1
The study of generic properties of quantum states has led to an abundance of insightful results. A meaningful set of states that can be efficiently prepared in experiments are grou…
Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
Jonas Haferkamp, Nicholas Hunter-Jones
Random quantum circuits are a central concept in quantum information theory with applications ranging from demonstrations of quantum computational advantage to descriptions of scra…
Efficient unitary designs with a system-size independent number of non-Clifford gates
Jonas Haferkamp, Felipe Montealegre-Mora, Markus Heinrich +3
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full -q…
Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
Jonas Haferkamp, Dominik Hangleiter, Adam Bouland +3
Demonstrating a quantum computational speedup is a crucial milestone for near-term quantum technology. Recently, quantum simulation architectures have been proposed that have the p…
Contracting projected entangled pair states is average-case hard
Jonas Haferkamp, Dominik Hangleiter, Jens Eisert +1
An accurate calculation of the properties of quantum many-body systems is one of the most important yet intricate challenges of modern physics and computer science. In recent years…