Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantitative Tsirelson's Theorems via Approximate Schur's Lemma and Probabilistic Stampfli's Theorems

Published 28 May 2025 in quant-ph, math-ph, and math.MP | (2505.22309v1)

Abstract: Tsirelson showed that, in finite dimensions, quantum correlations generated by commuting observables--measurements associated with distinct parties whose operators mutually commute--are equivalent to those obtainable from measurements on separate tensor product factors. We generalize this foundational result to the setting of $\epsilon$-almost commuting observables, establishing two distinct quantitative approximate Tsirelson's theorems. Both theorems show that if a $d$-dimensional bipartite quantum strategy's observables $\epsilon$-almost commute, then they are within $O(\mathrm{poly}(d) \epsilon)$ (in operator norm) of observables from a genuine tensor product strategy. This provides a quantitative counterpart to the asymptotic result of [N. Ozawa, J. Math. Phys. 54, 032202 (2013)] and justifies the tensor product model as an effective model even when subsystem independence is only approximately satisfied. Our theorems arise from two different but complementary formulations of almost commutation: (i) The first approach utilizes deterministic operator norm bounds relative to specific matrix generators (such as clock and shift matrices), leading to an approximate Schur's Lemma from which the first theorem directly follows. (ii) The second approach employs probabilistic bounds, requiring small commutators only on average against Haar-random single-qubit unitaries. This method yields two novel probabilistic Stampfli's theorems, quantifying distance to scalars based on probabilistic commutation, a result which may be of independent interest. These theorems set the basis for the second approximate Tsirelson's theorem.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.