Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
89 tokens/sec
Gemini 2.5 Pro Premium
41 tokens/sec
GPT-5 Medium
24 tokens/sec
GPT-5 High Premium
28 tokens/sec
GPT-4o
96 tokens/sec
DeepSeek R1 via Azure Premium
88 tokens/sec
GPT OSS 120B via Groq Premium
478 tokens/sec
Kimi K2 via Groq Premium
221 tokens/sec
2000 character limit reached

Tripartite Bell inequality, random matrices and trilinear forms (1203.2509v1)

Published 12 Mar 2012 in math.OA, cs.IT, math-ph, math.FA, math.IT, math.MP, and math.PR

Abstract: In this seminar report, we present in detail the proof of a recent result due to J. Bri\"et and T. Vidick, improving an estimate in a 2008 paper by D. P\'erez-Garc\'{\i}a, M. Wolf, C. Palazuelos, I. Villanueva, and M. Junge, estimating the growth of the deviation in the tripartite Bell inequality. The proof requires a delicate estimate of the norms of certain trilinear (or $d$-linear) forms on Hilbert space with coefficients in the second Gaussian Wiener chaos. Let $En_{\vee}$ (resp. $En_{\min}$) denote $ \ell_1n \otimes \ell_1n\otimes \ell_1n$ equipped with the injective (resp. minimal) tensor norm. Here $ \ell_1n$ is equipped with its maximal operator space structure. The Bri\"et-Vidick method yields that the identity map $I_n$ satisfies (for some $c>0$) $|I_n:\ En_{\vee}\to En_{\min}|\ge c n{1/4} (\log n){-3/2}.$ Let $Sn_2$ denote the (Hilbert) space of $n\times n$-matrices equipped with the Hilbert-Schmidt norm. While a lower bound closer to $n{1/2} $ is still open, their method produces an interesting, asymptotically almost sharp, related estimate for the map $J_n:\ Sn_2\stackrel{\vee}{\otimes} Sn_2\stackrel{\vee}{\otimes}Sn_2 \to \ell_2{n3} \stackrel{\vee}{\otimes} \ell_2{n3} $ taking $e_{i,j}\otimes e_{k,l}\otimes e_{m,n}$ to $e_{[i,k,m],[j,l,n]}$.

Citations (4)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)