Quantitative Tsirelson's Theorems via Approximate Schur's Lemma and Probabilistic Stampfli's Theorems
Abstract
Whether an almost-commuting pair of operators must be close to a commuting pair is a central question in operator and matrix theory. We investigate this problem for pairs of -subalgebras and of , showing that each operator in is -close in operator norm to an operator in the commutant under two complementary formulations of "-almost commutation." One formulation is probabilistic, requiring that the operators of have small commutators for most Haar-random unitaries acting on . This first formulation leads to two novel probabilistic generalizations of Stampfli's theorem, which relates an operator's distance from the scalars to the norm of its inner derivation. The second formulation is deterministic, requiring small commutators between the generators of and ; we analyze this using an approximate Schur's lemma formulated in terms of Weyl-Heisenberg (clock-and-shift) matrices. As an application of our results to quantum information theory, we obtain a quantitative Tsirelson's theorem: in dimension , every -almost quantum commuting observable model is well approximated by a quantum tensor-product model with error .
Keywords
Cite
@article{arxiv.2505.22309,
title = {Quantitative Tsirelson's Theorems via Approximate Schur's Lemma and Probabilistic Stampfli's Theorems},
author = {Xiangling Xu and Marc-Olivier Renou and Igor Klep},
journal= {arXiv preprint arXiv:2505.22309},
year = {2025}
}
Comments
25 pages, comments welcome. Update: alternative bounds for probabilistic Stampfli's theorem via Kemperman's theorem; new abstract and introduction that are more friendly towards mathematicians; factor d^2 of Lemma 2.1 improved to d