11 citations · 13 across the 4 of their papers we have counts for
5 papers
Sample-efficient benchmarking of shallow all-to-all random quantum circuits
Gregory Bentsen, Bill Fefferman, Soumik Ghosh +2
Random circuit sampling (RCS) remains one of the most competitive frameworks for demonstrating quantum advantage in near-term noisy intermediate-scale quantum (NISQ) hardware. Unfo…
Computer Science Challenges in Quantum Computing: Early Fault-Tolerance and Beyond
Jens Palsberg, Jason Cong, Yufei Ding +7
Quantum computing is entering a period in which progress will be shaped as much by advances in computer science as by improvements in hardware. The central thesis of this report is…
The Power of Quantum Fourier Sampling
Bill Fefferman, Chris Umans
A line of work initiated by Terhal and DiVincenzo and Bremner, Jozsa, and Shepherd, shows that quantum computers can efficiently sample from probability distributions that cannot b…
Pseudorandom generators and the BQP vs. PH problem
Bill Fefferman, Christopher Umans
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity o…
The Power of Unentanglement
Scott Aaronson, Salman Beigi, Andrew Drucker +2
The class QMA(k), introduced by Kobayashi et al., consists of all languages that can be verified using k unentangled quantum proofs. Many of the simplest questions about this class…