46 citations · 61 across the 2 of their papers we have counts for
8 papers
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…
Prospects and challenges of quantum finance
Adam Bouland, Wim van Dam, Hamed Joorati +2
Quantum computers are expected to have substantial impact on the finance industry, as they will be able to solve certain problems considerably faster than the best known classical…
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…
Classical lower bounds from quantum upper bounds
Shalev Ben-David, Adam Bouland, Ankit Garg +1
We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove t…
Quantum Supremacy and the Complexity of Random Circuit Sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe +1
A critical milestone on the path to useful quantum computers is quantum supremacy - a demonstration of a quantum computation that is prohibitively hard for classical computers. A l…