J. Haferkamp

activity

20182026

most citedLinear growth of quantum circuit complexity

160 citations · 653 across the 25 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

quant-ph2022★ 58 cited

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…

quant-ph2022★ 87 cited

Random quantum circuits are approximate unitary $t$ -designs in depth $O (n t^{5 + o (1)})$

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…

Shallow shadows: Expectation estimation using low-depth random Clifford circuits

Random quantum circuits are approximate unitary t-designs in depth O(nt5+o(1))

Random quantum circuits are approximate unitary $t$ -designs in depth $O (n t^{5 + o (1)})$