Quantum and classical query complexities of local search are polynomially related

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 494-501

  Santha, Miklos ^a   Szegedy, Mario ^b  

^a CNRS   (France)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Decision trees; Local optimization; Neighborhood structure; PLO; Quantum computationquery model

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS;

DECISION TREES; LOCAL OPTIMIZATION; NEIGHBORHOOD STRUCTURES; PLO; QUANTUM COMPUTATION; QUERY MODELS;

QUANTUM THEORY;

EID: 4544268402     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007427     Document Type: Conference Paper

References (22)

1. S. Aaronscn. Lower bounds for local search by quantum arguments, these proceedings, 2004, also quant-ph/0307149.
2. S. Aaronson. Quantum lower bound for the collision problem, in Proc. of the 34th ACM Symposium on Theory of Computing, pp. 635-642, 2002.
3. A. Aho, J. Hopcroft, and J Ullman Data Structures and Algorithms, Addison-Wesley, 1983.
4. D. Aldous. Minimization algorithms and random walk on the d-cube, Annals of probability 11(2), pp. 403-413, 1983.
5. A. Ambainis. Quantum lower bounds by quantum arguments, Journal of Computer and System Sciences 64, pp. 750-767, 2002.
6. H. Barnum, M. Saks, and M. Szegedy, Quantum decision trees and semidcfinite programming, in Proc. of the 18th IEEE Conference on Computational Complexity, pp. 179-193, 2003.
7. R. Seals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, Quantum lower bounds by polynomials, Journal of the ACM (48):4, pp. 778-797, 2001.
8. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strength and weaknesses of quantum computing, SIAM Journal on Computing (26):5, pp. 1510-1523, 1997.
9. H. Buhrman, and R. de Wolf, A lower bounds for quantum search of an ordered list. Information and Processing Letters 70, pp 205-209, 1999.
10. D. Deutsch, and R. Jozsa, Rapid solution of problems by quantum computation, in Proc. of the Royal Society A, volume 439, 1985.
11. C. Dürr, and P. Høyer. A quantum algorithm for finding the minimum, quant-ph/9607034, 1996.
12. L. Grover, A fast quantum mechanical algorithm for database search, in Proc. of the 28th ACM Symposium on Theory of Computing, pp. 212-219, 1996.
13. P. Høyer, J. Neerbek, and Y. Shi, Quantum complexities of ordered searching, sorting, and element distinctness, Algorithmic 34(4), pp. 429-448, 2002.
14. D. Johnson, C. Papadimitriou, and M. Yannakakis. How easy is local search, Journal of Computer and System Sciences 37, pp, 429-448. 1988.
15. S. Laplante, and F. Magniez. Lower bounds for randomized and quantum query complexity using Kolmogorov arguments, to appear in Proc, of the 19th IEEE Conference on Computational Complexity, 2004, also quaut-ph/0311189.
16. D. Llewellyn, and C. Tovey. Dividing and conquering the square, Discrete Applied Mathematics 43, pp. 131-153, 1993.
17. D. Llewellyn, C. Tovey, and M. Trick. Local optimization on graphs, Discrete Applied Mathematics 23, pp. 157-178, 1989, Erratum: 46, pp. 93-94, 1993.
18. N. Megiddo, and C. Papadimitriou. On total functions, existence theorems, and computational complexity, Theoretical Computer Science 81, pp. 317-324, 1991.
19. Y. Shi, Quantum lower bounds for the collision and the element distinctness problems, in Proc. of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 513-519, 2002.
20. D. Simon. On the power of quantum computation, SIAM Journal on Computing (26):5, pp. 1474-1783, 1997.
21. Yves Verhoeven, Local optimization over grids, Unpublished manuscript.
22. C. Zalka. Grover's quantum searching algorithm is optimal, Physical Review A 60, pp. 2746-2751, 1999.