Consequences and limits of nonlocal strategies

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 236-249

  Cleve, Richard ^a   Høyer, Peter ^a   Toner, Benjamin ^b   Watrous, John ^a  

^a UNIVERSITY OF CALGARY   (Canada)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; PROBABILITY; QUANTUM THEORY; SET THEORY; THEOREM PROVING;

COOPERATIVE GAMES; NONLOCAL STRATEGIES; TSIRELSON INEQUALITY;

INFORMATION SCIENCE;

EID: 4944260870     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (41)

1. N. Alon and A. Naor. Approximating the cut-norm via Grothendieck's inequality. In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, 2004.
2. A. Amhainis, 2001. Personal communication.
3. P. K. Aravind. The magic squares and Bell's theorem. Manuscript, 2002. arXiv.org e-Print quant-ph/0206070.
4. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
5. J. Bell. On me Einsteiu-Podolsky-Rosen paradox. Physics, 1(3): 195-200, 1964.
6. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximability -towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998.
7. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: how to remove intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 113-131, 1988.
8. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
9. G. Brassard, R. Cleve, and A. Tapp. Cost of exactly simulating quantum entanglement with classical communication. Physical Review Letters, 83(9): 1874-1877, 1999.
10. S. Braunstein and C Caves. Wringing out better Bell inequalities. Annals of Physics, 202:22-56, 1990.
11. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 63-68, 1998.
12. J. Cai, A. Condon, and R. Lipton. On bounded round multi-prover interactive proof systems. In Proceedings of the Fifth Annual Conference on Structure in Complexity Theory, pages 45-54, 1990.
13. J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23(15):880-884, 1969.
14. S. Dasgupta and A. Gupta. An elementary proof of the Johnson- Lindenstrauss lemma. Technical Report TR-99006, International Computer Science Institute, Berkeley, California, 1999.
15. G. Unpublished note, 1984.
16. U. Feige. On the success probability of two provers in one-round proof systems. In Proceedings of the Sixth Annual Conference on Structure in Complexity Theory, pages 116-123, 1991.
17. U. Feige and L. Lovàsz. Two-prover one-round proof systems: their power and their problems. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pages 733-744, 1992.
18. S. R. Finch. Mathematical Constants. Cambridge University Press, 2003.
19. P. Fishbum and J. Reeds. Bell inequalities, Grothendieck's constant, and root two. SIAM Journal on Discrete Mathematics, 7:48-56, 1994.
20. L. Fortnow, J. Rompel, and M. Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science, 134:545-557, 1994.
21. P. Frankl and V. Rodl. Forbidden intersections. Transactions of the American Mathematical Society, 300(1):259-286, 1987.
22. V. Galliard, A. Tapp, and S. Wolf. The impossibility of pseudo-telepathy without quantum entanglement. arXiv.org e-Print quant-ph/0211011, 2002.
23. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
24. A. Grothendieck. Résumé de la théorie métrique des produits tensoriels topologiques. Boletim Da Sociedade de Matemática de Sáo Paulo, 8:1-79, 1953.
25. J. Håstad, Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
26. P. Heywood and M. L. G. Redhead. Nonlocality and the Kochen-Specker paradox. Foundations of Physics, 13:481-499, 1983.
27. W. Johnson and J. Lindenstrauss. Extensions of Lipschitz maps into a Hubert space. Contemporary Mathematics, 26:189-206, 1984.
28. L. A. Khalfin and B. S. (Tsirelson) Tsirel'son. Quantum and quasi-classical analogs of Bell inequalities. In P. Lahti and P. Mittelstaedt, editors, Symposium on the Foundations of Modern Physics, pages 441-460. World Scientific, 1985.
29. H. Kobayashi and K. Matsumoto. Quantum multi-prover interactive proof systems with limited prior entanglement. Journal of Computer and System Sciences, 66(3):429-450, 2003.
30. S. Kochen and E. P. Specker. The problem of hidden variables in quantum mechanics. Journal of Mathematics and Mechanics, 17:59-87, 1967.
31. J. L. Krivine. Constantes de Grothendieck et fonctions de type positif sur les sphères. Advances in Mathematics, 31:16-30, 1979.
32. D. Lapidot and A. Shamir. Fully parallelized multi prover protocols for NEXP-time. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 13-18, 1991.
33. N. D. Mermin. Simple unified form for no-hidden variables theorems. Physical Review Letters, 65:3373-3376, 1990.
34. N. D. Mermin. Hidden variables and the two theorems of John Bell. Reviews of Modern Physics, 65(3):803-81s5, 1993.
35. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
36. A. Peres. Quantum Theory: Concepts and Methods. Kluwer, 1993.
37. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
38. J. A. Reeds. A new lower bound on the real Grothendieck constant. Unpublished note, 1991.
39. B. S. (Tsirelson) Cirel'son. Quantum generalizations of Bell's inequality. Letters in Mathematical Physics, 4(2):93-100, 1980.
40. B. S. (Tsirelson) Tsirel'son. Quantum analogues of the Bell inequalities: The case of two spatially separated domains. Journal of Soviet Mathematics, 36:557-570, 1987.
41. L. Vaidman. Tests of Bell inequalities. arXiv.org e-Print quant-ph/0107057, 2001.