We relate the amount of entanglement required to play linearsystem non-local games near-optimally to the hyperlinear profile of finitelypresented groups. By calculating the hyperlinear profile of a certain group, we give an example of a finite non-local game for which the amount of entanglement required to play ǫ-optimally is at least Ω(1/ǫ k ), for some k > 0. Since this function approaches infinity as ǫ approaches zero, this provides a quantitative version of a theorem of the first author.