Quantum communication complexity of symmetric predicates

Izvestiya Mathematics

Volumn 67, Issue 1, 2003, Pages 145-159

  Razborov, A A ^a,b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748500069     PISSN: 10645632     EISSN: 14684810     Source Type: Journal    
DOI: 10.1070/IM2003v067n01ABEH000422     Document Type: Article

References (26)

1. A. Ambainis, L. Schulman, A. Ta-Shma, V. Vazirani, and A. Wigderson, "The quantum communication complexity of sampling", Proc. 39th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos 1998, pp. 342-351.
2. R. Deals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, "Quantum lower bounds by polynomials", Proc. 33th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos 1998, pp. 352-361; preliminary version available at quant-ph/9802049.
3. H. Buhrman, R. Cleve, and A. Wigderson, "Quantum vs. classical communication and computation", Proc. 30th ACM Symposium on the Theory of Computing, ACM Press, New York 1998, pp. 63-86; preliminary version available at quant-ph/9802040.
4. L. Babai, P. Frankl, and J. Simon, "Complexity classes in communication complexity theory", Proc. 27th IEEE Symposium on foundations of Computer Science, IEEE Computer Society, Los Alamitos 1986, pp. 337-347.
5. R. Bhatia, Matrix analysis, Graduate Texts in Math, vol. 169, Springer-Verlag, Berlin-New York 1997.
6. H. Buhrman and R. de Wolf, "Complexity measures and decision tree complexity: a survey", Theoret. Comput. Sci. 288 (2000), 21-43.
7. H. Buhrman and R. de Wolf, "Communication complexity lower bounds by polynomials", Proc. 16th IEEE Conference on Computational Complexity, IEEE Computer Society, Los Alamitos 2001, pp. 120-130; preliminary version available at cs.CC/9910010.
8. R. Cleve and II. Buhrman, "Substituting quantum entanglement for communication", Phys. Rev. A 56 (1997), 1201-1204; preliminary version available at quant-ph/9704026.
9. R. Cleve, W. van Dam, M. Nielsen, and A. Tapp, "Quantum entanglement and the communication complexity of the inner product function", Proc. of the 1st NASA QCQC Conference, Lecture Notes in Computer Science, vol. 1509, Springer-Verlag, New York-Berlin 1998, pp. 61-74; preliminary version available at quant-ph/9708019.
10. B. Chor and O. Goldreich, "Unbiased bits from sources of weak randomness and probabilistic communication complexity", SIAM J. Comput. 17 (1988), 230-261.
11. P. Delsarte, "Hahn polynomials, discrete harmonics and t-designs", SIAM J. Appl. Math. 34:1 (1978), 157-166.
12. L. K. Grover, "A fast quantum mechanical algorithm for database search", Proc. 28th ACM Symposium on the Theory of Computing, ACM Press, New York 1996, pp. 212-219; preliminary version available at quant-ph/9605043.
13. P. Høyer and R. de Wolf, "Improved quantum communication complexity bounds for disjointness and equality", Proc. 19th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 2607, Springer-Verlag, Berlin-New York 2002, pp. 299-310; preliminary version available at quant-ph/0109068.
14. H. Klauck, "Lower bounds for quantum communication complexity", Proc. 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos 2001. pp. 288-297; preliminary version available at quant-ph/0106160.
15. H. Klauck, A. Nayak, A. Ta-Shma, and D. Zuckerman, Interaction in quantum communication and the complexity of set disjointness", Proc. 33rd ACM Symposium on the Theory of Computing, ACM Press, New York 2001, pp. 124-133.
16. D. Knuth, Combinatorial matrices, Manuscript available at http://www-cs-faculty.stanford.edu/~knuth/preprints.html#unpub, 1991.
17. I. Kremer, Quantum communication, Master's thesis, Hebrew University, Jerusalem 1995.
18. B. Kalyanasundaram and G. Schnitger, "The probabilistic communication complexity of set intersection", SIAM J. Discrete Math. 5 (1992), 545-557.
19. K. Mehlhorn and E. M. Schmidt, "Las Vegas is better than determinism in VLSI and distributive computing", Proc. 14th ACM Symposium on the Theory of Computing, ACM Press, New York 1982, pp. 330-337.
20. N. Nisan and M. Szegedy, "On the degree of Boolean functions as real polynomials", Comput. Complexity 4 (1994), 301-313.
21. A. Nayak and J. Salzman, "On communication over an entanglement-assisted quantum channel", Proc. 34th ACM Symposium on the Theory of Computing, ACM Press, New York 2002.
22. R. Paturi, "On the degree of polynomials that approximate symmetric Boolean functions", Proc. 24th ACM Symposium on the Theory of Computing, ACM Press, New York 1992, pp. 468-474.
23. A. Razborov, "On the distributional complexity of disjointness", Theoret. Comput. Sci. 106 (1992), 385-390.
24. U. Vazirani, "Towards a strong communication complexity theory of generating quasi-random sequences from two communicating slightly-random sources", Combinatorica 7 (1987), 375-392.
25. A. Yao, "Some complexity questions related to distributive computing", Proc. 11th ACM Symposium on the Theory of Computing, ACM Press, New York 1979, pp. 209-213.
26. A. Yao, "Quantum circuit complexity", Proc. 34th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos 1993, pp. 352-361.