An explicit classical strategy for winning a CHSH_q game

DOI10.1088/1367-2630/18/2/025013MaRDI QIDQ5854971zbMATH OpenOpenAlexWikidataFDO

Authors Matej Pivoluska, Martin Plesch

Publication date 12 March 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1510.07431

Mathematics Subject Classification ID

Quantum computation (81P68) 2-person games (91A05)

Abstract: A $mathrm{CHSH}_q$ game is a generalization of the standard two player $mathrmCHSH$ game, having $q$ different input and output options. In contrast to the binary game, the best classical and quantum winning strategies are not known exactly. In this paper we provide a constructive classical strategy for winning a $mathrm{CHSH}_q$ game, with $q$ being a prime. Our construction achieves a winning probability better than $frac122q^{-frac23}$, which is in contrast with the previously known constructive strategies achieving only the winning probability of $O(q^{-1})$.

Recommendations

• Quantum strategies are better than classical in almost any XOR game
• Information causality, Szemerédi-Trotter and algebraic variants of \textsf{CHSH} (extended abtract)
• Quantum strategies for simple two-player XOR games
• Noise and the Mermin-GHZ game
• Do quantum strategies always win?

Cites work

• Certifiable quantum dice, or, true random number generation secure against quantum adversaries
• Incidence theorems and their applications
• Information causality, Szemerédi-Trotter and algebraic variants of \textsf{CHSH} (extended abtract)
• Proposed experiment to test local hidden-variable theories

Cited in

(5)

• Playing distributed two-party quantum games on quantum networks
• Dimensionality distinguishers
• Information causality, Szemerédi-Trotter and algebraic variants of \textsf{CHSH} (extended abtract)
• SEPARATION BETWEEN CLASSICAL AND QUANTUM WINNING STRATEGIES FOR THE MATCHING GAME
• Linear game non-contextuality and Bell inequalities -- a graph-theoretic approach

This page was built for publication: An explicit classical strategy for winning a \(\text{CHSH}_q\) game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854971)