An explicit classical strategy for winning a CHSHq game
| Authors | |
|---|---|
| Year of publication | 2016 |
| Type | Article in Periodical |
| Magazine / Source | New Journal of Physics |
| MU Faculty or unit | |
| Citation | |
| Web | http://iopscience.iop.org/article/10.1088/1367-2630/18/2/025013 |
| Doi | http://dx.doi.org/10.1088/1367-2630/18/2/025013 |
| Field | Informatics |
| Keywords | device independence; CHSH game; classical-quantum gap; bell Inequalities |
| Description | A CHSH q game is a generalization of the standard two player CHSH game, with 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 CHSH q game, with q being a prime. Our construction achieves a winning probability better than $\frac{1}{22}{q}^{-\frac{2}{3}}$, which is in contrast with the previously known constructive strategies achieving only the winning probability of $O({q}^{-1})$. |
| Related projects: |