11 citations · 13 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2015
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…
cs.CC2010★ 11 cited
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…