Physics – Quantum Physics
Scientific paper
2010-12-21
Physics
Quantum Physics
v2: minor fixes and explanations added
Scientific paper
We consider one-round games between a classical referee and two players. One of the main questions in this area is the parallel repetition question: Is there a way to decrease the maximum winning probability of a game without increasing the number of rounds or the number of players? Classically, efforts to resolve this question, open for many years, have culminated in Raz's celebrated parallel repetition theorem on one hand, and in efficient product testers for PCPs on the other. In the case where players share entanglement, the only previously known results are for special cases of games, and are based on techniques that seem inherently limited. Here we show for the first time that the maximum success probability of entangled games can be reduced through parallel repetition, provided it was not initially 1. Our proof is inspired by a seminal result of Feige and Kilian in the context of classical two-prover one-round interactive proofs. One of the main components in our proof is an orthogonalization lemma for operators, which might be of independent interest.
Kempe Julia
Vidick Thomas
No associations
LandOfFree
Parallel Repetition of Entangled Games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel Repetition of Entangled Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Repetition of Entangled Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-96439