46 citations · 64 across the 4 of their papers we have counts for
9 papers · 1 filter
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…
Public-key pseudoentanglement and the hardness of learning ground state entanglement structure
Adam Bouland, Bill Fefferman, Soumik Ghosh +4
Given a local Hamiltonian, how difficult is it to determine the entanglement structure of its ground state? We show that this problem is computationally intractable even if one is…
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality
Adam Bouland, Bill Fefferman, Umesh Vazirani
A fundamental issue in the AdS/CFT correspondence is the wormhole growth paradox. Susskind's conjectured resolution of the paradox was to equate the volume of the wormhole with the…
Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
Jonas Haferkamp, Dominik Hangleiter, Adam Bouland +3
Demonstrating a quantum computational speedup is a crucial milestone for near-term quantum technology. Recently, quantum simulation architectures have been proposed that have the p…