aqora

Maximally Entangled State in Pseudo-Telepathy Games

Laura Mančinska

Lecture notes in computer scienceJan 1, 20146 citations

Quantum advice enhances social optimality in three-party conflicting interest games

SituHaozhen, ZhangCai, YuFang

Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantu...

Quantum Information and ComputationMay 1, 20160 citations

Entanglement playing a dominating role in quantum games

Jiangfeng Du, Xiaodong Xu, Hui Li +2 more

Physics Letters AOct 1, 200197 citations

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

Gilles Brassard A, Anne Broadbent, Alain Tapp

Entanglement is perhaps the most non-classical manifestation of quantum \mbox{mechanics}. Among its many interesting applications to information processing, it can be harnessed to \emph{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 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.Entanglement is perhaps the most non-classical manifestation of quantum \mbox{mechanics}. Among its many interesting applications to information processing, it can be harnessed to \emph{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 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.

arXiv:quant-ph/0408052Quantum Information and ComputationNov 1, 200535 citations

Entanglement enhanced multiplayer quantum games

Jiangfeng Du, Hui Li, Xiaodong Xu +2 more

arXiv:quant-ph/0110122Physics Letters ASep 1, 200288 citations

Quantum Pseudo-Telepathy

Gilles Brassard A, Anne Broadbent, Alain Tapp

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. 1.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. 1.

Jan 1, 2004123 citations

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

Abstract

Related papers

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

Abstract

Related papers