English

Tripartite probability distributions and communication complexity

Quantum Physics 2011-01-18 v2 Computational Complexity

Abstract

We show that every tripartite quantum correlation generated with a Schmidt state (in particular every correlation generated with the GHZ state) can be simulated with the sending of two bits of classical communication from Alice to Bob and Charlie plus the sending of two bits of classical communication from Bob to Charlie. This extends recent results which showed that the maximal violation of Bell inequalities attainable by these correlations is uniformly bounded. For simplicity, we state and prove the result for three parties, but the generalization to the case of nn parties follows easily. We also show that every nn-partite probability distribution generated with local resources plus cc-bits of local communication can violate a Bell inequality by at most a factor of 2c2^c.

Keywords

Cite

@article{arxiv.1006.5318,
  title  = {Tripartite probability distributions and communication complexity},
  author = {Carlos Palazuelos and David Perez-Garcia and Ignacio Villanueva},
  journal= {arXiv preprint arXiv:1006.5318},
  year   = {2011}
}

Comments

This paper has been withdrawn by the authors. We believe the main result to be true, but the proof is not correct. We are at the moment trying to fix it

R2 v1 2026-06-21T15:41:47.503Z