Adversary lower bounds for nonadaptive quantum algorithms
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of decision problems. Under traditional complexity assumptions, we obtain an exponential speedup between the quantum and the classical query complexity of function classes.