On the power of Ambainis's lower bounds

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

Volumn 3142, Issue , 2004, Pages 1238-1250

  Zhang, Shengyu ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BI-PARTITE GRAPH MATCHING; BIPARTITENESS; GRAPH MATCHINGS; LOWER BOUND METHOD; POLYNOMIAL METHODS; QUANTUM LOWER BOUNDS; QUANTUM QUERY COMPLEXITY; SPECIFIC PROBLEMS;

QUANTUM THEORY;

EID: 35048873806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_102     Document Type: Article

References (33)

1. S. Aaronson. Quantum lower bound for the collision problem. Proceedings of STOC'02, pp. 635-642. Also quant-ph/0111102.
2. S. Aaronson. Lower bounds for local search by quantum arguments, to appear in STOC'04. Also quant-ph/0307149
3. A. Ambainis. A better lower bound for quantum algorithms searching an ordering list. FOGS'99, p.352-357. Also quant-ph/9902053
4. A. Ambainis. Polynomial degree vs. quantum query complexity, FOCS'03, 2003. Earlier version at quant-ph/0305028
5. A. Ambainis. Quantum lower bounds by quantum arguments, J. Comput. Sys. Sci. 64:750-767, 2002. Earlier version at STOC'00
6. A. Ambainis. Quantum query algorithms and lower bounds, Proceedings of FOTFS III, to appear
7. A. Ambainis. Quantum lower bounds for collision and element distinctness with small range, quant-ph/0305179
8. A. Ambainis. Quantum walk algorithmn for element distinctness, quantph/0311001
9. H. Barnum, M. Saks. A lower bound on the quantum query complexity of read-once functions, to appear in Journal of Computer and System Science. Earlier version at ECCC TR02-002, 2002
10. H. Barnum, M. Saks, M. Szegedy. Quantum query complextiy and semidefinite programming, IEEE Conference on Computational Complexity 2003
11. R. Deals, H. Buhrman, R. Cleve, M.Mosca, R. deWolf. Quantum lower bounds by polynomials. Journal of ACM, 48: 778-797, 2001. Earlier versions at FOCS'98 and quant-ph/9802049
12. Berzina, Dubrovsky, Freivalds, Lace and Scegulnaja, Quantum query complexity for some graph problems. SOFSEM 2004: 140-150
13. H. Buhrman, R. Cleve, A. Wigderson, Quantum vs. classical communication and computation, STOC, 63-68. quant-ph/9802040
14. H. Buhrman, Durr, Ch., M. Heiligman, P. Hoyer, F. Magniez, M. Santha, R. De Wolf, Quantum algorithms for element distinctness, Complexity'01 131-137, quant-ph/0007016.
15. H. Buhrman, R. de Wolf. Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, Volume 288, Issue 1,9 October 2002, Pages 21-43
16. D. Deutsch, R. Jozsa. Rapid solution of problems by quantum computation. Proceeding of the Royal Society of London, A439(1992), 553-558
17. C. Durr, M. Heiligman, P. HØyer, M. Mhalla, and Y. Lei. Quantum query complexity of some graph problems. Manuscript, 2003, cited by [21]
18. C. Durr, M. Mhalla, Y. Lei. Quantum query complexity of graph connectivity, quant-ph/0303169
19. L. Grover. A fast quantum mechaqnical algorithm for database search, STOC'96, 212-219
20. P. HØyer, J. Neerbek, Y. Shi. Quantum lower bounds of ordered searching, sorting and element distinctness. Algorithmica, 34: 429-448, 2002. Eearlier versions at ICALP'01 and quant-ph/0102078
21. S. Laplante, F. Magniez. Lower bounds for randomized and quantum query complexity using Kolmogorov arguments, quant-ph/0311189
22. 1.3) quantum algorithm for the Triangle problem, quant-ph/0310134
23. A. Nayak, F. Wu. The quantum query complexity of approximating the median and related statistics. Proceedings of STOC'99, pp. 384-393, also quant-ph/9804066.
24. R. Paturi. On the degree of polynomials that approximate symmetric Boolean functions, STOC'92, 468-474.
25. A. Razborov. Quantum communication complexity of symmetric predicates, Izvestiya of the Russian Academy of Science, mathematics, 2002. also quant-ph/0204025.
26. M. Saks, A. Wigderson. Probabilistic boolean decision trees and the complexity of evaluating game trees. FOCS 1986, pp. 29-38.
27. M. Santha. On the Monte Carlo Boolean decision tree complexity of read-once formulae. Structures 1991, pp. 180-187.
28. Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. FOCS'02, 513-519, Earlier version at quant-ph/0112086
29. P. Shor. Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26:1484-1509, 1997
30. Mario Szegedy. On the quantum query complexity of detecting triangles in graphs, quant-ph/0310107
31. Mario Szegedy. A note on the limitations of quantum adversary method, manuscript
32. Andrew Yao, Shengyu Zhang. Graph property and circular functions: how low can quantum query complexity go?
33. Shengyu Zhang. On the power of Ambainis's lower bounds, quant-ph/0311060