Quantitative Tsirelson's Theorems via Approximate Schur's Lemma and Probabilistic Stampfli's Theorems
Xiangling Xu, Marc-Olivier Renou, Igor Klep

TL;DR
This paper establishes quantitative bounds on how almost-commuting operator pairs in matrix algebras are close to truly commuting pairs, using probabilistic and deterministic methods, with applications to quantum information theory.
Contribution
It introduces new probabilistic and deterministic formulations of almost-commutation, leading to quantitative Tsirelson's theorems and generalizations of Stampfli's theorem in finite dimensions.
Findings
Operators close to commutants within O(d^2 ε) in operator norm.
Probabilistic generalizations of Stampfli's theorem for Haar-random unitaries.
Approximate quantum models are well-approximated by tensor-product models with error O(d^2 ε).
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Advanced Operator Algebra Research · Advanced Topics in Algebra
