Tsirelson's bound

Template:Short description A Tsirelson bound is an upper limit to quantum mechanical correlations between distant events. Given that quantum mechanics violates Bell inequalities (i.e., it cannot be described by a local hidden-variable theory), a natural question to ask is how large can the violation be. The answer is precisely the Tsirelson bound for the particular Bell inequality in question. In general, this bound is lower than the bound that would be obtained if more general theories, only constrained by "no-signalling" (i.e., that they do not permit communication faster than light), were considered, and much research has been dedicated to the question of why this is the case.

The Tsirelson bounds are named after Boris S. Tsirelson (or Cirel'son, in a different transliteration), the author of the article<ref>Template:Cite journal</ref> in which the first one was derived.

Bound for the CHSH inequalityEdit

The first Tsirelson bound was derived as an upper bound on the correlations measured in the CHSH inequality. It states that if we have four (Hermitian) dichotomic observables <math>A_0</math>, <math>A_1</math>, <math>B_0</math>, <math>B_1</math> (i.e., two observables for Alice and two for Bob) with outcomes <math>+1, -1</math> such that <math>[A_i, B_j] = 0</math> for all <math>i, j</math>, then

<math> \langle A_0 B_0 \rangle + \langle A_0 B_1 \rangle + \langle A_1 B_0 \rangle - \langle A_1 B_1 \rangle \le 2\sqrt{2}.</math>

For comparison, in the classical case (or local realistic case) the upper bound is 2, whereas if any arbitrary assignment of <math>+1, -1</math> is allowed, it is 4. The Tsirelson bound is attained already if Alice and Bob each make measurements on a qubit, the simplest non-trivial quantum system.

Several proofs of this bound exist, but perhaps the most enlightening one is based on the Khalfin–Tsirelson–Landau identity. If we define an observable

<math> \mathcal{B} = A_0 B_0 + A_0 B_1 + A_1 B_0 - A_1 B_1, </math>

and <math>A_i^2 = B_j^2 = \mathbb{I}</math>, i.e., if the observables' outcomes are <math>+1, -1</math>, then

<math> \mathcal{B}^2 = 4 \mathbb{I} - [A_0, A_1] [B_0, B_1]. </math>

If <math>[A_0, A_1] = 0</math> or <math>[B_0, B_1] = 0</math>, which can be regarded as the classical case, it already follows that <math>\langle \mathcal{B} \rangle \le 2</math>. In the quantum case, we need only notice that <math>\big\|[A_0, A_1]\big\| \le 2 \|A_0\| \|A_1\| \le 2</math>, and the Tsirelson bound <math>\langle \mathcal{B} \rangle \le 2\sqrt{2}</math> follows.

Other Bell inequalitiesEdit

Tsirelson also showed that for any bipartite full-correlation Bell inequality with m inputs for Alice and n inputs for Bob, the ratio between the Tsirelson bound and the local bound is at most <math>K_G^{\mathbb R}(\lfloor r\rfloor),</math> where <math>r = \min \left\{m,n,-\frac12 + \sqrt{\frac14 + 2(m+n)}\right\},</math> and <math>K_G^{\mathbb R}(d)</math> is the Grothendieck constant of order d.<ref>Template:Cite journal</ref> Note that since <math>K_G^{\mathbb R}(2) = \sqrt2</math>, this bound implies the above result about the CHSH inequality.

In general, obtaining a Tsirelson bound for a given Bell inequality is a hard problem that has to be solved on a case-by-case basis. It is not even known to be decidable. The best known computational method for upperbounding it is a convergent hierarchy of semidefinite programs, the NPA hierarchy, that in general does not halt.<ref>Template:Cite journal</ref><ref name="npa"/> The exact values are known for a few more Bell inequalities:

For the Braunstein–Caves inequalities we have that

<math> \langle \text{BC}_n \rangle \le n \cos\left(\frac{\pi}{n}\right). </math>

For the WWŻB inequalities the Tsirelson bound is

<math> \langle \text{WWZB}_n \rangle \le 2^{(n-1)/2}. </math>

For the <math>I_{3322}</math> inequality<ref>Template:Cite journal</ref> the Tsirelson bound is not known exactly, but concrete realisations give a lower bound of Template:Val,<ref>Template:Cite journal</ref> and the NPA hierarchy gives an upper bound of Template:Val.<ref>Template:Cite arXiv</ref> It is conjectured that only infinite-dimensional quantum states can reach the Tsirelson bound.

Derivation from physical principlesEdit

Significant research has been dedicated to finding a physical principle that explains why quantum correlations go only up to the Tsirelson bound and nothing more. Three such principles have been found: no-advantage for non-local computation,<ref>Template:Cite journal</ref> information causality<ref>Template:Cite journal</ref> and macroscopic locality.<ref>Template:Cite journal</ref> That is to say, if one could achieve a CHSH correlation exceeding Tsirelson's bound, all such principles would be violated. Tsirelson's bound also follows if the Bell experiment admits a strongly positive quantal measure.<ref>Template:Cite journal</ref>

Tsirelson's problemEdit

There are two different ways of defining the Tsirelson bound of a Bell expression. One by demanding that the measurements are in a tensor product structure, and another by demanding only that they commute. Tsirelson's problem is the question of whether these two definitions are equivalent. More formally, let

be a Bell expression, where <math>p(ab|xy)</math> is the probability of obtaining outcomes <math>a, b</math> with the settings <math>x, y</math>. The tensor product Tsirelson bound is then the supremum of the value attained in this Bell expression by making measurements <math>A^a_x : \mathcal{H}_A \to \mathcal{H}_A</math> and <math>B^b_y : \mathcal{H}_B \to \mathcal{H}_B</math> on a quantum state <math>|\psi\rangle \in \mathcal{H}_A \otimes \mathcal{H}_B</math>:

<math> T_t = \sup_{|\psi\rangle, A^a_x, B^b_y} \sum_{abxy} \mu_{abxy} \langle \psi | A^a_x \otimes B^b_y |\psi\rangle.</math>

The commuting Tsirelson bound is the supremum of the value attained in this Bell expression by making measurements <math>A^a_x : \mathcal{H} \to \mathcal{H}</math> and <math>B^b_y : \mathcal{H} \to \mathcal{H}</math> such that <math>\forall a, b, x, y; [A^a_x, B^b_y] = 0</math> on a quantum state <math>|\psi\rangle \in \mathcal{H}</math>:

<math> T_c = \sup_{|\psi\rangle, A^a_x, B^b_y} \sum_{abxy} \mu_{abxy} \langle \psi | A^a_x B^b_y |\psi\rangle.</math>

Since tensor product algebras in particular commute, <math>T_t \le T_c</math>. In finite dimensions commuting algebras are always isomorphic to (direct sums of) tensor product algebras,<ref>Template:Cite arXiv</ref> so only for infinite dimensions it is possible that <math>T_t \neq T_c</math>. Tsirelson's problem is the question of whether for all Bell expressions <math>T_t = T_c</math>.

This question was first considered by Boris Tsirelson in 1993, where he asserted without proof that <math>T_t = T_c</math>.<ref>Template:Cite journal</ref> Upon being asked for a proof by Antonio Acín in 2006, he realized that the one he had in mind didn't work, and issued the question as an open problem.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> Together with Miguel Navascués and Stefano Pironio, Antonio Acín had developed an hierarchy of semidefinite programs, the NPA hierarchy, that converged to the commuting Tsirelson bound <math>T_c</math> from above,<ref name="npa">Template:Cite journal</ref> and wanted to know whether it also converged to the tensor product Tsirelson bound <math>T_t</math>, the most physically relevant one.

Since one can produce a converging sequencing of approximations to <math>T_t</math> from below by considering finite-dimensional states and observables, if <math>T_t = T_c</math>, then this procedure can be combined with the NPA hierarchy to produce a halting algorithm to compute the Tsirelson bound, making it a computable number (note that in isolation neither procedure halts in general). Conversely, if <math>T_t</math> is not computable, then <math>T_t \neq T_c</math>. In January 2020, Ji, Natarajan, Vidick, Wright, and Yuen claimed to have proven that <math>T_t</math> is not computable, thus solving Tsirelson's problem in the negative.<ref>Template:Cite arXiv</ref> Tsirelson's problem has been shown to be equivalent to Connes' embedding problem,<ref>Template:Cite journal</ref> so the same proof also implies that the Connes embedding problem is false.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

ReferencesEdit