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

arXiv:2508.21808

Unitary induced channels and Tsirelson's problem

Michał Banacki, Paweł Horodecki

Published Aug 29, 2025• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2508.21808

Related papers

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•0 citations

Fermions and the Tsirelson Problem in Real Quantum Theory

Timothee Hoffreumon, Mischa P. Woods

In a previous work, we showed that real quantum theory (RQT) cannot be experimentally distinguished from ordinary quantum theory (QT). In this paper, we investigate whether this indistinguishability survives two natural extensions of the setting: allowing separated measurements to be represented by commuting rather than tensor-product observables, and imposing superselection rules, as in fermionic information theory. We show that it does in both cases. Our first result is a positive answer to the Tsirelson problem in RQT: commuting and tensor-product measurements generate the same finite-dimensional correlations. This is surprisingly not a trivial consequence of the standard complex proof, as it does not carry over to the reals. The proof obstruction becomes particularly relevant in the presence of superselection rules, which is why we first establish the equivalence in RQT before extending the framework to superselected RQT. Our second result is a local, real quantum formulation of superselected theories. We extend the RQT framework to accommodate a representation of superselection over the reals and show, in particular, that it admits a fermionic version whose predictions are experimentally indistinguishable from those of fermionic information theory. More generally, the construction extends to all superselected QTs.

quant-pharXiv:2610.06767•Oct 6, 2026•0 citations

On steering in the C*-algebraic framework

Michał Banacki

We discuss a scenario of bipartite steering with local subsystems of the parties modeled by certain operator algebras. In particular, we formalize the notion of quantum assemblages in a commuting observables paradigm and focus on equivalent descriptions of such objects providing a systematic analysis of previously scattered approaches. We provide necessary and sufficient conditions for the equivalence of quantum commuting and tensor models that is stable under extensions of the trusted subsystem by arbitrary finite-dimensional ancillae. As a result, we show that the gap between two models of bipartite steering can be observed in an arbitrary scenario with two measurement settings ($m = 2$) and more than two outcomes ($k > 2$). We also demonstrate that the identified gap is independent of nonlocality arising from the refutation of Tsirelson's conjecture. Finally, we provide no-go results concerning the possibility of post-quantum steering in this most general bipartite paradigm and discuss related corollaries regarding free probability and operator system approach as well as a link to Tsirelson's problem.

arXiv:2306.14344•Jun 25, 2023•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•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

On Tsirelson pairs of C*-algebras

Isaac Goldbring, Bradd Hart

We introduce the notion of a Tsirelson pair of C*-algebras, which is a pair of C*-algebras for which the space of quantum strategies obtained by using states on the minimal tensor product of the pair is dense in the space of quantum strategies obtained by using states on the maximal tensor product. We exhibit a number of examples of such pairs that are “nontrivial” in the sense that the minimal tensor product and the maximal tensor product of the pair are not isomorphic. For example, we prove that any pair containing a C*-algebra with Kirchberg’s QWEP property is a Tsirelson pair. We then introduce the notion of a C*-algebra with the Tsirelson property (TP) and establish a number of closure properties for this class. We also show that the class of C*-algebras with the TP forms an elementary class (in the sense of model theory), but that this class does not admit an effective axiomatization.

arXiv:2210.15509•Reviews in Mathematical Physics•May 13, 2023•3 citations
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.
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).
In a previous work, we showed that real quantum theory (RQT) cannot be experimentally distinguished from ordinary quantum theory (QT). In this paper, we investigate whether this indistinguishability survives two natural extensions of the setting: allowing separated measurements to be represented by commuting rather than tensor-product observables, and imposing superselection rules, as in fermionic information theory. We show that it does in both cases. Our first result is a positive answer to the Tsirelson problem in RQT: commuting and tensor-product measurements generate the same finite-dimensional correlations. This is surprisingly not a trivial consequence of the standard complex proof, as it does not carry over to the reals. The proof obstruction becomes particularly relevant in the presence of superselection rules, which is why we first establish the equivalence in RQT before extending the framework to superselected RQT. Our second result is a local, real quantum formulation of superselected theories. We extend the RQT framework to accommodate a representation of superselection over the reals and show, in particular, that it admits a fermionic version whose predictions are experimentally indistinguishable from those of fermionic information theory. More generally, the construction extends to all superselected QTs.
We discuss a scenario of bipartite steering with local subsystems of the parties modeled by certain operator algebras. In particular, we formalize the notion of quantum assemblages in a commuting observables paradigm and focus on equivalent descriptions of such objects providing a systematic analysis of previously scattered approaches. We provide necessary and sufficient conditions for the equivalence of quantum commuting and tensor models that is stable under extensions of the trusted subsystem by arbitrary finite-dimensional ancillae. As a result, we show that the gap between two models of bipartite steering can be observed in an arbitrary scenario with two measurement settings (m=2m = 2m=2) and more than two outcomes (k>2k > 2k>2). We also demonstrate that the identified gap is independent of nonlocality arising from the refutation of Tsirelson's conjecture. Finally, we provide no-go results concerning the possibility of post-quantum steering in this most general bipartite paradigm and discuss related corollaries regarding free probability and operator system approach as well as a link to Tsirelson's problem.
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.
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.
We introduce the notion of a Tsirelson pair of C*-algebras, which is a pair of C*-algebras for which the space of quantum strategies obtained by using states on the minimal tensor product of the pair is dense in the space of quantum strategies obtained by using states on the maximal tensor product. We exhibit a number of examples of such pairs that are “nontrivial” in the sense that the minimal tensor product and the maximal tensor product of the pair are not isomorphic. For example, we prove that any pair containing a C*-algebra with Kirchberg’s QWEP property is a Tsirelson pair. We then introduce the notion of a C*-algebra with the Tsirelson property (TP) and establish a number of closure properties for this class. We also show that the class of C*-algebras with the TP forms an elementary class (in the sense of model theory), but that this class does not admit an effective axiomatization.