Quantum entanglement and the communication complexity of the inner product function

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

Volumn 1509, Issue , 1999, Pages 61-74

  Cleve, Richard ^a   van Dam, Wim ^b   Nielsen, Michael ^c   Tapp, Alain ^d  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF NEW MEXICO   (United States)

^d UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; NASA; QUANTUM COMPUTERS; QUANTUM ENTANGLEMENT; QUANTUM OPTICS;

BOUNDED ERROR PROBABILITY; COMMUNICATION COMPLEXITY; INNER PRODUCT; LOWER BOUNDS; PRODUCT FUNCTIONS; QUANTUM INFORMATION THEORY; QUANTUM STATE;

QUANTUM COMMUNICATION;

EID: 84961364322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49208-9_4     Document Type: Conference Paper

References (17)

1. H. Araki and E.H. Lieb, "Entropy inequalities", Commun. Math. Phys., Vol. 18, 1970, pp 160-170.
2. C.H. Bennett, E. Bernstein, G. Brassard, U. Vazirani, "Strengths and weaknesses of quantum computing", SIAM J. on Comput., Vol. 26, No. 5, 1997, pp 1510-1523.
3. C.H. Bennett, G. Brassard, C. Crépeau, R. Josza, A. Peres, W.K. Wootters, "Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels", Phys. Rev. Lett., Vol. 70, 1993, pp 1895-1899.
4. C.H. Bennett and S.J. Wiesner, "Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states", Phys. Rev. Lett., Vol. 69, No. 20, 1992, pp 2881-2884.
5. E. Bernstein, U. Vazirani, "Quantum Complexity Theory", SIAM J. Comput., Vol. 26, No. 5, 1997, pp 1411-1473.
6. H. Buhrman, R. Cleve, and W. van Dam, "Quantum Entanglement and Communication Complexity", preprint available from the LANL quant-ph archive 9705033, 1997.
7. B. Chor and O. Goldreich, "Unbiased bits from weak sources of randomness and probabilistic communication complexity", SIAM J. On Comput., Vol. 17, No. 2, pp 230-261, 1988.
8. R. Cleve and H. Buhrman, "Substituting quantum entanglement for communication", Phys. Rev. A, Vol. 56, No. 2, pp 1201-1204, 1997.
9. T.M. Cover and J.A. Thomas, Elements of Information Theory, John Wiley and Sons, 1991.
10. A. Einstein, B. Podolsky, and N. Rosen, "Can quantum-mechanical description of physical reality be complete?", Phys. Rev., Vol. 47, 1935, pp 777-780.
11. A.S. Holevo, "Bounds for the Quantity of Information Transmitted by a Quantum Communication Channel", Problemy Peredachi Informatsii, Vol. 9, No. 3, 1973, pp 3-11. English translation Problems of Information Transmission, Vol. 9, 1973, pp. 177-183.
12. I. Kremer, "Quantum Communication", Master’s Thesis, The Hebrew University of Jerusalem, 1995.
13. E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, 1997.
14. B.M. Terhal and J.A. Smolin, "Superfast quantum algorithms for coin weighing and binary search problems", preprint available from the LANL quant-ph archive 9705041, 1997.
15. B. Schumacher, M. Westmoreland and W. K. Wootters, "Limitation on the amount of accessible information in a quantum channel", Phys. Rev. Lett., Vol. 76, 1996, pp 3453-3456.
16. A.C. Yao, "Some complexity questions related to distributed computing", Proc. Of the 11th Ann. ACM Symp. on Theory of Computing, 1979, pp 209-213.
17. A.C. Yao, "Quantum circuit complexity", Proc. of the 34th Ann. IEEE Symp. On Foundations of Computer Science, 1993, pp 352-361.