Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses
Abstract
We prove constant degree polynomial algorithms cannot optimize pure spherical p-spin Hamiltonians beyond the algorithmic threshold ALG(p)=2p-1p. The proof goes by transforming any hypothetical such algorithm into a Lipschitz one, for which hardness was shown previously by the author and B. Huang.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.