The SDP value of random 2CSPs
Abstract
We consider a very wide class of models for sparse random Boolean 2CSPs; equivalently, degree-2 optimization problems over~\ 1\n. For each model M, we identify the "high-probability value"~s*M of the natural SDP relaxation (equivalently, the quantum value). That is, for all > 0 we show that the SDP optimum of a random n-variable instance is (when normalized by~n) in the range (s*M-, s*M+) with high probability. Our class of models includes non-regular CSPs, and ones where the SDP relaxation value is strictly smaller than the spectral relaxation value.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.