Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Property (T) and residually finite groups

Gilles Pisier

Published Feb 10, 2020• 0 citations
Publisher

Abstract

This is a brief excursion into a topic that belongs to quantum information theory. We prove here that the Connes-Kirchberg problem is equivalent to a question raised by Tsirelson in connection with quantum mechanics. The question involves correlation matrices of various kinds that we discuss using operator valued measures in order to highlight the equivalence of the Tsirelson problem with the LLP of certain free product C*-algebras.

DOI
10.1017/9781108782081.018

Related papers

Tsirelson's problem and asymptotically commuting unitary matrices

Narutaka Ozawa

In this paper, we consider quantum correlations of bipartite systems having a slight interaction, and reinterpret Tsirelson's problem (and hence Kirchberg's and Connes's conjectures) in terms of finite-dimensional asymptotically commuting positive operator valued measures. We also consider the systems of asymptotically commuting unitary matrices and formulate the Stronger Kirchberg Conjecture.

arXiv:1211.2712•Journal of Mathematical Physics•Mar 1, 2013•58 citations

The Connes-Kirchberg Problem and infinite-dimensional phenomena in quantum information theory

Magdalena Musat

We give an overview of results tying together a circle of problems connected to the Connes Embedding Problem, Kirchberg's reformulations thereof, Tsirelson's conjecture and its relation to quantum information theory, and a class of quantum channels, called factorizable, introduced by Anantharaman-Delaroche. While parts of the article are more expository, there are new results, including obstructions for channels to being $k$-noisy (admitting a factorization through a full matrix algebra).

arXiv:2512.00432•Nov 29, 2025•2 citations

Quantum correlation matrices and Tsirelson’s problem: Previous work and three-player considerations

Gerrit Vos

Tsirelson once claimed that the set of quantum correlations, defined by strategies of non-local two-player games, does not depend on which of two possible models is chosen: the tensor product model or the commuting operator model. He later came back from this claim, and the resulting conjecture is now known as Tsirelson’s problem. The problem has since been proven equivalent to notoriously hard problems in operator theory, such as the Connes’ Embedding Problem and the QWEP conjecture. In this master thesis, we look at the finite dimensional case of Tsirelson’s problem, working out all the details of an existing proof and giving a new, shorter proof which also extends to the nuclear case. Moreover, we give an overview of the equivalence of Tsirelson’s problem and two of Kirchberg’s conjectures, including the QWEP conjecture. Finally, we give some results and considerations for the three-player case of Tsirelson’s problem. The appendix contains proofs of many related results used throughout the thesis, and also a beginner’s introduction to quantum mechanics.

•Jan 1, 2019•0 citations

Quantum Correlations and Group C*-Algebras

Fritz, Tobias

(a) Why quantum correlations are weird: Hardy’s nonlocality paradox, (b) Brief recap of quantum kinematics, (c) The relevance of group C∗-algebras, (d) Results for two iterated binary measurements, (e) Outlook: From Kirchberg’s conjectures to Tsirelson’s problem. Hardy’s nonlocality paradox as a possibilistic Bell inequality. The most basic scenario for demonstrating what quantum correlations are is the following: there are two parties, com-monly dubbed Alice and Bob, experimenting in distant labs. They each receive a physical system prepared in some way, e.g. a photon, from a common source:

•Jan 1, 2014•0 citations

