160 citations · 653 across the 25 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
quant-ph2026
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…
quant-ph2026
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-…