dorsal/arxiv
View SchemaPseudo-telepathy: input cardinality and Bell-type inequalities
| Authors | N. Gisin, A. A. Methot, V. Scarani |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0610175 |
| URL | https://arxiv.org/abs/quant-ph/0610175 |
| Journal | International Journal of Quantum Information 5: 525-534, 2007. |
Abstract
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.
{
"annotation_id": "e2f8bd87-2663-4da1-ba92-1452326f0624",
"date_created": "2026-03-02T18:02:31.051000Z",
"date_modified": "2026-03-02T18:02:31.051000Z",
"file_hash": "9fdbf7942c0c3dcc12a29bb5b40919d28f4b6328d412c6b84a0d79c440426b5e",
"private": false,
"record": {
"abstract": "Pseudo-telepathy is the most recent form of rejection of locality. Many of\nits properties have already been discovered: for instance, the minimal\nentanglement, as well as the minimal cardinality of the output sets, have been\ncharacterized. This paper contains two main results. First, we prove that no\nbipartite pseudo-telepathy game exists, in which one of the partners receives\nonly two questions; as a corollary, we show that the minimal \"input\ncardinality\", that is, the minimal number of questions required in a bipartite\npseudo-telepathy game, is 3x3. Second, we study the Bell-type inequality\nderived from the pseudo-telepathy game known as the Magic Square game: we\ndemonstrate that it is a tight inequality for 3 inputs and 4 outputs on each\nside and discuss its weak resistance to noise.",
"arxiv_id": "quant-ph/0610175",
"authors": [
"N. Gisin",
"A. A. Methot",
"V. Scarani"
],
"categories": [
"quant-ph"
],
"journal_ref": "International Journal of Quantum Information 5: 525-534, 2007.",
"title": "Pseudo-telepathy: input cardinality and Bell-type inequalities",
"url": "https://arxiv.org/abs/quant-ph/0610175"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "eece9f93-2fd2-43c7-b0a6-a8d44dc5d2ec",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}