## Multi-party pseudo-telepathy (2003)

### Cached

### Download Links

- [www.hep.princeton.edu]
- [arxiv.org]
- [arxiv.org]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings of the 8th International Workshop on Algorithms and Data Structures, Volume 2748 of Lecture Notes in Computer Science |

Citations: | 18 - 6 self |

### BibTeX

@INPROCEEDINGS{Brassard03multi-partypseudo-telepathy,

author = {Gilles Brassard and Anne Broadbent},

title = {Multi-party pseudo-telepathy},

booktitle = {Proceedings of the 8th International Workshop on Algorithms and Data Structures, Volume 2748 of Lecture Notes in Computer Science},

year = {2003},

pages = {1--11}

}

### OpenURL

### Abstract

Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with that we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required. Pseudo-telepathy is a surprising application of quantum information processing to communication complexity. Thanks to entanglement, perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and no-so-recent work on the subject. In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors.