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

WORLD SCIENTIFIC eBooks

FINITE-DIMENSIONAL APPROXIMATIONS OF QUANTUM SYSTEMS AND CONNES' EMBEDDING CONJECTURE

Volkher B. Scholz

Published Oct 1, 2013• 0 citations
Publisher

Abstract

We study the requirements for and implications of the existence of finite-dimensional approximations of quantum systems with an infinite number of degrees of freedom. We find a close relationship between these physical questions and the embedding problem of Alain Connes, appearing in the theory of von Neumann algebras. We are mainly interested in the bipartite scenario known from quantum information theory, where two independent parties act on a joint physical system, i.e. by performing measurements. This latter example leads to Tsirelson's problem, which asks whether the modeling of bipartite situations using the usual approach of tensor product of Hilbert spaces compared to the situation of only commuting observables leads to the same correlation tables. We model this situation using the theory of operator systems and explain the connection to Connes' embedding problem. We go on by employing the language of operator systems to elaborate on the requirements for the existence of finite-dimensional approximations for general quantum systems. We furthermore introduce the concept of ultraproducts of operator systems and use it to study the implications of two different kinds of finite-dimensional approximations. Note from Publisher: This article contains the abstract only.

DOI
10.1142/9789814449243_0056

Related papers

Unitary Correlation Sets and their Applications

S.J. Harris

We relate Connes' embedding problem in operator algebras to the Brown algebra Unc(n), which is defined as the universal unital C*-algebra generated by the entries of an n x n unitary matrix. In particular, we show that the embedding problem is equivalent to determining whether or not the algebra Unc(n) has the weak expectation property for any (equivalently, all) n at least 2. From this perspective, we develop a theory of what we call unitary correlation sets. These sets are analogous to the usual sets of bipartite probabilistic correlations arising from the typical models in quantum information theory. We show that the analogue of the weak Tsirelson problem for unitary correlation sets is again equivalent to Connes' embedding problem. Moreover, we show that as long as Alice and Bob's unitaries are of size at least 2, the set of spatial unitary correlations is never a closed set. This result is analogous to a recent theorem of Slofstra, which states that the set of quantum probabilistic correlations is not closed, so long as the input and output sets are large enough. \n \nWe also discuss several applications of the theory of unitary correlation sets. First, we show that the class of extended non-local games known as quantum XOR games is a rich enough class to detect the validity of Connes' embedding problem. That is, the embedding problem has a positive answer if and only if the value of every quantum XOR game in the commuting model agrees with the value of the game in the approximate finite-dimensional model. Second, we use a C*-algebraic analogue of the quantum teleportation and super-dense coding maps from quantum information theory to obtain separations between the tensor product model (or "quantum spatial" model) and the approximate finite-dimensional model (or "quantum approximate" model), for matrix-valued generalizations of the usual Tsirelson corrleation sets. We use some of the intermediate results to also obtain separations between the matrix versions of the finite-dimensional model (or "quantum model") and the tensor product model.

•Jul 4, 2019•3 citations

Tsirelson's Problem

Volkher B. Scholz, Reinhard F. Werner

The situation of two independent observers conducting measurements on a joint quantum system is usually modelled using a Hilbert space of tensor product form, each factor associated to one observer. Correspondingly, the operators describing the observables are then acting non-trivially only on one of the tensor factors. However, the same situation can also be modelled by just using one joint Hilbert space, and requiring that all operators associated to different observers commute, i.e. are jointly measurable without causing disturbance. The problem of Tsirelson is now to decide the question whether all quantum correlation functions between two independent observers derived from commuting observables can also be expressed using observables defined on a Hilbert space of tensor product form. Tsirelson showed already that the distinction is irrelevant in the case that the ambient Hilbert space is of finite dimension. We show here that the problem is equivalent to the question whether all quantum correlation functions can be approximated by correlation function derived from finite-dimensional systems. We also discuss some physical examples which fulfill this requirement.

arXiv:0812.4305•Dec 22, 2008•134 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

Unitary induced channels and Tsirelson's problem

Michał Banacki, Paweł Horodecki

Motivated by a recent progress concerning quantum commuting and quantum tensor models of composed systems we investigate a notion of (generalized) unitary induced quantum channel. Using properties of Brown algebras we provide an equivalent characterization of discussed families in both tensor and commuting paradigms. In particular, we provide an equivalent formulation of Tsirelson's conjecture (Connes' embedding problem) in terms of considered paradigms based on protocols which do not require measurements performed on infinite-dimensional subsystems. As a result we show that there is a difference between quantum commuting and quantum tensor models for generalized unitary induced channels.

arXiv:2508.21808•Aug 29, 2025•0 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

Connes implies Tsirelson: a simple proof

Alexander Frei

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 $C^*(\mathrm{player})=C^*(\mathrm{inputs}|\mathrm{outputs})$ 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 $\mathcal{R}^ω$ 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 proof for the following reason: Since the recent refutation of the synchronous Tsirelson conjecture by MIP*=RE, there exists a nonlocal game which violates the synchronous Tsirelson conjecture, and by the proof of MIP*=RE even a synchronous such game. The approach however is based on contradiction with the undecidability of the Halting problem, and so remains implicit. As such the quest now has started to give an explicit example of a synchronous game violating the synchronous Tsirelson conjecture together with a direct argument for the failure, and the current article serves as a direct translation to the corresponding operator algebra and its tracial state violating the Connes embedding problem.

