Quantum Coloring Games on Complete Graphs
We study the nonlocal game where two players are both given an input ($x$ and $y$, respectively), from a set of size $n$ and, without communicating, must give outputs $a$ and $b$, respectively, from a set of size $m < n$, winning when $(x = y) \leftrightarrow (a = b)$. This can be considered a graph coloring game on the complete graph with $n$ vertices. In the simplest case, the players get random equal inputs with probability $\frac{1}{2}$ and random unequal inputs…