A parallel repetition theorem for all entangled games
暂无分享,去创建一个
[1] Uriel Feige,et al. Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..
[2] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[3] J. S. BELLt. Einstein-Podolsky-Rosen Paradox , 2018 .
[4] Julia Kempe,et al. Parallel repetition of entangled games , 2011, STOC '11.
[5] William Slofstra,et al. Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[6] P. Hayden,et al. Universal entanglement transformations without communication , 2003 .
[7] David Steurer,et al. A parallel repetition theorem for entangled projection games , 2013, computational complexity.
[8] Julia Kempe,et al. Unique Games with Entangled Provers are Easy , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[9] Rahul Jain,et al. New Strong Direct Product Results in Communication Complexity , 2015, Electron. Colloquium Comput. Complex..
[10] Thomas Vidick,et al. Parallel Repetition via Fortification: Analytic View and the Quantum Case , 2016, ITCS.
[11] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[12] Thomas Vidick,et al. Anchoring games for parallel repetition , 2015, ArXiv.
[13] André Chailloux,et al. Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost , 2014, ICALP.
[14] Thomas Holenstein. Parallel Repetition: Simplification and the No-Signaling Case , 2009, Theory Comput..
[15] Dana Moshkovitz,et al. Parallel Repetition from Fortification , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[16] Rahul Jain,et al. A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions , 2013, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[17] Thomas Holenstein,et al. Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.
[18] Mark Braverman,et al. Direct Products in Communication Complexity , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[19] Mark Braverman,et al. Small Value Parallel Repetition for General Games , 2014, STOC.
[20] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[21] Xiaodi Wu,et al. Parallel repetition for entangled k-player games via fast quantum search , 2014, CCC.
[22] E. Størmer,et al. Free states of the canonical anticommutation relations , 1970 .
[23] R. Schumann. Quantum Information Theory , 2000, quant-ph/0010060.