arXiv:2209.07940•Sep 16, 2022•2 citations
We study the requirements for and implications of the existence of finite-dimensional approximations of quantum systems with an infinite number of degrees of freedom. We find a close relationship between these physical questions and the embedding problem of Alain Connes, appearing in the theory of von Neumann algebras. We are mainly interested in the bipartite scenario known from quantum information theory, where two independent parties act on a joint physical system, i.e. by performing measurements. This latter example leads to Tsirelson's problem, which asks whether the modeling of bipartite situations using the usual approach of tensor product of Hilbert spaces compared to the situation of only commuting observables leads to the same correlation tables. We model this situation using the theory of operator systems and explain the connection to Connes' embedding problem. We go on by employing the language of operator systems to elaborate on the requirements for the existence of finite-dimensional approximations for general quantum systems. We furthermore introduce the concept of ultraproducts of operator systems and use it to study the implications of two different kinds of finite-dimensional approximations. Note from Publisher: This article contains the abstract only.
We relate Connes' embedding problem in operator algebras to the Brown algebra Unc(n), which is defined as the universal unital C*-algebra generated by the entries of an n x n unitary matrix. In particular, we show that the embedding problem is equivalent to determining whether or not the algebra Unc(n) has the weak expectation property for any (equivalently, all) n at least 2. From this perspective, we develop a theory of what we call unitary correlation sets. These sets are analogous to the usual sets of bipartite probabilistic correlations arising from the typical models in quantum information theory. We show that the analogue of the weak Tsirelson problem for unitary correlation sets is again equivalent to Connes' embedding problem. Moreover, we show that as long as Alice and Bob's unitaries are of size at least 2, the set of spatial unitary correlations is never a closed set. This result is analogous to a recent theorem of Slofstra, which states that the set of quantum probabilistic correlations is not closed, so long as the input and output sets are large enough. \n \nWe also discuss several applications of the theory of unitary correlation sets. First, we show that the class of extended non-local games known as quantum XOR games is a rich enough class to detect the validity of Connes' embedding problem. That is, the embedding problem has a positive answer if and only if the value of every quantum XOR game in the commuting model agrees with the value of the game in the approximate finite-dimensional model. Second, we use a C*-algebraic analogue of the quantum teleportation and super-dense coding maps from quantum information theory to obtain separations between the tensor product model (or "quantum spatial" model) and the approximate finite-dimensional model (or "quantum approximate" model), for matrix-valued generalizations of the usual Tsirelson corrleation sets. We use some of the intermediate results to also obtain separations between the matrix versions of the finite-dimensional model (or "quantum model") and the tensor product model.
The situation of two independent observers conducting measurements on a joint quantum system is usually modelled using a Hilbert space of tensor product form, each factor associated to one observer. Correspondingly, the operators describing the observables are then acting non-trivially only on one of the tensor factors. However, the same situation can also be modelled by just using one joint Hilbert space, and requiring that all operators associated to different observers commute, i.e. are jointly measurable without causing disturbance. The problem of Tsirelson is now to decide the question whether all quantum correlation functions between two independent observers derived from commuting observables can also be expressed using observables defined on a Hilbert space of tensor product form. Tsirelson showed already that the distinction is irrelevant in the case that the ambient Hilbert space is of finite dimension. We show here that the problem is equivalent to the question whether all quantum correlation functions can be approximated by correlation function derived from finite-dimensional systems. We also discuss some physical examples which fulfill this requirement.
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.
Motivated by a recent progress concerning quantum commuting and quantum tensor models of composed systems we investigate a notion of (generalized) unitary induced quantum channel. Using properties of Brown algebras we provide an equivalent characterization of discussed families in both tensor and commuting paradigms. In particular, we provide an equivalent formulation of Tsirelson's conjecture (Connes' embedding problem) in terms of considered paradigms based on protocols which do not require measurements performed on infinite-dimensional subsystems. As a result we show that there is a difference between quantum commuting and quantum tensor models for generalized unitary induced channels.
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.
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 C∗(player)=C∗(inputs∣outputs)C^*(\mathrm{player})=C^*(\mathrm{inputs}|\mathrm{outputs})C∗(player)=C∗(inputs∣outputs) 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 Rω\mathcal{R}^ωRω 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 proof for the following reason: Since the recent refutation of the synchronous Tsirelson conjecture by MIP*=RE, there exists a nonlocal game which violates the synchronous Tsirelson conjecture, and by the proof of MIP*=RE even a synchronous such game. The approach however is based on contradiction with the undecidability of the Halting problem, and so remains implicit. As such the quest now has started to give an explicit example of a synchronous game violating the synchronous Tsirelson conjecture together with a direct argument for the failure, and the current article serves as a direct translation to the corresponding operator algebra and its tracial state violating the Connes embedding problem.