Consequences and limits of nonlocal strategies

This paper investigates various aspects of the nonlocal effects that can arise when entangled quantum information is shared between two parties. A natural framework for studying nonlocality is that of cooperative games with incomplete information, where two cooperating players may share entanglement. Here, nonlocality can be quantified in terms of the values of such games. We review some examples of non-locality and show that it can profoundly affect the soundness of two-prover interactive proof systems. We then establish limits on nonlocal behavior by upper-bounding the values of several of these games. These upper bounds can be regarded as generalizations of the so-called Tsirelson inequality. We also investigate the amount of entanglement required by optimal and nearly optimal quantum strategies.

[1]  J. Bell.  On the Einstein-Podolsky-Rosen paradox , 1964 .

[2]  E. Specker,et al.  The Problem of Hidden Variables in Quantum Mechanics , 1967 .

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

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

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

[6]  M. Redhead,et al.  Nonlocality and the Kochen-Specker paradox , 1983 .

[7]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

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

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

[10]  S. Braunstein,et al.  Wringing out better bell inequalities , 1990 .

[11]  Richard J. Lipton,et al.  On bounded round multiprover interactive proof systems , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[12]  Mermin Nd.  Simple unified form for the major no-hidden-variables theorems. , 1990 .

[13]  Uriel Feige.  On the success probability of the two provers in one-round proof systems , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[14]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[15]  N. Mermin.  Hidden variables and the two theorems of John Bell , 1993, 1802.10119.

[16]  L. Ballentine,et al.  Quantum Theory: Concepts and Methods , 1994 .

[17]  Richard J. Lipton,et al.  PSPACE is provable by two provers in one round , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[18]  Peter C. Fishburn,et al.  Bell Inequalities, Grothendieck's Constant, and Root Two , 1994, SIAM J. Discret. Math..

[19]  Lance Fortnow,et al.  On the Power of Multi-Prover Interactive Protocols , 1994, Theor. Comput. Sci..

[20]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[21]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

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

[23]  Adi Shamir,et al.  Fully Parallelized Multi-Prover Protocols for NEXP-Time , 1997, J. Comput. Syst. Sci..

[24]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[25]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[26]  Ran Raz.  A Parallel Repetition Theorem , 1998, SIAM J. Comput..

[27]  Gilles Brassard,et al.  Cost of Exactly Simulating Quantum Entanglement with Classical Communication , 1999 .

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

[29]  Andris Ambainis,et al.  A new protocol and lower bounds for quantum coin flipping , 2001, STOC '01.

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

[31]  Lev Vaidman,et al.  Tests of Bell inequalities , 2001, quant-ph/0107057.

[32]  P. K. Aravind.  The magic squares and Bell''s theorem , 2002 .

[33]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[34]  Quantum Theory: Concepts and Methods , 2002 .

[35]  Zhi-Wei Sun,et al.  A Lower Bound for {a+b: a in A, b in B, and P(a, b) != 0} , 2002, J. Comb. Theory A.

[36]  S. Wolf,et al.  The impossibility of pseudotelepathy without quantum entanglement , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[37]  Keiji Matsumoto,et al.  Quantum multi-prover interactive proof systems with limited prior entanglement , 2003, J. Comput. Syst. Sci..

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

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

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