Multiparty quantum communication complexity

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 60, Issue 4, 1999, Pages 2737-2741

  Buhrman, Harry ^a   van Dam, Wim ^a,b   Høyer, Peter ^c   Tapp, Alain ^d  

^a CWI   (Netherlands)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c AARHUS UNIVERSITY   (Denmark)

^d UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000280438     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.60.2737     Document Type: Article

References (11)

1. R. Cleve and H. Buhrman, Phys. Rev. A 56, 1201 (1997).
2. H. Buhrman, R. Cleve, and W. van Dam, e-print quant-ph/9705033.
3. R. Cleve, W. van Dam, M. Nielsen, and A. Tapp, in Proceedings of the first NASA International Conference on Quantum Computing and Quantum Communications, Lecture Notes in Computer Science Vol. 1509 (Springer-Verlag, Berlin, 1999), p. 61.
4. H. Buhrman, R. Cleve, and A. Wigderson, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, Dallas, Texas (The Association for Computing Machinery, New York, 1998), p. 63.
5. A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson, in Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Palo Alto, California (IEEE Computer Society Press, Los Alamitos, CA, 1998), p. 342.
6. R. Raz, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia (The Association for Computing Machinery, New York, 1999), p. 358.
7. N. D. Mermin, Phys. Today 43, 9 (1990).
8. L. K. Grover, e-print quant-ph/9704012.
9. E. Kushilevitz and N. Nisan, Communication Complexity (Cambridge University Press, Cambridge, England, 1997), see pages 3–10 of the first introductionary chapter. Corollary 1.17 states the fact for two parties only: If every partition of (Formula presented) into (Formula presented)-monochromatic rectangles requires (Formula presented) or more rectangles, then the communication complexity of (Formula presented) is at least (Formula presented) It is an easy exercise to generalize this result to any number of parties (Formula presented) The question of additivity is discussed in section 4.1, open problem 4.2. A lower bound for partial functions via monochromatic rectangles is stated as proposition 5.4 in section 5.
10. M. Kneser, Math. Z. 58, 459 (1953)
11. H. B. Mann, Addition Theorems: The Addition Theorems of Group Theory and Number Theory (Wiley, New York, 1965), p. 6.