A lower bound for the bounded round quantum communication complexity of set disjointness

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

Volumn 2003-January, Issue , 2003, Pages 220-229

  Jain, R ^a   Radhakrishnan, J ^b   Sen, P ^c  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^b CWI   (Netherlands)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Books; Career development; Combinatorial mathematics; Complexity theory; Computer science; Distributed computing; Protocols; Quantum computing; Scholarships; Upper bound

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; EMPLOYMENT; INFORMATION THEORY; NETWORK PROTOCOLS; QUANTUM COMPUTERS; QUANTUM OPTICS;

BOOKS; CAREER DEVELOPMENT; COMPLEXITY THEORY; QUANTUM COMPUTING; SCHOLARSHIPS; UPPER BOUND;

QUANTUM COMMUNICATION;

EID: 84892588023     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238196     Document Type: Conference Paper

References (38)

1. S. Aaronson and A. Ambainis. Quantum search of spatial regions. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. To appear. Also quant-ph/0303041.
2. D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 20-30, 1998. Also quant-ph/9806029.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
4. H. W. Buhrman, R. Cleve, and Avi Wigderson. Quantum vs classical communication and computation. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 63-68, 1998. Also quantph/9702040.
5. H. Buhrman and R. de Wolf. Communication complexity lower bounds by polynomials. In Proceedings of the 16th IEEE Conference on Computational Complexity, pages 120-130, 2001.
6. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pages 337-347, 1986.
7. Z. Bar-Yossef, T. Jayram, R. Kumar, and D. Sivakumar. Information theory methods in communication complexity. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity, pages 93-102, 2002.
8. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 209-218, 2002.
9. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal of Computing, 17(2):230-261, 1988.
10. A. Chakrabarti, S. Khot, and X. Sun. Near-optimal lower bounds on the multiparty communication complexity of set-disjointness. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity, 2003.
11. A. Chakrabarti, Y. Shi, A. Wirth, and A. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 270-278, 2001.
12. R. Cleve, Wim van Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communications, Lecture Notes in Computer Science, vol. 1509, pages 61-74. Springer-Verlag, 1998. Also quantph/9708019.
13. D. Dacunha-Castelle, H. Heyer, and B. Roynette. Ecole d'Eté de Probabilités de Saint-Flour VII. Lecture Notes in Mathematics, vol. 678. Springer-Verlag, 1978.
14. 1-difference algorithm for massive data streams. SIAM Journal of Computing, 32:131-151, 2002.
15. C. A. Fuchs and J. van de Graaf. Cryptographic distinguishability measures for quantum mechanical states. IEEE Transactions on Information Theory, 45(4):1216-1227, 1999. Also quant-ph/9712042.
16. A. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast small space algorithms for approximate histogram maintenance. In Proceedings of the 34th Annual ACM Symposium Theory of Computing, pages 389-398, 2002.
17. S. Guha, N. Mishra, Rajeev Motwani, and L. O'Callaghan. Clustering data streams. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 359-366, 2000.
18. P. Hoyer and R. de Wolf. Improved quantum communication complexity bounds for disjointness and equality. In Symposium on Theoretical Aspects of Computer Science, pages 299-310, 2002. Also quant-ph/0109068.
19. P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computations. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 189-197, 2000.
20. T.S. Jayram, R. Kumar, and D. Sivakumar. Two applications of information complexity. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 673-682, 2003.
21. M. Karchmer, E. Kushilevitz, and N. Nisan. Fractional covers and communication complexity. SIAM Journal on Discrete Mathematics, 8(1):76-92, 1995.
22. H. Klauck. Lower bounds for quantum communication complexity. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 288-297, 2001. Also at quant-ph/0106160.
23. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997.
24. H. Klauck, A. Nayak, Amnon Ta-Shma, and D. Zuckerman. Interaction in quantum communication and the complexity of set disjointness. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 124-133, 2001.
25. I. Kremer. Quantum communication. Master's thesis, Hebrew University, 1995.
26. Bala Kalyansundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, 5(4):545-557, 1992.
27. J Lin. Divergence measures based on Shannon entropy. IEEE Transactions on Information Theory, 37(1):145-151, 1991.
28. R.J. Lipton and R. Sedgewick. Lower bounds for VLSI. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pages 300-307, 1981.
29. P. Bro Miltersen, Noam Nisan, S. Safra, and A. Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998.
30. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 369-376, 1999.
31. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
32. N. Nisan. The communication complexity of approximate set packing and covering. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 2380, pages 868-875, 2002.
33. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106(2):385-390, 1992.
34. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya Math, 6, 2002. In Russian. To appear. English version at quant-ph/0204025.
35. P. Sen. Lower bounds for predecessor searching in the cell probe model. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity, 2003.
36. M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 360-369, 2002.
37. A. Yao. Some complexity questions related to distributed computing. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing, pages 209-213, 1979.
38. A. Yao. Quantum circuit complexity. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 352-361, 1993.