63 citations · 217 across the 21 of their papers we have counts for
Showing 2021Show 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…
quant-ph2021★ 35 cited
Quantum Pseudorandomness and Classical Complexity
William Kretschmer
We construct a quantum oracle relative to which but cryptographic pseudorandom quantum states and pseudorandom unitary transformations exist, a counte…