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

TL;DR
This paper introduces spectral certificates and Sum-of-Squares lower bounds for semirandom Hamiltonians, extending classical XOR refutation techniques to quantum Hamiltonians and analyzing their computational complexity.
Contribution
It develops a quantum variant of the Kikuchi matrix for Hamiltonian refutation and establishes a classical spectral algorithm with a specific tradeoff for certifying ground energy.
Findings
Spectral algorithm certifies ground energy at most 1/2 + ε in semirandom Hamiltonian instances.
The algorithm's complexity depends on the number of local terms and a parameter ℓ, revealing a refutation threshold.
Non-commutative Sum-of-Squares bounds suggest the tradeoff is tight in the semirandom regime.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs · Polynomial and algebraic computation
