ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (Xn,P)(\mathcal{X}_n,\mathcal{P}) be a sequence of CLVMs, giving rise to sequences of measures Pn\mathbb{P}_n and Qn\mathbb{Q}_n on ΩN\Omega^N, where N=N(n)N=N(n). Let Adv≤D(Xn,P)\mathsf{Adv}_{\leq D}(\mathcal{X}_n,\mathcal{P}) denote the low-degree advantage, and let strong detection mean distinguishing the two measures with the corresponding strong-detection guarantee. For sufficiently nice priors and channels, Informal low degree conjecture. (i) If, for some D=D(n)=ω(log⁡n)D=D(n)=\omega(\log n), Adv≤D(Xn,P)=O(1)\mathsf{Adv}_{\leq D}(\mathcal{X}_n,\mathcal{P})=O(1) as n→∞n\to\infty, then no test computable in time polynomial in nn achieves strong detection between Pn\mathbb{P}_n and Qn\mathbb{Q}_n. (ii) If, for some D=D(n)=ω(1)D=D(n)=\omega(1), Adv≤D(Xn,P)=O(1)\mathsf{Adv}_{\leq D}(\mathcal{X}_n,\mathcal{P})=O(1) as n→∞n\to\infty, then no test computable in time exp⁡(D/polylog(n))\exp(D/\mathsf{polylog}(n)) achieves strong detection between Pn\mathbb{P}_n and Qn\mathbb{Q}_n. This conjecture formalizes the heuristic that low-degree polynomials capture the power of efficient algorithms at a given runtime budget. It is explicitly described as rough and imprecise, and known pathological counterexamples require additional clauses; nevertheless, it often gives hardness predictions consistent with other evidence.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.