Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Connes' embedding problem and Tsirelson's problem (1008.1142v1)

Published 6 Aug 2010 in math-ph, math.MP, and quant-ph

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$_1$ factor is a subfactor of the ultrapower of the hyperfinite II$_1$ 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.

Summary

We haven't generated a summary for this paper yet.