超压缩性、平方和证明及其应用
Hypercontractivity, Sum-of-Squares Proofs, and their Applications
摘要:
我们研究了线性算子(定义为)的2->q范数的近似的计算复杂性||A||_{2->q} = sup_v| |Av||_q/||v||_2),以及这个问题与量子信息论和Khot唯一博弈猜想(UGC)研究中出现的问题之间的联系。我们显示以下内容:1.对于任意偶数q>=4,图$G$是“小集扩张器”当且仅当图G的邻接矩阵的顶特征向量的跨度上的投影有界2->q范数.作为一个推论,对2->q范数的一个很好的近似将反驳小集合扩张猜想--UGC的一个密切变体。我们还证明了这样一个好的近似可以在exp(n^(2/q))时间内得到,从而得到了已知的小集合展开的次指数算法的一个不同的证明. 2.“平方和”半定规划层次的常数轮证明了布尔立方体上的投影到低次多项式的2->4范数的上界,以及证明了先前工作考虑的基于“噪声立方体”和“短码”的唯一博弈实例的不可满足性。这改进了以前的exp(poly log n)轮的上限(对于“短代码”),并且将“平方和”/“Lasserre”层次结构与已知需要omega(1)轮的较弱层次结构分开。3.我们展示了计算2->4范数和计算张量的单射张量范数之间的简化,这是一个与量子信息论有关的问题。三个推论是:(i)2->4范数在维度上近似于精确的逆多项式是NP困难的,(ii)2->4范数不具有良好的近似(在上述意义上),除非3-SAT可以在时间exp(sqrt(n)polylog(n))中求解,以及(iii)用于量子可分性问题的已知算法意味着2->4范数的非平凡加法近似。
英文摘要:
We study the computational complexity of approximating the 2->q norm of linear operators (defined as ||A||_{2->q} = sup_v ||Av||_q/||v||_2), as well as connections between this question and issues arising in quantum information theory and the study of Khot's Unique Games Conjecture (UGC). We show the following: 1. For any constant even integer q>=4, a graph $G$ is a "small-set expander" if and only if the projector into the span of the top eigenvectors of G's adjacency matrix has bounded 2->q norm. As a corollary, a good approximation to the 2->q norm will refute the Small-Set Expansion Conjecture--a close variant of the UGC. We also show that such a good approximation can be obtained in exp(n^(2/q)) time, thus obtaining a different proof of the known subexponential algorithm for Small Set Expansion. 2. Constant rounds of the "Sum of Squares" semidefinite programing hierarchy certify an upper bound on the 2->4 norm of the projector to low-degree polynomials over the Boolean cube, as well certify the unsatisfiability of the "noisy cube" and "short code" based instances of Unique Games considered by prior works. This improves on the previous upper bound of exp(poly log n) rounds (for the "short code"), as well as separates the "Sum of Squares"/"Lasserre" hierarchy from weaker hierarchies that were known to require omega(1) rounds. 3. We show reductions between computing the 2->4 norm and computing the injective tensor norm of a tensor, a problem with connections to quantum information theory. Three corollaries are: (i) the 2->4 norm is NP-hard to approximate to precision inverse-polynomial in the dimension, (ii) the 2->4 norm does not have a good approximation (in the sense above) unless 3-SAT can be solved in time exp(sqrt(n) polylog(n)), and (iii) known algorithms for the quantum separability problem imply a non-trivial additive approximation for the 2->4 norm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。