Connes' embedding problem and Tsirelson's problem
arXiv:1008.1142 · doi:10.1063/1.3514538
Abstract
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 to Kirchberg's QWEP conjecture) are essentially equivalent. Specifically, Tsirelson's problem asks whether the set of bipartite quantum correlations generated between tensor product separated systems is the same as the set of correlations between commuting C*-algebras. Connes' embedding problem asks whether any separable II factor is a subfactor of the ultrapower of the hyperfinite II factor. We show that an affirmative answer to Connes' question implies a positive answer to Tsirelson's. Conversely, a positve answer to a matrix valued version of Tsirelson's problem implies a positive one to Connes' problem.
References in corpus (6)
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Bounding the set of quantum correlations
- Unbounded violation of tripartite Bell inequalities
- Tsirelson's Problem
- Connes' Embedding Problem and Lance's WEP
- Quotients, exactness, and nuclearity in the operator system category