46 citations · 101 across the 15 of their papers we have counts for
3 papers · 2 filters
On the hardness of learning ground state entanglement of geometrically local Hamiltonians
Adam Bouland, Chenyi Zhang, Zixin Zhou
Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity…
Exponential improvements to the average-case hardness of BosonSampling
Adam Bouland, Ishaun Datta, Bill Fefferman +1
BosonSampling and Random Circuit Sampling are important both as a theoretical tool for separating quantum and classical computation, and as an experimental means of demonstrating q…
The state hidden subgroup problem and an efficient algorithm for locating unentanglement
Adam Bouland, Tudor Giurgica-Tiron, John Wright
We study a generalization of entanglement testing which we call the "hidden cut problem." Taking as input copies of an -qubit pure state which is product across an unknown bipar…