4.3k citations · 13.4k across the 43 of their papers we have counts for
Showing 1998Show all
2 papers · 1 filter
quant-ph1998★ 83 cited
Quantum vs. Classical Communication and Computation
Harry Buhrman, Richard Cleve, Avi Wigderson
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol f…
quant-ph1998★ 179 cited
Quantum Lower Bounds by Polynomials
Robert Beals, Harry Buhrman, Richard Cleve +2
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the…