Recasting Mermin's multi-player game into the framework of pseudo-telepathy

Simple item page
dc.creatorBrassard, Gilles
dc.creatorBroadbent, Anne
dc.creatorTapp, Alain
dc.date2004-08-06
dc.date2005-06-16
dc.date.accessioned2026-07-07T06:22:45Z
dc.date.available2026-07-07T06:22:45Z
dc.descriptionEntanglement 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.
dc.description18 pages, no figures. References added and updated, typos corrected
dc.identifierhttps://arxiv.org/abs/quant-ph/0408052
dc.identifierhttp://arxiv.org/abs/quant-ph/0408052
dc.identifierQuantum Information and Computation, Volume 5, Number 7, Pages 538-550, November 2005.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/96006
dc.subjectQuantum Physics
dc.titleRecasting Mermin's multi-player game into the framework of pseudo-telepathy
dc.typetext

Files

Collections

arXiv