Pseudo-telepathy: input cardinality and Bell-type inequalities
| dc.creator | Gisin, N. | |
| dc.creator | Methot, A. A. | |
| dc.creator | Scarani, V. | |
| dc.date | 2006-10-20 | |
| dc.date.accessioned | 2026-07-07T08:38:31Z | |
| dc.date.available | 2026-07-07T08:38:31Z | |
| dc.description | Pseudo-telepathy is the most recent form of rejection of locality. Many of its properties have already been discovered: for instance, the minimal entanglement, as well as the minimal cardinality of the output sets, have been characterized. This paper contains two main results. First, we prove that no bipartite pseudo-telepathy game exists, in which one of the partners receives only two questions; as a corollary, we show that the minimal "input cardinality", that is, the minimal number of questions required in a bipartite pseudo-telepathy game, is 3x3. Second, we study the Bell-type inequality derived from the pseudo-telepathy game known as the Magic Square game: we demonstrate that it is a tight inequality for 3 inputs and 4 outputs on each side and discuss its weak resistance to noise. | |
| dc.description | 12 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0610175 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0610175 | |
| dc.identifier | International Journal of Quantum Information 5: 525-534, 2007. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/140758 | |
| dc.subject | Quantum Physics | |
| dc.title | Pseudo-telepathy: input cardinality and Bell-type inequalities | |
| dc.type | text |