Spectral Certificates and Sum-of-Squares Lower Bounds for Semirandom Hamiltonians
Abstract: The - problem is one of the most well-studied problems in classical complexity. We study a natural quantum analogue of -, the problem of computing the ground energy of a certain subclass of structured local Hamiltonians, signed sums of -local Pauli operators, which we refer to as - Hamiltonians. As an exhibition of the connection between this model and classical -, we extend results on refuting - instances to the Hamiltonian setting by crafting a quantum variant of the Kikuchi matrix for CSP refutation, instead capturing ground energy optimization. As our main result, we show an -time classical spectral algorithm certifying ground energy at most in (1) semirandom Hamiltonian - instances or (2) sums of Gaussian-signed -local Paulis both with local terms, a tradeoff known as the refutation threshold. Additionally, we give evidence this tradeoff is tight in the semirandom regime via non-commutative Sum-of-Squares lower bounds embedding classical - instances as entirely classical Hamiltonians.
Paper Prompts
Sign up for free to create and run prompts on this paper.