no code implementations • 18 Feb 1998 • Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
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.
Quantum Physics Computational Complexity
