Simulating quantum correlations with finite communication

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 384-394

  Regev, Oded ^a   Toner, Ben ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS;

(2+1)-DIMENSIONAL; (P ,P ,T) MEASUREMENTS; POWER SERIES METHODS; QUANTUM CORRELATIONS; QUANTUM STATES; SPHERICAL(PIVOT); TETRAHEDRA (T);

CORRELATION METHODS;

EID: 46749153448     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389509     Document Type: Conference Paper

References (31)

1. N. Alon, K. Makarychev, Y. Makarychev, and A. Naor. Quadratic forms on graphs. Invent. Math., 163(3):499-522, 2006.
2. N. Alon and A. Naor. Approximating the cut-norm via Grothendieck's inequality. In Proc. of the 36th ACM STOC, pages 72-80, New York, 2004. ACM Press.
3. S. Arora, E. Berger, E. Hazan, G. Kindler, and S. Safra. On non-approximability for quadratic programs. Annual Symposium on Foundations of Computer Science, 46:206-215, 2005.
4. D. Bacon and B. F. Toner. How to simulate quantum correlations. Unpublished.
5. D. Bacon and B. F. Toner. Bell inequalities with auxiliary communication. Phys. Rev. Lett., 90:157904, 2003.
6. J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1:195-200, 1964.
7. M. Berger. Geometry. II. Universitext. Springer-Verlag, Berlin, 1987.
8. G. Brassard, R. Cleve, and A. Tapp. Cost of exactly simulating quantum entanglement with classical communication. Phys. Rev. Lett., 83:1874-1877, 1999.
9. N. J. Cerf, N. Gisin, and S. Massar. Classical teleportation of a quantum bit. Physical Review Letters, 84:2521, 2000.
10. N. J. Cerf, N. Gisin, S. Massar, and S. Popescu. Simulating maximal quantum entanglement without communication. Phys. Rev. Lett., 94(22):220403, 2005.
11. M. Charikar and A. Wirth. Maximizing quadratic programs: extending Grothendieck's inequality. Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on, pages 54-60, 2004.
12. J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23:880-884, 1969.
13. J. Degorre, S. Laplante, and J. Roland. Simulating quantum correlations as a distributed sampling problem. Phys. Rev. A, 72(6):062314, 2005.
14. J. Degorre, S. Laplante, and J. Roland. Classical simulation of traceless binary observables on any bipartite quantum state. Phys. Rev. A, 75(1):012309, 2007.
15. A. Einstein, P. Podolsky, and N. Rosen. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev., 47:777-780, 1935.
16. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach., 42(6): 1115-1145, 1995.
17. 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, 1953.
18. H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX 3SAT? In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), pages 406-415, 1997.
19. S. G. Krantz and H. R. Parks. A primer of real analytic functions. Birkhäuser Advanced Texts: Basler Lehrbücher. Birkhäuser Boston Inc., Boston, MA, second edition, 2002.
20. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Comput. Complexity, 8(1):21-49, 1999. Preliminary version in STOC'95.
21. J. L. Krivine. Constantes de Grothendieck et fonctions de type positif sur les sphères. Adv. Math., 31:16-30, 1979.
22. S. Massar, D. Bacon, N. J. Cerf, and R. Cleve. Classical simulation of quantum entanglement without local hidden variables. Phys. Rev. A, 63(5):052305, Apr 2001.
23. T. Maudlin. Bell's inequality, information transmission, and prism models. In D. Hull, M. Forbes, and K. Okruhlik, editors, PSA 1992, Volume 1, pages 404-417, East Lansing, 1992. Philosophy of Science Association.
24. P. M. Morse and H. Feshbach. Methods of Theoretical Physics, Parti. McGraw-Hill, New York, 1953.
25. S. Pironio. Violations of Bell inequalities as lower bounds on the communication cost of nonlocal correlations. Phys. Rev. A, 68(6):062102, Dec 2003.
26. 2 < 1. Quart. J. Math, 2:269-300, 1858. Continued in Vol. 3 (1860), pp. 54-68 and pp. 97-108.
27. I. J. Schoenberg. Positive definite functions on spheres. Duke Math. J., 9:96-108, 1942.
28. Y. Shi and Y. Zhu. Tensor norms and the classical communication complexity of nonlocal quantum measurement. In STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 460-467, New York, 2005. ACM.
29. M. Steiner. Towards quantifying non-local information transfer: finite-bit non-locality. Phys. Lett. A, 270:239-244, 2000.
30. B. F. Toner and D. Bacon. Communication cost of simulating Bell correlations. Phys. Rev. Lett., 91:187904, 2003.
31. B. S. Tsirelson. Quantum analogues of the Bell inequalities. The case of two spatially separated domains. J. Soviet Math., 36:557-570, 1987.