Abstract
We show a parallel repetition theorem for the entangled value of any two-player one-round game where the questions to Alice and Bob are drawn from a product distribution. Our proof is information theoretic and is broadly on similar lines as the proof of Raz and Holenstein for classical games. The additional quantum arguments we use, to deal with entangled games, are inspired by the work of Jain, Radhakrishnan, and Sen.