Explicit lower and upper bounds on the entangled value of multiplayer XOR games (Q356692): Difference between revisions

From the text: ``The study of quantum-mechanical violations of Bell inequalities is motivated by the investigation, and the eventual demonstration, of the nonlocal properties of entanglement.'' Bell inequalities have found ``a re-formulation using the language of multiplayer games originating from computer science. This paper studies the nonlocal properties of entanglement in the context of the simplest such games, called XOR games. When there are two players, it is known that the maximum bias -- the advantage over random play -- of players using entanglement can be at most a constant times greater than that of classical players. Recently, \textit{D. Pérez-García} et al. [Commun. Math. Phys. 279, No. 2, 455--486 (2008; Zbl 1157.81008)] showed that no such bound holds when there are three or more players: the use of entanglement can provide an unbounded advantage, and scale with the number of questions in the game.'' The authors give a new and improved proof of the existence of a family of three-player XOR games for which the QC-gap is unbounded. In turn, this implies the existence of tripartite Bell correlation inequalities that exhibit arbitrarily large violation in quantum mechanics. The proof technique uses the probabilistic method.