A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
Mathematics of Operations Research
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Global Optimization with Polynomials and the Problem of Moments
SIAM Journal on Optimization
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Which Problems Have Strongly Exponential Complexity?
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming
Mathematics of Operations Research
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Noise stability of functions with low in.uences invariance and optimality
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Quantum t-designs: t-wise Independence in the Quantum World
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
The UGC hardness threshold of the ℓp Grothendieck problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of the consistency and n-representability problems for quantum states
The complexity of the consistency and n-representability problems for quantum states
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
SDP Integrality Gaps with Local ell_1-Embeddability
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Approximations for the isoperimetric and spectral profile of graphs and related parameters
Proceedings of the forty-second ACM symposium on Theory of computing
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
Approximate Lasserre integrality gap for unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Subexponential Algorithms for Unique Games and Related Problems
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
A quasipolynomial-time algorithm for the quantum separability problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
Journal of the ACM (JACM)
Majority is stablest: discrete and SoS
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Quantum de finetti theorems under local measurements with applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
We study the computational complexity of approximating the 2-to-q norm of linear operators (defined as |A|2-q = maxv≠ 0|Av|q/|v|2) for q 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: 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(n2/q) time, thus obtaining a different proof of the known subexponential algorithm for Small-Set-Expansion. 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(logO(1) n) rounds (for the "short code"), as well as separates the "Sum of Squares"/"Lasserre" hierarchy from weaker hierarchies that were known to require ω(1) rounds. 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(√n poly log(n)), and (iii) known algorithms for the quantum separability problem imply a non-trivial additive approximation for the 2-4 norm.