186 citations · 187 across the 3 of their papers we have counts for
3 papers
Connes' embedding problem and Tsirelson's problem
M. Junge, M. Navascues, C. Palazuelos +3
We show that Tsirelson's problem concerning the set of quantum correlations and Connes' embedding problem on finite approximations in von Neumann algebras (known to be equivalent t…
Tripartite probability distributions and communication complexity
Carlos Palazuelos, David Perez-Garcia, Ignacio Villanueva
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…
The communication complexity of XOR games via summing operators
C. Palazuelos, D. Perez-Garcia, I. Villanueva
The discrepancy method is widely used to find lower bounds for communication complexity of XOR games. It is well known that these bounds can be far from optimal. In this context Di…