15 citations · 21 across the 2 of their papers we have counts for
3 papers
Electronic Structure in a Fixed Basis is QMA-complete
Bryan O'Gorman, Sandy Irani, James Whitfield +1
Finding the ground state energy of electrons subject to an external electric field is a fundamental problem in computational chemistry. We prove that this electronic-structure prob…
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…
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…