463 citations · 2.5k across the 46 of their papers we have counts for
44 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…
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…
Classical and quantum algorithms for characters of the symmetric group
Sergey Bravyi, David Gosset, Vojtech Havlicek +1
Characters of irreducible representations are ubiquitous in group theory. However, computing characters of some groups such as the symmetric group is a challenging problem kn…
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…