Quantum entanglement and communication complexity

SIAM Journal on Computing

Volumn 30, Issue 6, 2000, Pages 1829-1841

  Buhrman, Harry ^a,b   Cleve, Richard ^c   Van Dam, W I M ^d  

^a CWI   (Netherlands)

^b UNIVERSITY OF CALGARY   (Canada)

^c Canada's NSERC   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Communication complexity; Complexity theory; Quantum computing

Indexed keywords

COMPUTER SIMULATION; ELECTRON ENERGY LEVELS; ELEMENTARY PARTICLES; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS; QUANTUM THEORY; RANDOM PROCESSES;

COMMUNICATION COMPLEXITY; COMPLEXITY THEORY; HADAMARD TRANSFORM; QUANTUM COMPUTING; QUANTUM ENTANGLEMENT;

COMPUTATIONAL COMPLEXITY;

EID: 0035704498     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539797324886     Document Type: Article

References (35)

1. A. AMBAINIS, L.J. SCHULMAN, A. TA-SHMA, U. VAZIRANI, AND A. WIGDERSON, The quantum communication complexity of sampling, in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 342-351.
2. L. BABAI, P.G. FRANKL, AND J. SIMON, Complexity classes in communication complexity theory, in Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 337-347
3. J.S. BELL, On the Einstein-Podolsky-Rosen paradox, Physics, 1 (1964), pp. 195-200.
4. G. BRASSARD, R. CLEVE, AND A. TAPP, Cost of exactly simulation quantum entanglement with classical communication, Phys. Rev. Lett., 83 (1999), pp. 1874-1877
5. H. BuHRMAN, R. CLEVE, AND A. WIGDERSON, Quantum vs. classical communication and computation, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 63-68.
6. H. BUHRMAN, W. VAN DAM, P. HOYER, AND A. TAPP, Multiparty quantum communication complexity, Phys. Rev. A, 60 (1999), pp. 2737-2741.
7. H. BUHRMAN AND R. DE WOLF, Communication complexity lower bounds by polynomials, in Proceedings of the 16th Annual Conference on Computational Complexity, 2001, to appear.
8. J.F. CLAUSER, M.A. HöRNE, A. SIIIMONY, AND R.A. HOLT, Proposed experiment to test local hidden-variable theories, Phys. Rev. Lett., 23 (1969), pp. 880-884.
9. R. CLEVE AND H. BUHRMAN, Substituting quantum entanglement for communication, Phys. Rev. A, 5G (1997), pp. 1201-1204.
10. R. CLEVE, W. VAN DAM, M. NIELSEN, AND A. TAPP, Quantum entanglement and the communication complexity of the inner product function, in Proceedings of the First NASA International Conference on Quantum Computing and Quantum Communications, Colin P. Williams, ed., Lecture Notes in Comput. Sei. 1509, Springer-Verlag, Berlin, 1999, pp. 61-74.
11. D. DEUTSCH AND R. JOZSA, Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A, 439 (1992), pp. 553-558.
12. A. EINSTEIN, The Born-Einstein Letters; Correspondence between Albert Einstein and Max and Hedwig Born from 1916 to 1955, Walker, New York, 1971.
13. A. EINSTEIN, B. PODOLSKY, AND N. ROSEN, Can quantum-mechanical description of physical reality be complete?, Phys. Rev., 47 (1935), pp. 777-780.
14. D.M. GREENBERGER, M. HöRNE, AND A. ZEILINGER, Going beyond Bell's theorem, in Bell's Theorem, Quantum Theory, and Conceptions of the Universe, M. Kafatos, ed., Kluwer Academic, Dordrecht, 1989, pp. 69-72.
15. L.K. GROVER, Quantum Telecomputation, quant-ph archive, report 9704012, 1997.
16. P. HAUSLADEN, R. JOZSA, B. SCHUMACHER, M. WESTMORELAND, AND W.K. WOOTTERS, Classical information capacity of a quantum channel, Phys. Rev. A (3), 54 (1996), pp. 1869-1876.
17. A.S. HOLEVO, Some estimates of the information transmitted by quantum communications channels, Problemy Peredachi Informatsii, 9 (1973), pp. 3-11,
18. Problems of Information Transmission (USSR), 9 (1973), pp. 177-183 (in English).
19. B. KALYANASUNDARAM AND G. SCHNITGER, The probabilistic communication complexity of set intersection, SIAM J. Discrete Math., 5 (1992), pp. 545-557.
20. A. KITAEV AND J. WATROUS, Parallelization, amplification, and exponential time simulation of quantum interactive proof systems, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 608-617.
21. 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, 2000, pp. 644-651.
22. H. KLAUCK, A. NAYAK, A. 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, 2001, to appear.
23. I. KREMER, Quantum Communication, Master's thesis, Hebrew University of Jerusalem, Jerusalem, Israel, 1995.
24. E. KUSHILEVITZ AND N. NiSAN, Communication Complexity, Cambridge University Press, Cambridge, UK, 1997.
25. S. MASSAR, D. BACON, N. CERF, AND R. CLEVE, Classical simulation of quantum entanglement without local hidden variables, Phys. Rev. A, to appear.
26. N.D. MERMIN, 7s the moon there when nobody looks? Reality and the quantum theory, Phys. Today, 38 (1985), pp. 38-47.
27. N.D. MERMIN, What's wrong with these elements of reality?, Phys. Today, 43 (1990), pp. 9-11.
28. [27J R. RAZ, Exponential separation of quantum and classical communication complexity, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 358-367.
29. A.A. RAZBOROV, On the distributional complexity of disjointness, Theoret. Comput. Sei., 6 (1992), pp. 385-390.
30. J. WATROUS, PSPACE has constant-round quantum interactive proof systems, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 341-351.
31. J.A. WHEELER AND W.H. ZUREK, EDS., Quantum Theory and Measurement, Princeton University Press, Princeton, NJ, 1983.
32. R. DE WOLF, Characterization of non-deterministic quantum query and quantum communication complexity, in Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000, pp. 271-278.
33. W.K. WOOTTERS AND W.H. ZUREK, A single quantum cannot be cloned, Nature, 299 (1982), pp. 802-803.
34. A.C. YAO, Some complexity questions related to distributed computing, in Proceedings of the llth Annual ACM Symposium on Theory of Computing, 1979, pp. 209-213.
35. A.C. YAO, Quantum circuit complexity, in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 352-361.