4 citations · 7 across the 9 of their papers we have counts for
Showing 1999 · cs.CCShow all
2 papers · 2 filters
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…