The communication complexity of non-signaling distributions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5734 LNCS, Issue , 2009, Pages 270-281

  Degorre, Julien ^a   Kaplan, Marc ^b   Laplante, Sophie ^b   Roland, Jérémie ^c  

^a CNRS   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL COMMUNICATION; COMMUNICATION COMPLEXITY; ELEMENTARY PROOF; INFORMATION-THEORETIC METHODS; JOINT DISTRIBUTIONS; LINEAR PROGRAMS; LOWER BOUND METHOD; LOWER BOUNDS; MARGINAL DISTRIBUTION; MARGINALS; QUANTUM COMMUNICATION; QUANTUM COMMUNICATION COMPLEXITY; QUANTUM STATE; SIMULTANEOUS MESSAGES; UPPER BOUND; WINNING PROBABILITY;

BELLS; COMPUTER SCIENCE; CONTROL THEORY; DISTRIBUTION FUNCTIONS; GAME THEORY; INFORMATION THEORY; PROGRAM INTERPRETERS; SIGNALING;

BOOLEAN FUNCTIONS;

EID: 70349336963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_24     Document Type: Conference Paper

References (27)

1. Yao, A.C.C.: Some complexity questions related to distributive computing. In: Proc. 11th STOC, pp. 209-213 (1979)
2. Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, New York (1997)
3. Maudlin, T.: Bell's inequality, information transmission, and prism models. In: Biennal Meeting of the Philosophy of Science Association, pp. 404-417 (1992)
4. Brassard, G., Cleve, R., Tapp, A.: Cost of Exactly Simulating Quantum Entanglement with Classical Communication. Phys. Rev. Lett. 83, 1874-1877 (1999); quant-ph/9901035
5. Steiner, M.: Towards quantifying non-local information transfer: finite-bit non-locality. Phys. Lett. A 270, 239-244 (2000)
6. Toner, B.F., Bacon, D.: Communication Cost of Simulating Bell Correlations. Phys. Rev. Lett. 91, 187904 (2003)
7. Cerf, N.J., Gisin, N., Massar, S., Popescu, S.: Simulating Maximal Quantum Entanglement without Communication. Phys. Rev. Lett. 94(22), 220403 (2005)
8. Degorre, J., Laplante, S., Roland, J.: Classical simulation of traceless binary observables on any bipartite quantum state. Phys. Rev. A 75(012309) (2007)
9. Regev, O., Toner, B.: Simulating quantum correlations with finite communication. In: Proc. 48th FOCS, pp. 384-394 (2007)
10. Shi, Y., Zhu, Y.: Tensor norms and the classical communication complexity of nonlocal quantum measurement. SIAM J. Comput. 38(3), 753-766 (2008)
11. Jones, N.S., Masanes, L.: Interconversion of nonlocal correlations. Phys. Rev. A 72, 052312 (2005)
12. Barrett, J., Pironio, S.: Popescu-Rohrlich correlations as a unit of nonlocality. Phys. Rev. Lett. 95, 140401 (2005)
13. Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms 34(3), 368-394 (2009)
14. Navascues, M., Pironio, S., Acin, A.: A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. New J. Phys. 10(7), 073013 (2008)
15. Randall, C.H., Foulis, D.J.: Operational statistics and tensor products. In: Interpretations and Foundations of Quantum Theory, Volume Interpretations and Foundations of Quantum Theory, pp. 21-28. Wissenschaftsverlag, BibliographischesInstitut (1981)
16. Foulis, D.J., Randall, C.H.: Empirical logic and tensor products. In: Interpretations and Foundations of Quantum Theory, Volume Interpretations and Foundations of Quantum Theory, pp. 1-20. Wissenschaftsverlag, BibliographischesInstitut (1981)
17. Kläy, M., Randall, C.H., Foulis, D.J.: Tensor products and probability weights. Int. J. Theor. Phys. 26(3), 199-219 (1987)
18. Wilce, A.: Tensor products in generalized measure theory. Int. J. Theor. Phys. 31(11), 1915-1928 (1992)
19. Barrett, J.: Information processing in generalized probabilistic theories. Phys. Rev. A 75(3), 032304 (2007)
20. Alon, N., Naor, A.: Approximating the cut-norm via Grothendieck's inequality. SIAM J. Comput. 35(4), 787-803 (2006)
21. Tsirelson, B.S.: Zapiski Math. Inst. Steklov (LOMI) 142, 174-194 (1985)
22. English translation in Quantum analogues of the Bell inequalities. The case of two spatially separated domains. J. Soviet Math. 36, 557-570 (1987)
23. Linial, N., Mendelson, S., Schechtman, G., Shraibman, A.: Complexity measures of sign matrices. Combinatorica 27, 439-463 (2007)
24. Bell, J.S.: On the Einstein Podolsky Rosen paradox. Physics 1, 195 (1964)
25. Tsirelson, B.S.: Quantum generalizations of Bell's inequality. Lett. Math. Phys. 4(2), 93-100 (1980)
26. Yao, A.C.C.: On the power of quantum fingerprinting. In: Proc. 35th STOC, pp. 77-81 (2003)
27. Gavinsky, D., Kempe, J., de Wolf, R.: Strengths and weaknesses of quantum fingerprinting. In: Proc. 21st CCC, pp. 288-295 (2006)