The Connes-Kirchberg Problem and infinite-dimensional phenomena in quantum information theory
Magdalena Musat
TL;DR
This paper surveys the deep connections between the Connes Embedding Problem, Kirchberg's reformulations, Tsirelson's conjecture, and the theory of factorizable quantum channels. It highlights how correlation matrices of unitaries encode CEP obstructions and how factorizable maps can fail to be realizable with finite-dimensional ancillas, even as they arise from mixtures of unitaries. It provides a self-contained finite-dimensional proof of Tsirelson's theorem and presents new obstructions showing that some channels are not k-noisy for any k≥2, underscoring infinite-dimensional phenomena. The work also integrates recent breakthroughs (MIP* = RE) to explain why CEP has a negative resolution and discusses the resulting exotic ancilla behavior and non-closure phenomena in correlation-sets.
Abstract
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).
