For every finite two-player game with finite-dimensional entangled value v<1 and arbitrary correlated questions, the maximum probability of winning at least a fraction v+δ of k repetitions decays at least as exp(−κδ¹³k/(1+log(|A||B|))) for one universal κ>0 and 0<δ<1−v.
For every finite two-player game with finite-dimensional entangled value v<1 and arbitrary correlated questions, the maximum probability of winning at least a fraction v+δ of k repetitions decays at least as exp(−κδ¹³k/(1+log(|A||B|))) for one universal κ>0 and 0<δ<1−v.
For every finite two-player game with finite-dimensional entangled value v<1 and arbitrary correlated questions, the maximum probability of winning at least a fraction v+δ of k repetitions decays at least as exp(−κδ¹³k/(1+log(|A||B|))) for one universal κ>0 and 0<δ<1−v.
If correct, gives universal exponential threshold decay for finite-dimensional entangled strategies.
Does above-value success decay exponentially under parallel repetition of entangled games?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
