dorsal/arxiv
View SchemaRecasting Mermin's multi-player game into the framework of pseudo-telepathy
| Authors | Gilles Brassard, Anne Broadbent, Alain Tapp |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0408052 |
| URL | https://arxiv.org/abs/quant-ph/0408052 |
| Journal | Quantum Information and Computation, Volume 5, Number 7, Pages 538-550, November 2005. |
Abstract
Entanglement is perhaps the most non-classical manifestation of quantum mechanics. Among its many interesting applications to information processing, it can be harnessed to reduce the amount of communication required to process a variety of distributed computational tasks. Can it be used to eliminate communication altogether? Even though it cannot serve to signal information between remote parties, there are distributed tasks that can be performed without any need for communication, provided the parties share prior entanglement: this is the realm of pseudo-telepathy. One of the earliest uses of multi-party entanglement was presented by Mermin in 1990. Here we recast his idea in terms of pseudo-telepathy: we provide a new computer-scientist-friendly analysis of this game. We prove an upper bound on the best possible classical strategy for attempting to play this game, as well as a novel, matching lower bound. This leads us to considerations on how well imperfect quantum-mechanical apparatus must perform in order to exhibit a behaviour that would be classically impossible to explain. Our results include improved bounds that could help vanquish the infamous detection loophole.
{
"annotation_id": "cbfaace2-60cc-45fd-8a29-7c9e0e0d4fd9",
"date_created": "2026-03-02T18:02:09.335000Z",
"date_modified": "2026-03-02T18:02:09.335000Z",
"file_hash": "0b0bdfe3cd7c49633edb9612b4952033a7c3f321dade4c2751f302cc0ad603b2",
"private": false,
"record": {
"abstract": "Entanglement is perhaps the most non-classical manifestation of quantum\nmechanics. Among its many interesting applications to information processing,\nit can be harnessed to reduce the amount of communication required to process a\nvariety of distributed computational tasks. Can it be used to eliminate\ncommunication altogether? Even though it cannot serve to signal information\nbetween remote parties, there are distributed tasks that can be performed\nwithout any need for communication, provided the parties share prior\nentanglement: this is the realm of pseudo-telepathy.\n One of the earliest uses of multi-party entanglement was presented by Mermin\nin 1990. Here we recast his idea in terms of pseudo-telepathy: we provide a new\ncomputer-scientist-friendly analysis of this game. We prove an upper bound on\nthe best possible classical strategy for attempting to play this game, as well\nas a novel, matching lower bound. This leads us to considerations on how well\nimperfect quantum-mechanical apparatus must perform in order to exhibit a\nbehaviour that would be classically impossible to explain. Our results include\nimproved bounds that could help vanquish the infamous detection loophole.",
"arxiv_id": "quant-ph/0408052",
"authors": [
"Gilles Brassard",
"Anne Broadbent",
"Alain Tapp"
],
"categories": [
"quant-ph"
],
"journal_ref": "Quantum Information and Computation, Volume 5, Number 7, Pages\n 538-550, November 2005.",
"title": "Recasting Mermin\u0027s multi-player game into the framework of pseudo-telepathy",
"url": "https://arxiv.org/abs/quant-ph/0408052"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f5fbafe8-1984-4982-887f-81601899f9a1",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}