Exponential separation of quantum and classical one-way communication complexity

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 128-137

  Bar Yossef, Ziv ^a   Jayram, T S ^a   Kerenidis, Iordanis ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Communication complexity; Hidden matching; Quantum computation; Separation

Indexed keywords

COMMUNICATION; DATA STRUCTURES; ERROR ANALYSIS; NETWORK PROTOCOLS; PROBLEM SOLVING; SEPARATION;

COMMUNICATION COMPLEXITY; EXPONENTIAL SEPARATION; HIDDEN MATCHING; QUANTUM COMPUTATION;

QUANTUM THEORY;

EID: 4544303934     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007379     Document Type: Conference Paper

References (21)

1. S. Aaronson. Limitations of quantum advice and one-way communication. In Proceedings of the 19th IEEE Conference on Computational Complexity (CCC), 2004. to appear.
2. A. Ambainis, L. J. Schulman, A. Ta-Shma, U. V. Vazirani, and A. Wigderson. The quantum communication complexity of sampling. SIAM J. on Computing, 32(6):1570-1585, 2003.
3. L. Babal and P. G. Kimmel. Randomized simultaneous messages: Solution of a problem of Yao in communication complexity. In Proceedings of the 12th IEEE Conference on Computational Complexity (CCC), pages 239-246, 1997.
4. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16), 2001.
5. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In Proceedings of the 30th A CM Symposium on Theory of Computing (STOC), pages 63-68, 1998.
6. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., 1991.
7. P. Frankl and R. M. Wilson. Intersection theorems with geometric consequences. Combinatorica, 1(4):357-368, 1981.
8. M. Karchmer and A. Wigderson. Monotone circuits for connectivity require super-logarithmic depth. SIAM J. on Computing, 26(5):255-265, 1990.
9. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via quantum argument. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), pages 106-115, 2003.
10. H. Klauck. On quantum and probabilistic communication: Las Vegas and one-way protocols. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pages 644-651, 2000.
11. I. Kremer. Quantum Communication. Master's Thesis, The Hebrew University of Jerusalem, 1995.
12. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
13. I. Newman. Private vs. common random bits in communication complexity. Information Processing Letters, 39:67-71, 1991.
14. I. Newman and M. Szegedy. Public vs. private coin flips in one round communication games. In Proceedings of the 28th ACM Symposium on Theory of Computing (STOC), pages 561-570, 1996.
15. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
16. R. Raz. Exponential separation of quantum and classical communication complexity. In Proceedings of the 31st ACM Symposium on Theory of Computing (STOC), pages 358-367, 1999.
17. P. Sen and S. Venkatesh. Lower bounds in the quantum cell probe model. In Proceedings of the 28th ICALP, volume 2076, pages 358-369, 2001.
18. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. on Computing, 26(5): 1484-1509, 1997.
19. A. C.-C. Yao. Some complexity questions related to distributive computing. In Proceedings of the 11th ACM Symposium on Theory of Computing (STOC), pages 209-213, 1979.
20. A. C.-C. Yao, Lower bounds by probabilistic arguments. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 420-428, 1983.
21. A. C.-C. Yao. Quantum circuit complexity. In Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 352-361, Los Alamitos, CA, 1993.