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…