Maximally entangled states in pseudo-telepathy games

Abstract

A pseudo-telepathy game is a nonlocal game which can be won with probability one using some finite-dimensional quantum strategy but not using a classical one. Our central question is whether there exist two-party pseudo-telepathy games which cannot be won with probability one using a maximally entangled state. Towards answering this question, we develop conditions under which maximally entangled states suffice. In particular, we show that maximally entangled states suffice for weak projection games which we introduce as a relaxation of projection games. Our results also imply that any pseudo-telepathy weak projection game yields a device-independent certification of a maximally entangled state. In particular, by establishing connections to the setting of communication complexity, we exhibit a class of games $G_n$ for testing maximally entangled states of local dimension $\Omega (n)$. We leave the robustness of these self-tests as an open question.

arXiv commentIn addition to the published material this version contains results on self testing

References in corpus (11)

• Quantum non-locality in two three-level systems
• Improving zero-error classical communication with entanglement
• Maximal violation of the CGLMP inequality for infinite dimensional states
• Optimal Bell tests do not require maximally entangled states
• More non-locality with less entanglement
• Coherent state exchange in multi-prover quantum interactive proof systems
• A quantum protocol to win the graph colouring game on all Hadamard graphs
• Round elimination in exact communication complexity
• Characterization of Binary Constraint System Games
• Colouring an Orthogonality Graph
• On the quantum chromatic number of a graph