1 citations · 1 across the 3 of their papers we have counts for
3 papers
quant-ph2024
On the complexity of sampling from shallow Brownian circuits
Gregory Bentsen, Bill Fefferman, Soumik Ghosh +2
While many statistical properties of deep random quantum circuits can be deduced, often rigorously and other times heuristically, by an approximation to global Haar-random unitarie…
quant-ph2024★ 1 cited
Quantum advantage from measurement-induced entanglement in random shallow circuits
Adam Bene Watts, David Gosset, Yinchen Liu +1
We study random constant-depth quantum circuits in a two-dimensional architecture. While these circuits only produce entanglement between nearby qubits on the lattice, long-range e…
quant-ph2023
Classical simulation of peaked shallow quantum circuits
Sergey Bravyi, David Gosset, Yinchen Liu
An -qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of . We describe a classical algorith…