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.Comment: 10 pages, submission to the 9th Conference on the Theory of Quantum
Computation, Communication, and Cryptography (TQC 2014