Parallel Repetition for Entangled k-player Games via Fast Quantum Search


We present two parallel repetition theorems for the entangled value of multi-player, one-round free games (games where the inputs come from a product distribution). Our first theorem shows that for a k-player free game G with entangled value val∗(G) = 1− , the n-fold repetition of G has entangled value val∗(G⊗n) at most (1− 3/2)Ω(n/sk4), where s is the… (More)
DOI: 10.4230/LIPIcs.CCC.2015.512


  • Presentations referencing similar topics