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...
| 出版年: | Journal of the ACM 48, 4 (2001). |
|---|---|
| 第一著者: | |
| フォーマット: | 論文 |
| 言語: | English |
| 主題: |