11 search results - page 1 / 3 » A parallel repetition theorem for entangled projection games |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
ECCC
2010
13 years 4 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
COCO
2007
Springer
13 years 10 months ago
2007
Springer
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
STOC
2007
ACM
14 years 4 months ago
2007
ACM