2 citations · 3 across the 6 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2000
Nondeterministic Quantum Query and Quantum Communication Complexities
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…
cs.CC1999
Communication Complexity Lower Bounds by Polynomials
Harry Buhrman, Ronald de Wolf
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower boun…
cs.CC1999
Bounds for Small-Error and Zero-Error Quantum Algorithms
H. Buhrman, R. Cleve, R. de Wolf +1
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-o…