The impossibility of pseudo-telepathy without quantum entanglement

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 457-

  Galliard, Viktor ^a   Tapp, Alain ^b   Wolf, Stefan ^b  

^a Untervaz   (Switzerland)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; GRAPHIC METHODS; QUANTUM THEORY; SET THEORY; THEOREM PROVING;

HAMMING WEIGHT; PSEUDO TELEPATHY; QUANTUM ENTANGLEMENT; SUBGRAPH;

INFORMATION THEORY;

EID: 0141904179     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228474     Document Type: Conference Paper

References (4)

1. G. Brassard, R. Cleve, and A. Tapp, "The cost of exactly simulating quantum entanglement with classical communication", Physical Review Letters, Vol. 83, No. 9, pp. 1874-1878, 1999.
2. V. Galliard and S. Wolf, "Pseudo-telepathy, entanglement, and graph colorings", Proceedings of ISIT 2002, p. 101, 2002.
3. P. Erdös, C. Ko and R. Rado, "Intersection theorem for systems of finite sets", Quarterly journal of mathematics, Vol. 2, No. 12, pp. 313-320, 1961.
4. http://math.galliard.ch/Quantum/pseudo-telepathy/data03/ptp_cliques_ twg03.txt. In ptp_cliques_twg03_extract.txt, initial vertices and sizes of cliques are given.