André Chailloux, Laura Mančinska, Giannicola Scarpa, Simone Severini
Published 2014-04-14, updated 2015-02-27Version 2
We introduce a novel technique to give bounds to the entangled value of non-local games. The technique is based on a class of graphs used by Cabello, Severini and Winter in 2010. The upper bound uses the famous Lov\'asz theta number and is efficiently computable; the lower one is based on the quantum independence number, which is a quantity used in the study of entanglement-assisted channel capacities and graph homomorphism games.
Comments: 10 pages, submission to the 9th Conference on the Theory of Quantum Computation, Communication, and Cryptography (TQC 2014)
A parallel repetition theorem for all entangled games
Tsirelson's problem and an embedding theorem for groups arising from non-local games
Universality of graph homomorphism games and the quantum coloring problem
![QR code for arXiv:1404.3640 [quant-ph]](http://oss.arxitics.com/images/favicon.svg)