On the power of Ambainis lower bounds

Theoretical Computer Science

Volumn 339, Issue 2-3, 2005, Pages 241-256

  Zhang, Shengyu ^a  

^a Princeton University   (United States)

Author keywords

Lower bound technique; Quantum adversary method; Quantum computing; Quantum query complexity

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ERROR DETECTION; FUNCTIONS; SET THEORY;

LOWER BOUND TECHNIQUES; QUANTUM ADVERSARY METHOD; QUANTUM COMPUTING; QUANTUM QUERY COMPLEXITY;

COMPUTABILITY AND DECIDABILITY;

EID: 18544371325     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.01.019     Document Type: Article

References (31)

1. S. Aaronson Quantum lower bound for the collision problem Proc. 34th Annu. ACM Symp. on Theory of Computing 2002 635 642
2. S. Aaronson Lower bounds for local search by quantum arguments Proc. 36th Annu. ACM Symp. on Theory of Computing 2004 465 474
3. A. Ambainis Quantum lower bounds by quantum arguments J. Comput. System Sci. 64 2002 750 767
4. A. Ambainis Polynomial degree vs quantum query complexity Proc. 44th Annu. IEEE Symp. on Foundations of Computer Science 2003 230 239
5. A. Ambainis, Quantum query algorithms and lower bounds, Proc. FOTFS III, to appear.
6. A. Ambainis, Quantum lower bounds for collision and element distinctness with small range, quant-ph/0305179.
7. A. Ambainis, Quantum walk algorithmn for element distinctness, Proc. 45th Annu. IEEE Symp. on Foundations of Computer Science, 2004, pp. 22-31.
8. H. Barnum, M. Saks. A lower bound on the quantum query complexity of read-once functions, J. Comput. System Sci. 69 (2) (2004) 244-258.
9. H. Barnum, M. Saks, and M. Szegedy Quantum query complexity and semidefinite programming Proc. 18th Annu. IEEE Conf. on Computational Complexity 2003 179 193
10. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. deWolf Quantum lower bounds by polynomials J. ACM 48 2001 778 797
11. Berzina, Dubrovsky, Freivalds, Lace, and Scegulnaja Quantum query complexity for some graph problems Proc. 30th Conf. on Current Trends in Theory and Practice of Computer Science 2004 140 150
12. H. Buhrman, R. Cleve, and A. Wigderson Quantum vs. classical communication and computation Proc. 34th Annu. ACM Symp. on Theory of Computing 1998 63 68
13. H. Buhrman, Ch. Durr, M. Heiligman, P. Hoyer, F. Magniez, M. Santha, and R. de Wolf Quantum algorithms for element distinctness Proc. 18th Annu. IEEE Conf. on Computational Complexity 2001 131 137
14. H. Buhrman, and R. de Wolf Complexity measures and decision tree complexity: a survey Theoret. Comput. Sci. 288 1 2002 21 43
15. D. Deutsch, and R. Jozsa Rapid solution of problems by quantum computation Proc. Royal Society of London A 439 1992 553 558
16. C. Durr, M. Heiligman, P. Hoyer, and M. Mhalla Quantum query complexity of some graph problems Proc. 31st Int. Coll. on Automata, Languages, and Programming 2004 481 493
17. L. Grover A fast quantum mechanical algorithm for database search Proc. 28th Annu. ACM Symp. on the Theory of Computing 1996 212 219
18. P. Hoyer, J. Neerbek, and Y. Shi Quantum lower bounds of ordered searching sorting and element distinctness, Algorithmica 34 2002 429 448
19. S. Laplante, F. Magniez, Lower bounds for randomized and quantum query complexity using Kolmogorov arguments, Proc. 19th Annu. IEEE Conf. on Computational Complexity, 2004, pp. 294-304. Preliminary version at quant-ph/0311189.
20. A. Nayak, and F. Wu The quantum query complexity of approximating the median and related statistics Proc. 31st Annu. ACM Symp. on the Theory of Computing 1999 384 393
21. R. Paturi On the degree of polynomials that approximate symmetric Boolean functions Proc. 24th Annu. ACM Symp. on the Theory of Computing 1992 468 474
22. A. Razborov, Quantum communication complexity of symmetric predicates, Izvestiya of the Russian Academy of Science, Mathematics, 2002.
23. M. Saks, and A. Wigderson Probabilistic Boolean decision trees and the complexity of evaluating game trees Proc. 27th Annu. Symp. on Foundations of Computer Science 1986 29 38
24. M. Santha On the Monte Carlo Boolean decision tree complexity of read-once formulae Proc. 6th Annu. Struct. in Complexity Theory Conference 1991 180 187
25. Y. Shi Quantum lower bounds for the collision and the element distinctness problems Proc. 43rd Symp. on Foundations of Computer Science 2002 513 519
26. P. Shor Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer SIAM J. Comput. 26 1997 1484 1509
27. D. Simon On the power of quantum computation SIAM J. Comput. 26 1997 1474 1483
28. R. Spalek, M. Szegedy, All quantum adversary methods are equivalent. quant-ph/0409116.
29. X. Sun, A.C. Yao, and S. Zhang Graph property and circular functions: how low can quantum query complexity go? Proc. 19th Annu. IEEE Conf. on Computational Complexity 2004 286 293
30. W. van Dam Quantum oracle interrogation: getting all information for almost half the price Proc. 39th IEEE Symp. on Foundations of Computer Science 1998 362 367
31. S. Zhang, On the power of Ambainis' lower bounds, quant-ph/0311060.