Approximate quantum 3-colorings of graphs and the quantum Max 3-Cut problem

Samuel J. Harris

We prove that, to each synchronous non-local game $\mathcal{G}=(I,O,\lambda )$ with $|I|=n$ and $|O|=m\ge 3$, there is an associated graph $G_{\lambda }$ for which approximate winning strategies…