4 citations · 4 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2002★ 4 cited
Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds
M. de Graaf, P. Valiant
We show that an oracle A that contains either 1/4 or 3/4 of all strings of length n can be used to separate EQP from the counting classes MOD_{p^k}P. Our proof makes use of the deg…
quant-ph2001
On Quantum Versions of the Yao Principle
Mart de Graaf, Ronald de Wolf
The classical Yao principle states that the complexity R_epsilon(f) of an optimal randomized algorithm for a function f with success probability 1-epsilon equals the complexity max…