Improved quantum communication complexity bounds for disjointness and equality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2285, Issue , 2002, Pages 299-310

  Høyer, Peter ^a   De Wolf, Ronald ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BOUNDED ERRORS; DISJOINTNESS; LOWER BOUNDS; NEW PROTOCOL; NON-DETERMINISTIC PROTOCOL; QUANTUM COMMUNICATION COMPLEXITY;

QUANTUM COMMUNICATION;

EID: 84937432486     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_24     Document Type: Conference Paper

References (36)

1. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley-Interscience, 1992.
2. A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson. The quantum communication complexity of sampling. In Proceedings of 39th IEEE FOCS, pages 342–351, 1998.
3. L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proceedings of 27th IEEE FOCS, pages 337–347, 1986.
4. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. In Proceedings of 39th IEEE FOCS, pages 352–361, 1998. quant-ph/9802049.
5. C. Bennett and S. Wiesner. Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters, 69:2881–2884, 1992.
6. G. Brassard. Quantum communication complexity (a survey). quant-ph/0101005, 1 Jan 2001.
7. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. quant-ph/0005055. To appear in Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Mathematics Series, 15 May 2000.
8. H. Buhrman. Quantum computing and communication complexity. EATCS Bulletin, pages 131–141, February 2000.
9. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In Proceedings of 30th ACM STOC, pages 63–68, 1998. quant-ph/9802040.
10. H. Buhrman, W. van Dam, and R. Cleve. Quantum entanglement and communication complexity. SIAM Journal on Computing, 30(6):1829–1841, 2001. quant-ph/9705033.
11. H. Buhrman, W. van Dam, P. Høyer, and A. Tapp. Multiparty quantum communication complexity. Physical Review A, 60(4):2737–2741, 1999. quant-ph/9710054.
12. H. Buhrman, Ch. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. In Proceedings of 16th IEEE Conference on Computational Complexity, pages 131–137, 2001. quant-ph/0007016.
13. H. Buhrman and R. de Wolf. Communication complexity lower bounds by polynomials. In Proceedings of 16th IEEE Conference on Computational Complexity, pages 120–130, 2001. cs.CC/9910010.
14. R. Cleve and H. Buhrman. Substituting quantum entanglement for communication. Physical Review A, 56(2):1201–1204, 1997. quant-ph/9704026.
15. R. Cleve, W. van Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. In Proceedings of 1st NASA QCQC conference, volume 1509 of Lecture Notes in Computer Science, pages 61–74. Springer, 1998. quant-ph/9708019.
16. W. van Dam. Quantum oracle interrogation: Getting all information for almost half the price. In Proceedings of 39th IEEE FOCS, pages 362–367, 1998. quant-ph/9805006.
17. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. A limit on the speed of quantum computation in determining parity. Physical Review Letters, 81:5442–5444, 1998. quant-ph/9802045.
18. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of 28th ACM STOC, pages 212–219, 1996. quant-ph/9605043.
19. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.
20. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Computing, 5(4):545–557, 1992.
21. H. Klauck. On quantum and probabilistic communication: Las Vegas and one-way protocols. In Proceedings of 32nd ACM STOC, pages 644–651, 2000.
22. H. Klauck. Quantum communication complexity. In Proceedings of Workshop on Boolean Functions and Applications at 27th ICALP, pages 241–252, 2000. quant-ph/0005032.
23. H. Klauck. Lower bounds for quantum communication complexity. In Proceedings of 42nd IEEE FOCS, pages 288–297, 2001. quant-ph/0106160.
24. H. Klauck, A. Nayak, A. Ta-Shma, and D. Zuckerman. Interaction in quantum communication and the complexity of set disjointness. In Proceedings of 33rd ACM STOC, pages 124–133, 2001.
25. I. Kremer. Quantum communication. Master’s thesis, Hebrew University, Computer Science Department, 1995.
26. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
27. S. Massar, D. Bacon, N. Cerf, and R. Cleve. Classical simulation of quantum entanglement without local hidden variables. Physical Review A, 63(5):052305, 2001. quant-ph/0009088.
28. M. A. Nielsen. Quantum Information Theory. PhD thesis, University of New Mexico, Albuquerque, 1998. quant-ph/0011036.
29. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
30. R. Raz. Exponential separation of quantum and classical communication complexity. In Proceedings of 31st ACM STOC, pages 358–367, 1999.
31. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106(2):385–390, 1992.
32. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484–1509, 1997. quant-ph/9508027.
33. A. Ta-Shma. Classical versus quantum communication complexity. ACM SIGACT News (Complexity Column 23), pages 25–34, 1999.
34. R. de Wolf. Characterization of non-deterministic quantum query and quantum communication complexity. In Proceedings of 15th IEEE Conference on Computational Complexity, pages 271–278, 2000. cs.CC/0001014.
35. A. C.-C. Yao. Some complexity questions related to distributive computing. In Proceedings of 11th ACM STOC, pages 209–213, 1979.
36. A. C.-C. Yao. Quantum circuit complexity. In Proceedings of 34th IEEE FOCS, pages 352–360, 1993.