The quantum adversary method and classical formula size lower bounds

Computational Complexity

Volumn 15, Issue 2, 2006, Pages 163-196

  Laplante, Sophie ^a   Lee, Troy ^b   Szegedy, Mario ^c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Adversary method; Communication complexity; Formula size; Lower bounds; Quantum computing

Indexed keywords

EID: 33745312939     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-006-0212-7     Document Type: Conference Paper

References (39)

1. S. AARONSON (2004). Lower bounds for local search by quantum arguments. In Proc. 36th ACM Symposium on the Theory of Computing. ACM.
2. S. AARONSON & Y. SHI (2004). Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51, 595-605.
3. A. AMBAINIS (2002). Quantum lower bounds by quantum arguments. J. Comput. System Sci. 64, 750-767.
4. A. AMBAINIS (2003). Polynomial degree vs. quantum query complexity. In Proc. 44th IEEE Symposium on Foundations of Computer Science, IEEE, 230-239.
5. A. E. ANDREEV (1987). On a method for obtaining more than quadratic effective lower bounds for the complexity of ∏-schemes. Moscow Univ. Math. Bull. 42, 63-65.
6. H. BARNUM, M. SAKS & M. SZEGEDY (2003). Quantum decision trees and semidefinite programming. In Proc. 18th IEEE Conference on Computational Complexity, 179-193.
7. R. BEALS, H. BUHRMAN, R. CLEVE, M. MOSCA & R. DE WOLF (2001). Quantum lower bounds by polynomials. J. ACM 48, 778-797.
8. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD & U. VAZIRANI (1997). Strengths and weaknesses of quantum computing. SIAM J. Comput. 26, 1510-1523.
9. R. BOPPANA (1989). Amplification of probabilistic Boolean formulas. Adv. Comput. Res. 5, 27-45.
10. G. BRASSARD, P. HØYER & A. TAPP (1997). Quantum algorithm for the collision problem. ACM SIGACT News (Cryptology column) 28, 14-19.
11. H. BUHRMAN & R. DE WOLF (2002). Complexity measures and decision tree complexity: A survey. Theoret. Comput. Sci. 288, 21-43.
12. M. DUBINER & U. ZWICK (1997). Amplification by read-once formulas. SIAM J. Comput. 26, 15-38.
13. J. HÅSTAD (1998). The shrinkage exponent is 2. SIAM J. Comput. 27, 48-64.
14. R. A. HORN & C. R. JOHNSON (1999). Matrix Analysis. Cambridge Univ. Press.
15. T. JAYRAM, R. KUMAR & D. SIVAKUMAR (2003). Two applications of information complexity. In Proc. 35th ACM Symposium on the Theory of Computing, ACM, 673-682.
16. M. KARCHMER, E. KUSHILEVITZ & N. NISAN (1995). Fractional covers and communication complexity. SIAM J. Discrete Math. 8, 76-92.
17. M. KARCHMER & A. WIGDERSON (1988). Monotone connectivity circuits require super-logarithmic depth. In Proc. 20th ACM Symposium on the Theory of Computing, 539-550.
18. I. KERENIDIS & R. DE WOLF (2004). Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. System Sci. 69, 395-420.
19. V. M. KHRAPCHENKO (1971). Complexity of the realization of a linear function in the case of ∏-circuits. Math. Notes 9, 21-23.
20. H. KLAUCK (2004). One-way communication complexity and the Nečiporuk lower bound on formula size. Technical Report 0111062, cs.CC arXiv. URL http://www.arxiv.org/abs/cs.CC/0111062.
21. E. KOUTSOUPIAS (1993). Improvements on Khrapchenko's theorem. Theoret. Comput. Sci. 116, 399-403.
22. E. KUSHILEVITZ & N. NISAN (1997). Communication Complexity. Cambridge Univ. Press.
23. S. LAPLANTE & F. MAGNIEZ (2004). Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. In Proc. 19th IEEE Conference on Computational Complexity, IEEE, 294-304.
24. T. LEE (2006). Kolmogorov complexity and formula size lower bounds. Ph.D. thesis, Univ. of Amsterdam.
25. M. LI & P. VITÁNYI (1997). An Introduction to Kolmogorov Complexity and its Applications. 2nd ed., Springer, New York.
26. E. MOSSELL & R. O'DONNELL (2003). On the noise sensitivity of monotone functions. Random Structures Algorithms 23, 333-350.
27. M. NIELSEN & I. CHUANG (2000). Quantum Computation and Quantum Information. Cambridge Univ. Press.
28. N. NISAN (1991). CREW PRAMs and decision trees. SIAM J. Comput. 20, 999-1007.
29. N. NISAN & M. SZEGEDY (1994). On the degree of Boolean functions as real polynomials. Comput. Complexity 4, 301-313.
30. R. O'DONNELL (2002). Hardness amplification within NP. In Proc. 34th ACM Symposium on the Theory of Computing, ACM, 751-760.
31. A. RAZBOROV (1990). Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica 10, 81-93.
32. A. RAZBOROV (1992). On submodular complexity measures. In Boolean Function Complexity, M. Paterson (ed.), London Math. Soc. Lecture Note Ser. 169, Cambridge Univ. Press, 76-83.
33. U. SCHÜRFELD (1983). New lower bounds on the formula size of Boolean functions. Acta Inform. 19, 183-194.
34. P. SEN & S. VENKATESH (2001). Lower bounds in the quantum cell probe model. In Proc. 28th International Colloquium on Automata, Languages and Programming, 358-369.
35. R. ŠPALEK & M. SZEGEDY (2005). All quantum adversary methods are equivalent. In Proc. 32th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 3580, Springer, 1299-1311. Quant-ph/0409116.
36. P. SPIRA (1971). On time-hardware complexity tradeoffs for Boolean functions. In Proc. 4th Hawaii Symposium on System Sciences, Western Periodicals Company, North Hollywood, 525-527.
37. 1.3) quantum algorithm for the triangle finding problem. Technical report. Quant-ph/0310134.
38. L. G. VALIANT (1984). Short monotone formulae for the majority function. J. Algorithms 5, 363-366.
39. S. ZHANG (2005). On the power of Ambainis's lower bounds. Theoret. Comput. Sci. 339, 241-256.