Multi-party pseudo-telepathy

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

Volumn 2748, Issue , 2003, Pages 1-11

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

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INFORMATION THEORY; QUANTUM OPTICS;

COMPUTATIONAL TASK; DISTRIBUTED PROBLEMS; EXPERIMENTAL TEST; HIGH PROBABILITY; NONLOCALITIES; OF QUANTUM-INFORMATION; PROTOCOL CANS; QUANTUM PROTOCOLS;

QUANTUM ENTANGLEMENT;

EID: 35248835129     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_1     Document Type: Article

References (13)

1. Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Available as arXiv:quant-ph/0303041 (2003).
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 (1993) 1895-1899.
3. Brassard, G.: Quantum communication complexity. Foundations of Physics (to appear, 2003).
4. Brassard, G., Cleve, R., Tapp, A.: Cost of exactly simulating quantum entanglement with classical communication. Physical Review Letter 83 (1878) 1874-1878.
5. Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. Proceedings of 30th Annual ACM Symposium on Theory of Computing (1998) 63-68.
6. Cleve, R., Buhrman, H.: Substituting quantum entanglement for communication. Physical Review A 56 (1997) 1201-1204.
7. Gould, H.W.: Combinatorial Identities. Morgantown (1972).
8. Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. Proceedings of 2nd Annual IEEE Conference on Structure in Complexity Theory (1987) 41-47.
9. Massar, S.: Non locality, closing the detection loophole, and communication complexity. Physical Review A 65 (2002) 032121-1-032121-5.
10. Nielsen, M. A., Chuang, I. L.: Quantum Computation and Quantum Information. Cambridge University Press (2000).
11. Raz, R.: Exponential separation of quantum and classical communication complexity. Proceedings of 31st Annual ACM Symposium on Theory of Computing (1999) 358-367.
12. Yao, A. C.-C.: Probabilistic computations: Toward a unified measure of complexity. Proceedings of 18th IEEE Symposium on Foundations of Computer Science (1977) 222-227.
13. Yao, A. C.-C.: Quantum circuit complexity. Proceedings of 34th Annual IEEE Symposium on Foundations of Computer Science (1993) 352-361.