pith. sign in

arxiv: 1209.3819 · v1 · pith:XQ2FLD7Enew · submitted 2012-09-18 · 🪐 quant-ph

Extending and Characterizing Quantum Magic Games

classification 🪐 quant-ph
keywords gamesquantumgameplayersentanglementmagicpseudo-telepathyreferee
0
0 comments X
read the original abstract

The Mermin-Peres magic square game is a cooperative two-player nonlocal game in which shared quantum entanglement allows the players to win with certainty, while players limited to classical operations cannot do so, a phenomenon dubbed "quantum pseudo-telepathy". The game has a referee separately ask each player to color a subset of a 3x3 grid. The referee checks that their colorings satisfy certain parity constraints that can't all be simultaneously realized. We define a generalization of these games to be played on an arbitrary arrangement of intersecting sets of elements. We characterize exactly which of these games exhibit quantum pseudo-telepathy, and give quantum winning strategies for those that do. In doing so, we show that it suffices for the players to share three Bell pairs of entanglement even for games on arbitrarily large arrangements. Moreover, it suffices for Alice and Bob to use measurements from the three-qubit Pauli group. The proof technique uses a novel connection of Mermin-style games to graph planarity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement

    quant-ph 2025-05 unverdicted novelty 9.0

    Constructs relation problems with zero entanglement-assisted quantum communication complexity but Omega(n) complexity without shared entanglement via parallel repetition of suitable non-local games, refuting quantum N...