2 citations · 3 across the 6 of their papers we have counts for
1 paper · 2 filters
Ronald de Wolf
We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity…