Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case

Abstract

We prove a hypercontractive inequality for matrix-valued functions defined over large alphabets. In order to do so, we prove a generalization of the powerful $2$-uniform convexity inequality for trace norms of Ball, Carlen, Lieb (Inventiones Mathematicae'94). Using our hypercontractive~inequality, we present upper and lower bounds for the communication complexity of the Hidden Hypermatching problem defined over large alphabets. We then consider streaming algorithms for approximating the value of Unique Games on a hypergraph with $t$-size hyperedges. By using our communication lower bound, we show that every streaming algorithm in the adversarial model achieving an $(r-\epsilon )$-approximation of this value requires $\Omega (n^{1-2/t})$ quantum space, where $r$ is the alphabet size. We next present a lower bound for locally decodable codes (LDC) ${\mathbb{Z}}_r^n\to {\mathbb{Z}}_r^N$ over large alphabets with recoverability probability at least $1/r+\epsilon$. Using hypercontractivity, we give an exponential lower bound $N=2^{\Omega ({\epsilon }^{4}n/r^4)}$ for $2$-query (possibly non-linear) LDCs over ${\mathbb{Z}}_r$ and using the non-commutative Khintchine inequality we prove an improved lower bound of $N=2^{\Omega ({\epsilon }^{2}n/r^2)}$.

38 pages. v2: several changes; the overall text was improved, references were added, LDC lower bound was improved, the PIR bound in Result 7 was corrected to due an error; v3: close to the published version

References in corpus (9)

• A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs
• Time-uniform Chernoff bounds via nonnegative supermartingales
• Between Sobolev and Poincaré
• Some applications of hypercontractive inequalities in quantum information theory
• Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
• Streaming Hardness of Unique Games
• Matrix Rearrangement Inequalities Revisited
• Exponential quantum communication reductions from generalizations of the Boolean Hidden Matching problem
• PDQP/qpoly = ALL