Recasting Mermin's multi-player game into the framework of pseudo-telepathy

Quantum Information and Computation

Volumn 5, Issue 7, 2005, Pages 538-550

  Brassard, Gilles ^a   Broadbent, Anne ^a   Tapp, Alain ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Detection loophole; Entanglement; Nonlocality; Pseudo telepathy

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

COMPUTATIONAL TASK; DISTRIBUTED TASKS; ENTANGLEMENT; MULTIPLAYER GAMES; NONLOCALITIES; PSEUDO-TELEPATHY; QUANTUM MECHANICAL; SIGNAL INFORMATION;

QUANTUM ENTANGLEMENT;

EID: 23744472247     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. Aaronson, S., Ambainis, A., "Quantum search of spatial regions", Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 200-209, 2003. Full version available as arXiv:quant- ph/0303041.
2. Bennett, C.H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W. K., "Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels", Physical Review Letters 70:1895-1899, 1993.
3. Boyer, M., "Extended GHZ n-player games with classical probability of winning tending to 0". Available as arXiv:quant-ph/0408090, 2004.
4. Brassard, G., "Quantum communication complexity", Foundations of Physics 33:1593-1616, 2003.
5. Brassard, G., Broadbent, A., Tapp, A., "Multi-party pseudo-telepathy", Proceedings of 8th International Workshop on Algorithms and Data Structures, Volume 2748 of Lecture Notes in Computer Science, pp. 1-11, 2003.
6. Brassard, G., Broadbent, A., Tapp, A., "Quantum pseudo-telepathy", Foundations of Physics 35(11), November 2005. Available as arXiv:quant-ph/0407221.
7. Brassard, G., Cleve, R., Tapp, A., "Cost of exactly simulating quantum entanglement with classical communication", Physical Review Letters 83:1874-1878, 1999.
8. Brassard, G., Méthot, A. A., Tapp, A., "Minimum entangled state dimension required for pseudotelepathy", Quantum Information & Computation, 5:275-284, 2005.
9. Braunstein, S.L., Mann, A., "Noise in Mermin's n-particle Bell inequality", Physical Review A 47:R2427-R2430, 1993.
10. Buhrman, H., Cleve, R., van Dam, W., "Quantum entanglement and communication complexity", SIAM Journal on Computing 30:1829-1841, 2001.
11. Buhrman, H., Cleve, R., Wigderson, A., "Quantum vs. classical communication and computation", Proceedings of 30th Annual ACM Symposium on Theory of Computing, pp. 63-68, 1998.
12. Buhrman, H., Høyer, P., Massar, S., Röhrig, H., "Combinatorics and quantum nonlocality", Physical Review Letters 91:047903.1-047903.4, 2003.
13. Cleve, R., Buhrman, H., "Substituting quantum entanglement for communication", Physical Review A 56:1201-1204, 1997.
14. Cleve, R., van Dam, W., Nielsen, M., Tapp, A., "Quantum entanglement and the communication complexity of the inner product function", Proceedings of First NASA International Conference on Quantum Computing and Quantum Communication (QCQC'98), Lecture Notes in Computer Science, Vol. 1590 (Springer, 1999), pp. 61-74.
15. Greenberger, D. M., Horne, M. A., Zeilinger, A., "Going beyond Bell's theorem", in Bell's Theorem, Quantum Theory and Conceptions of the Universe, M. Kafatos (editor), pp. 69-72, 1989.
16. Hardy, L., "Quantum mechanics, local realistic theories, and Lorentz-invariant realistic theories", Physical Review Letters 68:2981-2984, 1992.
17. Heywood, P., Redhead, M.L. G., "Nonlocality and the Kochen-Specker paradox", Foundations of Physics 13:481-499, 1983.
18. Kalyanasundaram, B., Schnitger, G., "The probabilistic communication complexity of set intersection", Proceedings of 2nd Annual IEEE Conference on Structure in Complexity Theory, pp. 41-47, 1987.
19. Massar, S., "Nonlocality, closing the detection loophole, and communication complexity", Physical Review A 65:032121.1-032121.5, 2002.
20. Mermin, N.D., "Quantum mysteries revisited", American Journal of Physics 58:731-734, 1990.
21. Mermin, N.D., "Extreme quantum entanglement in a superposition of macroscopically distinct states", Physical Review Letters 65:1838-1840, 1990.
22. Nielsen, M. A., Chuang, I. L., Quantum Computation and Quantum Information, Cambridge University Press, 2000.
23. Raz, R., "Exponential separation of quantum and classical communication complexity", Proceedings of 31st Annual ACM Symposium on Theory of Computing, pp. 358-367, 1999.
24. de Wolf, R., "Quantum communication and complexity", Theoretical Computer Science 287:337-353, 2002.
25. Yao, A. C.-C., "Probabilistic computations: toward a unified measure of complexity", Proceedings of 18th Annual IEEE Symposium on Foundations of Computer Science, pp. 222-227, 1977.
26. Yao, A. C.-C., "Quantum circuit complexity", Proceedings of 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 352-361, 1993.
27. Żukowksi, M., "Bell theorem involving all settings of measuring apparatus", Physics Letters A 177:290-296, 1993.