On the quantum query complexity of local search in two and three dimensions

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 429-438

  Xiaoming, Sun ^a   Yao, Andrew C ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBABILITY; PROBLEM SOLVING; SEARCH ENGINES;

LOCAL SEARCH; NON-UNIFORM STEP; QUANTUM QUERY COMPLEXITY; RANDOM WALKS;

QUANTUM COMPUTERS;

EID: 38749144402     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.57     Document Type: Conference Paper

References (17)

1. S. Aaronson. Lower bounds for local search by quantum arguments, Proc. of 36th STOC, pp. 465-474, 2004.
2. D. Aldous. Minimization algorithms and random walk on the d-Cube, Annals of Probability 11(2), pp. 403-413, 1983.
3. A. Ambainis. Polynomial degree vs. quantum query complexity, Proc. of 44th FOCS, pp. 230-239, 2003.
4. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computation, SIAM journal on Computing 26, pp. 1510-1523, 1997.
5. R. C. Bose and S. Chowla, Theorems in the additive theory of numbers, Comment. Math. Helv. 37 (1962-63), 141-147.
6. Xi Chen and Xiaotie Deng. On algorithms for discrete and approximate brouwer fixed points, Proc. of 37th STOC, pp. 323-330, 2005.
7. C. G. Esseen. Fourier analysis of distribution functions, Acta Mathematica 77, pp. 1-125, 1945.
8. K. Friedl, G. Ivanyos, M. Santha and Y. Verhoeven. On the black-box Complexity of Sperner's Lemma, 15th FCT, pp. 245-257, 2005.
9. G. Halász. Estimates for the concentration function of combinatorial number theory and probability, Periodica Mathematica Hungarica Vol. 8 (3-4), (1977) 197-211.
10. H. Halberstam and K. F. Roth. Sequences, Oxford, 1966.
11. D. Johnson, C. Papadimitriou, M. Yannakakis. How Easy is Local Search? Journal of Computer System Sciences 37(1) 79-100, 1988.
12. D. Llewellyn, C. Tovey, and M. Trick. Local optimization on graphs, Discrete Applied Mathematics 23:157-178, 1989. Erratum: 46: 93-94, 1993.
13. M. Santha and M. Szegedy. Quantum and classical query complexities of local search are polynomially related, Proc. of 36th STOC, pp. 494-501, 2004.
14. A. Sárközy and E. Szemerédi. Über ein Problem von Erdös und Moser, Acta Arithmetica 11, 1965, 205-208.
15. Y. Verhoeven. Enhanced algorithms for local search, Information Processing Letters 97, 171-176, 2006.
16. Shengyu Zhang. On the power of Ambainis's lower bounds, In Proc. of 31st ICALP, LNCS 3142, pp. 1238-1250, 2004.
17. [ 17] Shengyu Zhang. New upper and lower bounds for randomized and quantum Local Search, Proc. of 38th STOC 2006.