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

[. Bellare, O. Goldreich, and M. Sudan, Free Bits, PCPs, and Nonapproximability---Towards Tight Results, Bra12] Mark Braverman Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.804-915, 1998.
DOI : 10.1137/S0097539796302531
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6494

T. [. Bar-yossef, R. Jayram, D. Kumar, and . Sivakumar, An information statistics approach to data stream and communication complexity, Journal of Computer and System Sciences, vol.68, issue.4, pp.702-732, 2004.
DOI : 10.1016/j.jcss.2003.11.006

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

A. Chakrabarti, Y. Shi, A. Wirth, and A. Yao, Informational complexity and the direct sum problem for simultaneous message complexity, Proceedings 2001 IEEE International Conference on Cluster Computing, p.270, 2001.
DOI : 10.1109/SFCS.2001.959901

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

A. Christopher, J. Fuchs, . Van-de, and . Graaf, Cryptographic distinguishability measures for quantum-mechanical states, IEEE Trans. Inform. Theory, vol.45, pp.45-1216, 1999.

]. C. Hel67 and . Helstrom, Detection theory and quantum mechanics, pp.254-291, 1967.

[. 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

S. Laplante, V. Lerays, J. Roland, and D. Xiao, Lower bounds on information complexity via zero-communication protocols and applications, Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, FOCS '12, pp.500-509, 2012.

A. [. Klauck, A. Nayak, D. Ta-shma, and . Zuckerman, Interaction in quantum communication . Information Theory, IEEE Transactions on, vol.53, issue.6, pp.1970-1982, 2007.

[. 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

F. Mds-+-13-]-martin-mller-lennert, O. Dupuis, S. Szehr, M. Fehr, and . Tomamichel, On quantum Renyi entropies: a new definition and some properties. ArXiv e-prints, 2013.

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