Algèbres de von Neumann, produits tensoriels, corrélations quantiques et calculabilité [d'après Ji, Natarajan, Vidick, Wright et Yuen]

de La Salle, Mikael

En 1976, Connes demande si toute algèbre de von Neumann finie se plonge dans un ultraproduit d'algèbres de matrices. En 1980, Tsirelson demande si, dans la formulation mathématique de la mécanique quantique, autoriser des espaces de Hilbert de dimension infinie change fondamentalement le modèle. En 1993, Kirchberg conjecture que le produit tensoriel de deux copies de la C*-algèbre pleine du groupe libre de rang infini dénombrable peut être muni d'une unique norme de C*-algèbre. De manière surprenante et non triviale, ces trois problèmes sont en fait équivalents, c'est maintenant bien compris. Ces problèmes viennent d'être résolus, par la négative, avec des méthodes d'informatique : calculabilité, complexité, et informatique quantique. Je ferai de mon mieux pour raconter les grandes lignes de cette très longue preuve.

•Jan 1, 2023•0 citations

MIP* = RE: A negative resolution to Connes’ embedding problem and Tsirelson’s problem

Thomas Vidick

Connes’ Embedding Problem is a deep question on approximability of certain tracial von Neumann algebras by finite-dimensional matrix algebras. We survey the connections between operator algebras, quantum information and theoretical computer science that enabled the recent resolution of this problem. The resolution goes through an equivalent formulation, known as Tsirelson’s problem, in terms of separating convex sets whose definition is motivated by the study of nonlocality in quantum mechanics. We construct an explicit separating hyperplane using the theory of two-player games from complexity theory.

EMS Press eBooks•Dec 15, 2023•1 citation
This is a brief excursion into a topic that belongs to quantum information theory. We prove here that the Connes-Kirchberg problem is equivalent to a question raised by Tsirelson in connection with quantum mechanics. The question involves correlation matrices of various kinds that we discuss using operator valued measures in order to highlight the equivalence of the Tsirelson problem with the LLP of certain free product C*-algebras.
We give an overview of results tying together a circle of problems connected to the Connes Embedding Problem, Kirchberg's reformulations thereof, Tsirelson's conjecture and its relation to quantum information theory, and a class of quantum channels, called factorizable, introduced by Anantharaman-Delaroche. While parts of the article are more expository, there are new results, including obstructions for channels to being kkk-noisy (admitting a factorization through a full matrix algebra).
Tsirelson once claimed that the set of quantum correlations, defined by strategies of non-local two-player games, does not depend on which of two possible models is chosen: the tensor product model or the commuting operator model. He later came back from this claim, and the resulting conjecture is now known as Tsirelson’s problem. The problem has since been proven equivalent to notoriously hard problems in operator theory, such as the Connes’ Embedding Problem and the QWEP conjecture. In this master thesis, we look at the finite dimensional case of Tsirelson’s problem, working out all the details of an existing proof and giving a new, shorter proof which also extends to the nuclear case. Moreover, we give an overview of the equivalence of Tsirelson’s problem and two of Kirchberg’s conjectures, including the QWEP conjecture. Finally, we give some results and considerations for the three-player case of Tsirelson’s problem. The appendix contains proofs of many related results used throughout the thesis, and also a beginner’s introduction to quantum mechanics.
(a) Why quantum correlations are weird: Hardy’s nonlocality paradox, (b) Brief recap of quantum kinematics, (c) The relevance of group C∗-algebras, (d) Results for two iterated binary measurements, (e) Outlook: From Kirchberg’s conjectures to Tsirelson’s problem. Hardy’s nonlocality paradox as a possibilistic Bell inequality. The most basic scenario for demonstrating what quantum correlations are is the following: there are two parties, com-monly dubbed Alice and Bob, experimenting in distant labs. They each receive a physical system prepared in some way, e.g. a photon, from a common source:
En 1976, Connes demande si toute algèbre de von Neumann finie se plonge dans un ultraproduit d'algèbres de matrices. En 1980, Tsirelson demande si, dans la formulation mathématique de la mécanique quantique, autoriser des espaces de Hilbert de dimension infinie change fondamentalement le modèle. En 1993, Kirchberg conjecture que le produit tensoriel de deux copies de la C*-algèbre pleine du groupe libre de rang infini dénombrable peut être muni d'une unique norme de C*-algèbre. De manière surprenante et non triviale, ces trois problèmes sont en fait équivalents, c'est maintenant bien compris. Ces problèmes viennent d'être résolus, par la négative, avec des méthodes d'informatique : calculabilité, complexité, et informatique quantique. Je ferai de mon mieux pour raconter les grandes lignes de cette très longue preuve.
Connes’ Embedding Problem is a deep question on approximability of certain tracial von Neumann algebras by finite-dimensional matrix algebras. We survey the connections between operator algebras, quantum information and theoretical computer science that enabled the recent resolution of this problem. The resolution goes through an equivalent formulation, known as Tsirelson’s problem, in terms of separating convex sets whose definition is motivated by the study of nonlocality in quantum mechanics. We construct an explicit separating hyperplane using the theory of two-player games from complexity theory.