Sciweavers

ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
14 years 10 days ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous