Bounding Quantum-Classical Separations for Classes of Nonlocal Games
暂无分享,去创建一个
Troy Lee | Harry Buhrman | Jop Briët | Farrokh Labib | Tom Bannink | H. Buhrman | J. Briët | Troy Lee | T. Bannink | Farrokh Labib
[1] Moses Charikar,et al. Near-optimal algorithms for unique games , 2006, STOC '06.
[2] William Slofstra,et al. Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[3] Elchanan Mossel,et al. Conditional Hardness for Approximate Coloring , 2009, SIAM J. Comput..
[4] Troy Lee,et al. Multipartite entanglement in XOR games , 2013, Quantum Inf. Comput..
[5] V. Sós,et al. Counting Graph Homomorphisms , 2006 .
[6] Michel Boyer. Extended GHZ n-player games with classical probability of winning tending to 0 , 2004 .
[7] Yaoyun Shi,et al. Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement , 2008, SIAM J. Comput..
[8] Tsuyoshi Ito,et al. Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.
[9] J. O. Irwin,et al. ON THE FREQUENCY DISTRIBUTION OF THE MEANS OF SAMPLES FROM A POPULATION HAVING ANY LAW OF FREQUENCY WITH FINITE MOMENTS, WITH SPECIAL REFERENCE TO PEARSON'S TYPE II , 1927 .
[10] Peter Høyer,et al. Consequences and limits of nonlocal strategies , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[11] David Conlon,et al. Weak quasi‐randomness for uniform hypergraphs , 2012, Random Struct. Algorithms.
[12] Terence Tao,et al. The Inverse Conjecture for the Gowers Norm over Finite Fields in Low Characteristic , 2011, 1101.1469.
[13] Ran Raz,et al. Exponential separation of quantum and classical communication complexity , 1999, STOC '99.
[14] Hamed Hatami. Graph norms and Sidorenko’s conjecture , 2008, 0806.0047.
[15] David Conlon,et al. Finite reflection groups and graph norms , 2016, 1611.05784.
[16] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[17] M. Wolf,et al. Unbounded Violation of Tripartite Bell Inequalities , 2007, quant-ph/0702189.
[18] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[19] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[20] Thomas Vidick,et al. Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games , 2011 .
[21] Adi Shraibman,et al. Lower bounds in communication complexity based on factorization norms , 2009 .
[22] Guy Kindler,et al. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[23] Anand Natarajan,et al. Algorithms, Bounds, and Strategies for Entangled XOR Games , 2019, ITCS.
[24] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[25] Mark Braverman,et al. The Grothendieck Constant is Strictly Smaller than Krivine's Bound , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[26] Iordanis Kerenidis,et al. Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications , 2012, SIAM J. Comput..
[27] M. Żukowski. Bell theorem involving all settings of measuring apparatus , 1993 .
[28] Julia Kempe,et al. Unique Games with Entangled Provers are Easy , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[29] Hamed Hatami,et al. On Generalizations of Gowers Norms , 2009 .
[30] J. Bell. On the Einstein-Podolsky-Rosen paradox , 1964 .
[31] B. Tsirelson. Quantum analogues of the Bell inequalities. The case of two spatially separated domains , 1987 .
[32] Irit Dinur,et al. Multiplayer parallel repetition for expander games , 2016, Electron. Colloquium Comput. Complex..
[33] Hall Philip,et al. THE DISTRIBUTION OF MEANS FOR SAMPLES OF SIZE N DRAWN FROM A POPULATION IN WHICH THE VARIATE TAKES VALUES BETWEEN 0 AND 1, ALL SUCH VALUES BEING EQUALLY PROBABLE , 1927 .