Quantum XOR Games

We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage over the use of no entanglement. By invoking two deep extensions of Grothendieck's inequality, we present an efficient algorithm that gives a constant-factor approximation to the best performance players can obtain in a given game, both in case they have no shared entanglement and in case they share unlimited entanglement. As a byproduct of the algorithm we prove some additional interesting properties of quantum XOR games, such as the fact that sharing a maximally entangled state of arbitrary dimension gives only a small advantage over having no entanglement at all.

[1]  U. Haagerup.  A new upper bound for the complex Grothendieck constant , 1987 .

[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]  Thomas Vidick,et al.  Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games , 2011 .

[4]  Carlos Palazuelos,et al.  Rank-one quantum games , 2011, computational complexity.

[5]  M. Junge,et al.  Large Violation of Bell Inequalities with Low Entanglement , 2010, 1007.3043.

[6]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[7]  J. Lindenstrauss,et al.  Absolutely summing operators in Lp spaces and their applications , 1968 .

[8]  Tamás Vértesi,et al.  Maximal violation of a bipartite three-setting, two-outcome Bell inequality using infinite-dimensional quantum systems , 2010 .

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  Gilles Pisier,et al.  Introduction to Operator Space Theory , 2003 .

[11]  P. Hayden,et al.  Universal entanglement transformations without communication , 2003 .

[12]  C. H. Bennett,et al.  Quantum nonlocality without entanglement , 1998, quant-ph/9804053.

[13]  John Watrous,et al.  Bipartite subspaces having no bases distinguishable by local operations and classical communication. , 2005, Physical review letters.

[14]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[15]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[16]  G. Pisier.  Grothendieck's Theorem, past and present , 2011, 1101.4195.

[17]  S. Sakai,et al.  Review: Ola Bratelli and Derek W. Robinson, Operator algebras and quantum statistical mechanics, Volumes I and II , 1982 .

[18]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[19]  M. Wolf,et al.  Unbounded Violations of Bipartite Bell Inequalities via Operator Space Theory , 2009, 0910.4228.

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

[21]  William Slofstra,et al.  Lower bounds on the entanglement needed to play XOR non-local games , 2011 .

[22]  Laura Mančinska,et al.  A Framework for Bounding Nonlocality of State Discrimination , 2012, Communications in Mathematical Physics.

[23]  Assaf Naor,et al.  Efficient rounding for the noncommutative grothendieck inequality , 2012, STOC '13.

[24]  Peter Høyer,et al.  Consequences and limits of nonlocal strategies , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[25]  A. Grothendieck.  Résumé de la théorie métrique des produits tensoriels topologiques , 1996 .

[26]  Ronald de Wolf,et al.  Near-Optimal and Explicit Bell Inequality Violations , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[27]  Francesco Buscemi,et al.  All entangled quantum states are nonlocal. , 2011, Physical review letters.

[28]  Thomas Vidick,et al.  Quantum XOR Games , 2013, Computational Complexity Conference.

[29]  Thomas Vidick,et al.  Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms , 2012, 1206.4025.

[30]  Isaac L. Chuang,et al.  Quantum Computation and Quantum Information (10th Anniversary edition) , 2011 .

[31]  Åke Björck,et al.  Numerical methods for least square problems , 1996 .

[32]  Ronald de Wolf,et al.  Near-Optimal and Explicit Bell Inequality Violations , 2012, Theory Comput..

[33]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[34]  A. Shimony,et al.  Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .

[35]  Noga Alon,et al.  Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.

[36]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[37]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[38]  Uffe Haagerup,et al.  The Effros–Ruan conjecture for bilinear forms on C*-algebras , 2007, 0711.1851.

[39]  M. Saunders,et al.  Towards a Generalized Singular Value Decomposition , 1981 .

[40]  David P. Blecher,et al.  Geometry of the tensor product of C*-algebras , 1988, Mathematical Proceedings of the Cambridge Philosophical Society.

[41]  B. Tsirelson.  Quantum analogues of the Bell inequalities. The case of two spatially separated domains , 1987 .

[42]  M. Wolf,et al.  Unbounded Violation of Tripartite Bell Inequalities , 2007, quant-ph/0702189.

[43]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[44]  Gilles Pisier.  Grothendieck's theorem for noncommutative C∗-algebras, with an Appendix on Grothendieck's constants , 1978 .

[45]  J. Krivine.  Constantes de Grothendieck et fonctions de type positif sur les sphères , 1979 .

[46]  V. Rich.  Personal communication , 1989, Nature.

[47]  Julia Kempe,et al.  Unique Games with Entangled Provers are Easy , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[48]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .

[49]  C. Loan.  Generalizing the Singular Value Decomposition , 1976 .

[50]  Takashi Itoh.  On the completely bounded map of a C^*-algebra to its dual space , 1987 .

[51]  Gilles Pisier,et al.  Grothendieck’s theorem for operator spaces , 2001, math/0108205.

[52]  Stephanie Wehner,et al.  The Quantum Moment Problem and Bounds on Entangled Multi-prover Games , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[53]  Debbie Leung,et al.  Coherent state exchange in multi-prover quantum interactive proof systems , 2008, Chic. J. Theor. Comput. Sci..

[54]  David P. Blecher,et al.  Tracially Completely Bounded Multilinear Maps on C∗‐Algebras , 1989 .

[55]  B. S. Cirel'son.  Quantum generalizations of Bell's inequality , 1980 .

[56]  Oded Regev,et al.  Bell violations through independent bases games , 2011, Quantum Inf. Comput..

[57]  Uffe Haagerup,et al.  The Grothendieck inequality for bilinear forms on C∗-algebras , 1985 .

[58]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.