Papers
Topics
Authors
Recent
Search
2000 character limit reached

Spectral Certificates and Sum-of-Squares Lower Bounds for Semirandom Hamiltonians

Published 4 Nov 2025 in cs.CC | (2511.02264v1)

Abstract: The kk-XOR\mathsf{XOR} problem is one of the most well-studied problems in classical complexity. We study a natural quantum analogue of kk-XOR\mathsf{XOR}, the problem of computing the ground energy of a certain subclass of structured local Hamiltonians, signed sums of kk-local Pauli operators, which we refer to as kk-XOR\mathsf{XOR} Hamiltonians. As an exhibition of the connection between this model and classical kk-XOR\mathsf{XOR}, we extend results on refuting kk-XOR\mathsf{XOR} 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 n<sup>O()n<sup>{O(\ell)}-time classical spectral algorithm certifying ground energy at most 12+ε\frac{1}{2} + \varepsilon in (1) semirandom Hamiltonian kk-XOR\mathsf{XOR} instances or (2) sums of Gaussian-signed kk-local Paulis both with O(n)(n)<sup>k/21</sup>logn/ε<sup>4O(n) \cdot \left(\frac{n}{\ell}\right)<sup>{k/2-1}</sup> \log n /\varepsilon<sup>4 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 kk-XOR\mathsf{XOR} instances as entirely classical Hamiltonians.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.