S. A. Arora, A. Khot, D. Kolla, M. Steurer, N. K. Tulsiani et al., Unique games on expanding constraint graphs are easy, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.21-28, 2008.
DOI : 10.1145/1374376.1374380

M. Braverman and A. Garg, Small Value Parallel Repetition for General Games, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15, 2014.
DOI : 10.1145/2746539.2746565

M. Bellare, O. Goldreich, and M. Sudan, Free Bits, PCPs, and Nonapproximability---Towards Tight Results, SIAM Journal on Computing, vol.27, issue.3, pp.804-915, 1998.
DOI : 10.1137/S0097539796302531

A. Chailloux and G. Scarpa, Parallel repetition of entangled games via the superposed information cost, ICALP, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01100011

R. Cleve, W. Slofstra, F. Unger, and S. Upadhyay, Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems, computational complexity, vol.17, issue.2, pp.282-299, 2008.
DOI : 10.1007/s00037-008-0250-4

URL : http://arxiv.org/pdf/quant-ph/0608146v2.pdf

I. Dinur, D. Steurer, and T. Vidick, A parallel repetition theorem for entangled projection games, 2013.

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

J. Håstad, Some optimal inapproximability results, Journal of the ACM, vol.48, issue.4, pp.798-859, 2001.
DOI : 10.1145/502090.502098

T. Holenstein, Parallel repetition, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.411-419, 2007.
DOI : 10.1145/1250790.1250852

A. Jain, P. Pereszlenyi, and . Yao, A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2013.
DOI : 10.1109/CCC.2014.29

J. Kempe, O. Regev, and B. Toner, Unique games with entangled provers are easy, Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS '08, pp.457-466, 2008.
DOI : 10.1109/focs.2008.9

URL : http://arxiv.org/abs/0710.0655

J. Kempe and T. Vidick, Parallel repetition of entangled games, Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pp.353-362, 2011.
DOI : 10.1145/1993636.1993684

A. Michael, I. L. Nielsen, and . Chuang, Quantum computation and quantum information, 2000.

A. Nayak and P. Shor, Bit-commitment-based quantum coin flipping, Physical Review A, vol.67, issue.1, 2003.
DOI : 10.1103/PhysRevA.67.012304

I. Parnafes, R. Raz, and A. Wigderson, Direct product results and the GCD problem, in old and new communication models, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.363-372, 1997.
DOI : 10.1145/258533.258620

A. Rao, Parallel repetition in projection games and a concentration bound, Proceedings of the 40th annual ACM symposium on Theory of computing, STOC '08, pp.1-10, 2008.

[. Raz, A Parallel Repetition Theorem, SIAM Journal on Computing, vol.27, issue.3, pp.763-803, 1998.
DOI : 10.1137/S0097539795280895

[. Raz, A Counterexample to Strong Parallel Repetition, SIAM Journal on Computing, vol.40, issue.3, pp.771-777, 2011.
DOI : 10.1137/090747270

T. [. Spekkens and . Rudolph, Degrees of concealment and bindingness in quantum bit commitment protocols, Physical Review A, vol.65, issue.1, p.12310, 2001.
DOI : 10.1103/PhysRevA.65.012310