Optimal bounds on the classical value of the repeated CHSH game

Andris Ambainis

We show that the maximum winning probability in the repeated CHSH game for classical strategies is at most ${\left(\frac{1+\sqrt{5}}{4}\right)}^n$. Together with a matching lower bou…