A note on quantum black-box complexity of almost all Boolean functions

Information Processing Letters

Volumn 71, Issue 1, 1999, Pages 5-7

  Ambainis, Andris ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Computational complexity; Quantum computing

Indexed keywords

EID: 0010437727     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00079-4     Document Type: Article

References (8)

1. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, in: Proc. 39th IEEE Conference on Foundations of Computer Science, 1998, pp. 352-361. Also available at http://xxx.lanl.gov/abs/quant-ph/9802049.
2. W. van Dam, Quantum oracle interrogation: Getting all information for almost half the price, in: Proc. 39th IEEE Conference on Foundations of Computer Science, 1998, pp. 362-367. Also available at http://xxx.lanl.gov/abs/quant-ph/9805006.
3. E. Farhi, J. Goldstone, S. Gutmann, M. Sipser, A limit on the speed of quantum computation in determining parity, Physics Review Lett. 81 (1998) 5442-5444. Also available at http://xxx.lanl.gov/abs/quant-ph/9802045.
4. L. Grover, A fast quantum mechanical algorithm for data-base search, in: Proc. 28th ACM Symposium on Theory of Computing, 1996, pp. 212-219. Also available at http://xxx. lanl.gov/abs/quant-ph/9605043.
5. J. Gruska, Quantum, World Scientific, Singapore, 1999.
6. E. Rieffel, W Polak, An introduction to quantum computing for non-physicists, Submitted to ACM Comput. Surv. Also http://xxx.lanl.gov/abs/quant-ph/9809016.
7. P. Shor, Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (1997) 1484-1509.
8. I. Wegener, Complexity of Boolean Functions, Wiley-Teubner, 1987.