27 citations · 33 across the 18 of their papers we have counts for
9 papers · 1 filter
Conditional dependence and Scrooge ensembles in shallow random quantum circuits
Yinchen Liu, Max McGinley, Thomas Schuster +1
The output state of a 2D geometrically local shallow random quantum circuit does not have long range correlations due to its lightcone structure. But this changes if one measures a…
Efficient quantum algorithm for Heisenberg spin systems
Sergey Bravyi, David Gosset, Yinchen Liu +1
We consider a broad family of Heisenberg-type quantum spin systems that were studied by Suzuki and Fisher in 1971. This family includes, for example, the Heisenberg antiferromagnet…
Sample-efficient benchmarking of shallow all-to-all random quantum circuits
Gregory Bentsen, Bill Fefferman, Soumik Ghosh +2
Random circuit sampling (RCS) remains one of the most competitive frameworks for demonstrating quantum advantage in near-term noisy intermediate-scale quantum (NISQ) hardware. Unfo…
Lee-Yang tensors and Hamiltonian complexity
Benjamin Wong, Sergey Bravyi, David Gosset +1
A complex tensor with binary indices can be identified with a multilinear polynomial in complex variables. We say it is a Lee-Yang tensor with radius if the polynomial…
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…
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…
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…
A rapidly mixing Markov chain from any gapped quantum many-body system
Sergey Bravyi, Giuseppe Carleo, David Gosset +1
We consider the computational task of sampling a bit string from a distribution , where is the unique ground state of a local Hamiltonian .…
How to simulate quantum measurement without computing marginals
Sergey Bravyi, David Gosset, Yinchen Liu
We describe and analyze algorithms for classically simulating measurement of an -qubit quantum state in the standard basis, that is, sampling a bit string from the proba…