2000 character limit reached
The Parallel-Repeated Magic Square Game is Rigid (1609.06306v1)
Published 20 Sep 2016 in quant-ph
Abstract: We show that the $n$-round parallel repetition of the Magic Square game of Mermin and Peres is rigid, in the sense that for any entangled strategy succeeding with probability $1 -\varepsilon$, the players' shared state is $O(\mathrm{poly}(n\varepsilon))$-close to $2n$ EPR pairs under a local isometry. Furthermore, we show that, under local isometry, the players' measurements in said entangled strategy must be $O(\mathrm{poly}(n\varepsilon))$ close to the "ideal" strategy when acting on the shared state.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.