重复CHSH游戏经典值的最优界
Optimal bounds on the classical value of the repeated CHSH game
AI总结：
该研究确定了重复CHSH游戏经典值的最优界，结合已有下界得到其渐近精确值，并证明存在经典-量子值差距的异或游戏，其重复游戏渐近值也存在对应差距。
AI中文摘要：
我们证明，经典策略下重复CHSH游戏的最大获胜概率不超过$\left(\frac{1+\sqrt{5}}{4}\right)^n$。结合Barak等人（FOCS'2008）给出的匹配下界，这一结果精确确定了重复CHSH游戏的渐近值。我们还证明，若某异或游戏的经典值与量子值存在差距，则其重复游戏的渐近值也存在差距。
英文摘要：
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 bound by Barak et al. (FOCS'2008), this determines the asymptotic value of the repeated CHSH game exactly. We also show that, if an XOR game has a gap between classical and quantum values, there is also a gap between the asymptotic values for the repeated game.
