Sciweavers

Share
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
9 years 6 months 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
books