Quantum lower bounds by polynomials.
We examine the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model. We show that the exponential quantum speed-up obtained for partial functions (i.e., problems involving a promise on the input) by Deutsch and Jozsa, Si...
| I publikationen: | Journal of the ACM 48, 4 (2001). |
|---|---|
| Huvudupphovsman: | |
| Materialtyp: | Artikel |
| Språk: | English |
| Ämnen: |