1 citations · 1 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2021
The Acrobatics of BQP
Scott Aaronson, DeVon Ingram, William Kretschmer
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental dif…
cs.CC2017★ 1 cited
An Upper Bound on the GKS Game via Max Bipartite Matching
DeVon Ingram
The sensitivity conjecture is a longstanding conjecture concerning the relationship between the degree and sensitivity of a Boolean function. In 2015, a communication game was form…