Connes implies Tsirelson: a simple proof
Alexander Frei

TL;DR
This paper provides a simple, elementary proof that Connes' embedding problem implies the synchronous Tsirelson conjecture, avoiding deep operator algebra results and offering insights relevant to quantum information theory.
Contribution
It offers a straightforward proof linking Connes' embedding problem to the synchronous Tsirelson conjecture using elementary tools and constructs a more accessible version of Connes' algebra for quantum information applications.
Findings
A simple proof connecting Connes' problem to Tsirelson conjecture
A new construction of Connes' algebra suitable for quantum info
Implications for nonlocal games and quantum correlations
Abstract
More precisely, we give a simple and very short proof of "the Connes embedding problem implies the synchronous Tsirelson conjecture" that relies on only two elementary ingredients: 1) the well-known description of synchronous correlations as traces on the algebra per player and 2) an elementary lifting result by Kim, Paulsen and Schafhauser. Moreover, this bypasses every of the deep results by Kirchberg as well as any other implicit reformulation as the microstates conjecture and thelike. Meanwhile, we also give a different construction of Connes' algebra appearing in the Connes embedding problem, which is more suitable for the purposes of quantum information theory and much easier to comprehend for the reader without any prior knowledge in operator algebras. Most importantly, however, we present this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Advanced Operator Algebra Research
