Exponential separation of quantum and classical one-way communication complexity

SIAM Journal on Computing

Volumn 38, Issue 1, 2008, Pages 366-384

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c CNRS   (France)

Author keywords

Communication complexity; Hidden matching; Quantum computation; Separation

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERRORS; MANGANESE COMPOUNDS; QUANTUM COMPUTERS; SEPARATION;

BOUNDED ERRORS; COMMUNICATION COMPLEXITY; DECISION VERSION; HIDDEN MATCHING; MATCHING PROBLEMS; PERFECT MATCHINGS; SIMULTANEOUS MESSAGES;

QUANTUM COMMUNICATION;

EID: 55249112293     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060651835     Document Type: Article

References (25)

1. S. AARONSON, Limitations of quantum advice and one-way communication, in Proceedings of the 19th IEEE Conference on Computational Complexity (CCC), 2004, pp. 320-332.
2. F. ABLAYEV, Lower bounds for one-way probabilistic communication complexity and their application to space complexity, Theoret. Comput. Sci., 157 (1996), pp. 139-159.
3. A. AMBAINIS, A. NAYAK, A. TA-SHMA, AND U. V. VAZIRANI, Dense quantum coding and quantum finite automata, J. ACM, 49 (2002), pp. 496-511.
4. A. AMBAINIS, L. J. SCHULMAN, A. TA-S HMA, U. VAZIRANI, AND A. WIGDERSON, The quantum communication complexity of sampling, SIAM J. Comput., 32 (2003), pp. 1570-1585.
5. L. BABAI 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), 1997, pp. 239-246.
6. H. BUHRMAN, R. CLEVE, J. WATROUS, AND R. DE WOLF, Quantum fingerprinting, Phys. Rev. Lett., 87 (2001), 167902.
7. H. BUHRMAN, R. CLEVE, AND A. WIGDERSON, Quantum versus classical communication and computation, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), 1998, pp. 63-68.
8. T. M. COVER AND J. A. THOMAS, Elements of Information Theory, John Wiley & Sons, New York, 1991.
9. P. FRANKL AND R. M. WILSON, Intersection theorems with geometric consequences, Combinatorica, 1 (1981), pp. 357-368.
10. D. GAVINSKY, J. KEMPE, O. REGEV, AND R. DE WOLF, Bounded-error quantum state identification and exponential separations in communication complexity, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 2006, pp. 594-603.
11. I. KERENIDIS AND R. DE WOLF, Exponential lower bound for 2-query locally decodable codes via quantum argument, in Proceedings of the 35th ACM Annual Symposium on Theory of Computing (STOC), 2003, pp. 106-115.
12. H. KLAUCK, On quantum and probabilistic communication: Las Vegas and one-way protocols, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 644-651.
13. I. KREMER, Quantum Communication, Master's thesis, The Hebrew University of Jerusalem, Jerusalem, 1995.
14. I. KREMER, N. NISAN, AND D. RON, On randomized one-round communication complexity, Comput. Complexity, 8 (1999), pp. 21-49.
15. E. KUSHILEVITZ AND N. NISAN, Communication Complexity, Cambridge University Press, Cambridge, UK, 1997.
16. I. NEWMAN, Private versus common random bits in communication complexity, Inform. Process. Lett., 39 (1991), pp. 67-71.
17. I. NEWMAN AND M. SZEGEDY, Public versus private coin flips in one round communication games, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 1996, pp. 561-570.
18. M. A. NIELSEN AND I. L. CHUANG, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
19. C. H. PAPADIMITRIOU AND M. SIPSER, Communication complexity, J. Comput. System Sci., 28 (1984), pp. 260-269.
20. R. RAZ, Exponential separation of quantum and classical communication complexity, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), 1999, pp. 358-367.
21. P. SEN AND S. VENKATESH, Lower bounds in the quantum cell probe model, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 2076, Springer-Verlag, Berlin, 2001, pp. 358-369.
22. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
23. A. C-C. YAO, Some complexity questions related to distributive computing, in Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC), 1979, pp. 209-213.
24. A. C-C. YAO, Lower bounds by probabilistic arguments, in Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1983, pp. 420-428.
25. A. C-C. YAO, Quantum circuit complexity, in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 352-361.