Quantum identification of boolean oracles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 105-116

  Ambainis, Andris ^a   Iwama, Kazuo ^b,c   Kawachi, Akinori ^b,c   Masuda, Hiroyuki ^b,c   Putra, Raymond H ^b,c   Yamashita, Shigeru ^d  

^a UNIVERSITY OF LATVIA   (Latvia)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c KYOTO UNIVERSITY   (Japan)

^d NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BLACK BOXES; IDENTIFICATION PROBLEM; QUANTUM IDENTIFICATIONS; QUANTUM QUERY COMPLEXITY; QUERY COMPLEXITY; RANDOM ORACLE; UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 35048857840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_10     Document Type: Article

References (27)

1. S. Aaronson. Quantum lower bound for the collision problem. In Proceedings of the 34th Symposium on Theory of Computing, pages 635-642, 2002.
2. S. Aaronson. Lower bounds for local search by quantum arguments. In quantph/0307149, 2003.
3. S. Aaronson and A. Ambainis. Quantum search of spatial regions. In Proceedings of the 44th Symposium on Foundations of Computer Science, pages 200-209, 2003.
4. A. Ambainis. Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences, 64:750-767, 2002.
5. A. Ambainis. Polynomial degree vs. quantum query complexity. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pages 230-239, 2003.
6. A. Ambainis. Quantum walks and a new quantum algorithm for element distinctness. In quant-ph/0311001, Invited talk in EQIS 2003, 2003.
7. H. Barnum and M. Saks. A lower bound on the quantum complexity of read-once functions. In Electronic Colloquium on Computational Complexity, 2002.
8. H. Barnum, M. Saks, and M. Szegedy. Quantum query complexity and semi-definite programming. In Proceedings of the 18th IEEE Conference on Computational Complexity, pages 179-193, 2003.
9. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. In Proceedings of 39th IEEE Symposium on Foundation of Computer Science, pages 352-361, 1998.
10. D. Biron, O. Biham, E. Biham, M. Grassl, and D. A. Lidar. Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution. In Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communication, LNCS, Vol. 1509, Springer-Verlag, pages 140-147, 1998.
11. G. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM J. Comput., 26(5):1510-1523, 1997.
12. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte der Physik, vol. 46(4-5), 493-505, 1998.
13. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha and R. de Wolf. Quantum Algorithms for Element Distinctness. In Proceedings of the 16th IEEE Annual Conference on Computational Complexity (CCC'01), pages 131-137, 2001.
14. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comput., 26(5):1411-1473, October 1997.
15. G. Brassard, P. Høyer, M. Mosca, A. Tapp. Quantum Amplitude Amplification and Estimation. In AMS Contemporary Mathematics Series Millennium Volume entitled "Quantum Computation and Information", to appear.
16. D. P. Chi and J. Kim. Quantum Database Searching by a Single Query. In Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communication, LNCS, Vol. 1509, Springer-Verlag, pages 148-151, 1998.
17. C. Dürr, M. Mhalla, and Y. Lei. Quantum query complexity of graph connectivity. In quant-ph/0303169, 2003.
18. W. van Dam. Quantum oracle interrogation: getting all information for almost half the price. In Proceedings of the 39th IEEE Symposium on the Foundation of Computer Science, pages 362-367, 1998.
19. D. Deutsch, R. Jozsa. Rapid solutions of problems by quantum computation. In Proceedings of the Royal Society, London, Series A, 439, pages 553-558, 1992.
20. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. A Limit on the Speed of Quantum Computation in Determining Parity. Phys. Rev. Lett. 81, 5442-5444, 1998.
21. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. How many functions can be distinguished with k quantum queries? Phys. Rev. A 60, 6, 4331-4333, 1999.
22. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th ACM Symposium on Theory of Computing, pages 212-219, 1996.
23. L. K. Grover. A framework for fast quantum mechanical algorithms. In Proceedings of the 30th ACM Symposium on Theory of Computing, pages 53-62, 1998.
24. L. K. Grover. Rapid sampling through quantum computing. In Proceedings of the 32th ACM Symposium on Theory of Computing, pages 618-626, 2000.
25. A. Nayak and F. Wu. The quantum query complexity of approximating the median and related statistics. In Proceedings of the 31th ACM Symposium on Theory of Computing, pages 384-393, 1999.
26. Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. In Proceedings of the 43rd IEEE Symposium on the Foundation of Computer Science, pages 513-519, 2002.
27. U. Vazirani. On the power of quantum computation. Philosophical Transaction of the Royal Society of London, Series A, (356):1759-1768, 1998.