ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let J=(Jij:1⩽i<j⩽n)∈Rn(n−1)/2{\bf J}=(J_{ij}:1\leqslant i<j\leqslant n)\in\mathbb{R}^{n(n-1)/2} have independent and identically distributed entries Jij=dN(0,1)J_{ij}\stackrel{d}{=}\mathcal{N}(0,1). Let Z^(J)\widehat{Z}({\bf J}) denote the target approximation to the partition function, and let an oracle O(⋅)\mathcal{O}(\cdot) operate in a real-valued computational model, such as a Blum–Shub–Smale machine.

Average-case hardness conjecture. (a) If

P(Z^(J)=O(J))⩾12+1poly(n),\mathbb{P}\left(\widehat{Z}({\bf J})=\mathcal{O}({\bf J})\right)\geqslant \frac12+\frac{1}{{\rm poly}(n)},

then P=#PP=\#P. (b) More challengingly, if

P(Z^(J)=O(J))⩾1poly(n),\mathbb{P}\left(\widehat{Z}({\bf J})=\mathcal{O}({\bf J})\right)\geqslant \frac{1}{{\rm poly}(n)},

then P=#PP=\#P.

These are proposed as open average-case hardness statements for computing the Sherrington–Kirkpatrick partition function. The second variant asks for the same consequence under only inverse-polynomial success probability, and both statements concern algorithms operating on real-valued inputs.

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.