Universality of graph homomorphism games and the quantum coloring problem

Samuel J. Harris

We show that quantum graph parameters for finite, simple, undirected graphs encode winning strategies for all possible synchronous non-local games. Given a synchronous game $\mathc…