Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.02264

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

Nicholas Kocurek

cs.CCquant-phSubmitted Nov 4, 2025• Announced Nov 5, 2025• 0 citations• Revised Feb 1, 2026 (v3)
v1 · Nov 4, 2025v2 · Nov 10, 2025v3 · Feb 1, 2026v4 · Oct 5, 2026
arXivHTMLPDF

Abstract

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

Comments
49 pages

Related papers

Quantitative semidefinite certificates for ground-state energies of Pauli Hamiltonians

Igor Klep, Nando Leijenhorst, Victor Magron

The $k$-local Hamiltonian problem is a central model for quantum many-body systems and Hamiltonian complexity. Semidefinite programming and noncommutative sum-of-squares hierarchies provide systematic certificates for ground-state energies, but existing finite-convergence results give no quantitative guarantee on the accuracy of the low hierarchy levels accessible in computation. We prove explicit finite-level convergence rates for these hierarchies in the Pauli setting. For $k$-local Hamiltonians whose Pauli expansion contains only even-weight terms, we show that both the NPA-type lower-bound hierarchy and the upper-bound hierarchy on the spectral minimum have error at most $C(k)ξ^{n,4}_{d+1}/n$, where $ξ^{n,4}_{d+1}$ is the smallest root of a Krawtchouk polynomial and $C(k)$ is independent of the number of qubits $n$ and the hierarchy level $d$. General $k$-local Hamiltonians reduce to this even-weight case by adding one ancilla qubit while preserving the spectrum. The proof constructs almost-reproducing kernels for the Pauli algebra and relates their spectra to Krawtchouk polynomials, giving a noncommutative analogue of recent kernel-based convergence analyses for commutative polynomial optimization. These results provide the first quantitative finite-level accuracy guarantees for noncommutative semidefinite relaxations of Pauli Hamiltonians.

quant-pharXiv:2605.29959•May 29, 2026•0 citations

Circuit complexity lower bounds for quantum spin glasses

Omar Al-Ghattas, David Gamarnik

A central question in quantum information theory is the circuit complexity of states arising from standard many-body models. We study this question for quantum $p$-spin glasses, random Hamiltonians whose interactions act on $p$-tuples of qubits through Pauli strings. Anschuetz, Gamarnik, and Kiani (arXiv:2404.07231) showed that the optimum energy is separated from the best energy achievable by product states. This leaves open whether shallow circuits can close the gap, since even depth-one circuits can generate entanglement. We show that the entanglement needed to close the product-state gap cannot be generated at shallow depth. When the average interaction degree grows with $n$, we prove that, for all sufficiently large fixed $p$, any circuit preparing an $n$-qubit state whose normalized energy is within a fixed positive constant of the optimum must have depth $Ω_p(\log n)$. In the bounded-average-degree regime, we prove a fixed-depth obstruction: for every fixed $D$, a sufficiently large degree prefactor rules out depth-$D$ preparation of near-ground states. Both results hold uniformly over circuits with an arbitrary number of ancilla qubits. Our results give an obstruction in the spirit of the No Low-Energy Trivial States problem of Freedman and Hastings (arXiv:1301.1363), but for random quantum spin glasses rather than code-based Hamiltonians such as those of Anshu, Breuckmann, and Nirkhe (arXiv:2206.13228), whose ground states admit polynomial-size preparation circuits. This setting opens a probabilistic route to NLTS-like questions: we recast state-preparation lower bounds for random quantum Hamiltonians as uniform control of Gaussian processes indexed by shallow circuits.

quant-pharXiv:2607.14384•Jul 17, 2026•0 citations

A convergent hierarchy of spectral gap certificates for qubit Hamiltonians

Sujit Rao

We give a convergent hierarchy of SDP certificates for lower bounds on the spectral gap of a local qubit Hamiltonian $H$. Our approach is based on the NPA hierarchy applied to a polynomially-sized system of constraints defining the universal enveloping algebra of the Lie algebra $\mathfrak{su}(2^{n})$ along with additional constraints which force the representation to be $\wedge^{2}(\mathbb{C}^{2^{n}})$, one which the induced Hamiltonian has ground energy $λ_{0}(H) + λ_{1}(H)$. Combined with an upper bound on the ground state energy, which can be obtained either using a hierarchy introduced by Fawzi, Fawzi, and Scalet or a noncommutative analog developed by Klep, Magron, Massé, and Volčič of a hierarchy introduced by Lasserre, we obtain lower bounds on the spectral gap of $H$ without assuming frustration-freeness or geometric locality. We prove that the resulting certificates have polynomial size at fixed degree and converge at level $n$. As illustrations of the certificates which can be obtained, we show that for a commuting 1-local Hamiltonian the hierarchy certifies the optimal bound on its spectral gap and prove that similar hierarchies require degree growing with $n$ to certify the same bound. We then extend this to prove a lower bound on the spectral gap of the transverse-field $XY$ model, which is not frustration-free, on arbitrary regular graphs without any assumption of geometric locality.

arXiv:2510.08427•Oct 9, 2025•0 citations

Sparse Random Hamiltonians Are Quantumly Easy

Chi-Fang Chen, Alexander M. Dalzell, Mario Berta +2 more

A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that has a non-negligible overlap with a low-energy state. However, it is notoriously hard to give theoretical guarantees that such a trial state can be prepared efficiently. Moreover, the heuristic proposals that are currently available, such as with adiabatic state preparation, appear insufficient in practical cases. This paper shows that, for most random sparse Hamiltonians, the maximally mixed state is a sufficiently good trial state, and phase estimation efficiently prepares states with energy arbitrarily close to the ground energy. Furthermore, any low-energy state must have non-negligible quantum circuit complexity, suggesting that low-energy states are classically nontrivial and phase estimation is the optimal method for preparing such states (up to polynomial factors). These statements hold for two models of random Hamiltonians: (i) a sum of random signed Pauli strings and (ii) a random signed d -sparse Hamiltonian. The main technical argument is based on some new results in nonasymptotic random matrix theory. In particular, a refined concentration bound for the spectral density is required to obtain complexity guarantees for these random Hamiltonians. Published by the American Physical Society 2024

arXiv:2302.03394•Physical Review X•Feb 9, 2024•7 citations

The bulk spectral gap is certifiable from above but uncomputable from below

Xiangling Xu, Matthias Schötz, Jie Wang +4 more

Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. When a fixed boundary condition is imposed, this problem is undecidable: no algorithm, even with unlimited resources, can decide for every Hamiltonian whether it is gapped. Yet the thermodynamic limit is meant to capture the intrinsic properties of very large systems, which should not depend on how their boundaries are chosen. We therefore consider the bulk spectral gap, which concerns only the intrinsic excitations of the infinite system, and ask what can and cannot be computed about it. First, we give a general algorithm producing a hierarchy of certified upper bounds on the bulk gap, arbitrarily tight at the cost of more computation. Second, we prove that the spectral gap problem remains undecidable in the bulk, already for translationally invariant nearest-neighbour chains of fixed local dimension. Hence no general algorithm produces convergent lower bounds, and no convergent upper-bounding algorithm, ours included, admits a computable convergence rate. The bulk spectral gap is thus certifiable from above but uncomputable from below; more precisely, the bulk-gaplessness promise problem is RE-complete, exactly as hard as the halting problem. The same construction shows that no general algorithm can decide whether a given product state is a ground state, and that convergent bounds on ground-state expectation values admit no computable convergence rate in general. Finally, we obtain the first nontrivial certified upper bounds on the bulk gap of the spin-1/2 kagome Heisenberg antiferromagnet.

quant-pharXiv:2606.03836•Jun 3, 2026•0 citations

Optimal Lower Bound for Ground-State Energy Estimation with a Guiding State

Rolando D. Somma, Ronald de Wolf

Suppose we can apply the unitary $U=e^{i H}$ for some Hamiltonian $H$, and are given access to a unitary that prepares a guiding state promised to have overlap at least $γ>0$ with the ground space of $H$. Our goal is to estimate the ground-state energy of $H$ within additive error $δ> 0$ and success probability at least $1-\varepsilon$, $\varepsilon>0$. How many applications of $U$ and its inverse $U^{-1}$ are necessary and sufficient? This quantity corresponds to the total Hamiltonian-simulation time needed. An upper bound $O(\log(1/\varepsilon)\log(1/γ)/γδ)$ was known, and was improved to $O(\log(1/\varepsilon)/γδ)$ very recently [JW26]. A matching lower bound was known whenever one of the three parameters $δ,γ,\varepsilon$ was held constant [MdW26]. In this paper we prove the joint lower bound $Ω(\log(1/\varepsilon)/γδ)$ with the tight $\varepsilon$-dependence provided the dimension of $H$ is at least $\log(1/\varepsilon)/γ^2$. Furthermore, we show that this same lower bound (with slightly larger dimension) holds for both the special case in which the ground state is guaranteed to be unique and $H$ has a gap of $δ$ between its first and second eigenvalue; and for ground-state preparation, where $δ$ denotes the spectral gap and $\varepsilon$ now is the approximation error. The lower bounds also apply when the Hamiltonian can be accessed via its block-encoding, and when fractional powers of $U$ are allowed, as in continuous-time Hamiltonian simulation. Lastly, improved upper bounds are known when $H$ is nonnegative and presented as a sum of squares; and our results imply the lower bound $Ω(\log(1/\varepsilon)/γ\sqrtδ)$ for this case.

quant-pharXiv:2608.24493•Aug 26, 2026•0 citations
The kkk-XOR\mathsf{XOR}XOR problem is one of the most well-studied problems in classical complexity. We study a natural quantum analogue of kkk-XOR\mathsf{XOR}XOR, the problem of computing the ground energy of a certain subclass of structured local Hamiltonians, signed sums of kkk-local Pauli operators, which we refer to as kkk-XOR\mathsf{XOR}XOR Hamiltonians. As an exhibition of the connection between this model and classical kkk-XOR\mathsf{XOR}XOR, we extend results on refuting kkk-XOR\mathsf{XOR}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 nO(ℓ)n^{O(\ell)}nO(ℓ)-time classical spectral algorithm certifying ground energy at most 12+ε\frac{1}{2} + \varepsilon21​+ε in (1) semirandom Hamiltonian kkk-XOR\mathsf{XOR}XOR instances or (2) sums of Gaussian-signed kkk-local Paulis both with O(n)⋅(nℓ)k/2−1log⁡n/ε4O(n) \cdot \left(\frac{n}{\ell}\right)^{k/2-1} \log n /\varepsilon^4O(n)⋅(ℓn​)k/2−1logn/ε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 kkk-XOR\mathsf{XOR}XOR instances as entirely classical Hamiltonians.
The kkk-local Hamiltonian problem is a central model for quantum many-body systems and Hamiltonian complexity. Semidefinite programming and noncommutative sum-of-squares hierarchies provide systematic certificates for ground-state energies, but existing finite-convergence results give no quantitative guarantee on the accuracy of the low hierarchy levels accessible in computation. We prove explicit finite-level convergence rates for these hierarchies in the Pauli setting. For kkk-local Hamiltonians whose Pauli expansion contains only even-weight terms, we show that both the NPA-type lower-bound hierarchy and the upper-bound hierarchy on the spectral minimum have error at most C(k)ξd+1n,4/nC(k)ξ^{n,4}_{d+1}/nC(k)ξd+1n,4​/n, where ξd+1n,4ξ^{n,4}_{d+1}ξd+1n,4​ is the smallest root of a Krawtchouk polynomial and C(k)C(k)C(k) is independent of the number of qubits nnn and the hierarchy level ddd. General kkk-local Hamiltonians reduce to this even-weight case by adding one ancilla qubit while preserving the spectrum. The proof constructs almost-reproducing kernels for the Pauli algebra and relates their spectra to Krawtchouk polynomials, giving a noncommutative analogue of recent kernel-based convergence analyses for commutative polynomial optimization. These results provide the first quantitative finite-level accuracy guarantees for noncommutative semidefinite relaxations of Pauli Hamiltonians.
A central question in quantum information theory is the circuit complexity of states arising from standard many-body models. We study this question for quantum ppp-spin glasses, random Hamiltonians whose interactions act on ppp-tuples of qubits through Pauli strings. Anschuetz, Gamarnik, and Kiani (arXiv:2404.07231) showed that the optimum energy is separated from the best energy achievable by product states. This leaves open whether shallow circuits can close the gap, since even depth-one circuits can generate entanglement. We show that the entanglement needed to close the product-state gap cannot be generated at shallow depth. When the average interaction degree grows with nnn, we prove that, for all sufficiently large fixed ppp, any circuit preparing an nnn-qubit state whose normalized energy is within a fixed positive constant of the optimum must have depth Ωp(log⁡n)Ω_p(\log n)Ωp​(logn). In the bounded-average-degree regime, we prove a fixed-depth obstruction: for every fixed DDD, a sufficiently large degree prefactor rules out depth-DDD preparation of near-ground states. Both results hold uniformly over circuits with an arbitrary number of ancilla qubits. Our results give an obstruction in the spirit of the No Low-Energy Trivial States problem of Freedman and Hastings (arXiv:1301.1363), but for random quantum spin glasses rather than code-based Hamiltonians such as those of Anshu, Breuckmann, and Nirkhe (arXiv:2206.13228), whose ground states admit polynomial-size preparation circuits. This setting opens a probabilistic route to NLTS-like questions: we recast state-preparation lower bounds for random quantum Hamiltonians as uniform control of Gaussian processes indexed by shallow circuits.
We give a convergent hierarchy of SDP certificates for lower bounds on the spectral gap of a local qubit Hamiltonian HHH. Our approach is based on the NPA hierarchy applied to a polynomially-sized system of constraints defining the universal enveloping algebra of the Lie algebra su(2n)\mathfrak{su}(2^{n})su(2n) along with additional constraints which force the representation to be ∧2(C2n)\wedge^{2}(\mathbb{C}^{2^{n}})∧2(C2n), one which the induced Hamiltonian has ground energy λ0(H)+λ1(H)λ_{0}(H) + λ_{1}(H)λ0​(H)+λ1​(H). Combined with an upper bound on the ground state energy, which can be obtained either using a hierarchy introduced by Fawzi, Fawzi, and Scalet or a noncommutative analog developed by Klep, Magron, Massé, and Volčič of a hierarchy introduced by Lasserre, we obtain lower bounds on the spectral gap of HHH without assuming frustration-freeness or geometric locality. We prove that the resulting certificates have polynomial size at fixed degree and converge at level nnn. As illustrations of the certificates which can be obtained, we show that for a commuting 1-local Hamiltonian the hierarchy certifies the optimal bound on its spectral gap and prove that similar hierarchies require degree growing with nnn to certify the same bound. We then extend this to prove a lower bound on the spectral gap of the transverse-field XYXYXY model, which is not frustration-free, on arbitrary regular graphs without any assumption of geometric locality.
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that has a non-negligible overlap with a low-energy state. However, it is notoriously hard to give theoretical guarantees that such a trial state can be prepared efficiently. Moreover, the heuristic proposals that are currently available, such as with adiabatic state preparation, appear insufficient in practical cases. This paper shows that, for most random sparse Hamiltonians, the maximally mixed state is a sufficiently good trial state, and phase estimation efficiently prepares states with energy arbitrarily close to the ground energy. Furthermore, any low-energy state must have non-negligible quantum circuit complexity, suggesting that low-energy states are classically nontrivial and phase estimation is the optimal method for preparing such states (up to polynomial factors). These statements hold for two models of random Hamiltonians: (i) a sum of random signed Pauli strings and (ii) a random signed d -sparse Hamiltonian. The main technical argument is based on some new results in nonasymptotic random matrix theory. In particular, a refined concentration bound for the spectral density is required to obtain complexity guarantees for these random Hamiltonians. Published by the American Physical Society 2024
Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. When a fixed boundary condition is imposed, this problem is undecidable: no algorithm, even with unlimited resources, can decide for every Hamiltonian whether it is gapped. Yet the thermodynamic limit is meant to capture the intrinsic properties of very large systems, which should not depend on how their boundaries are chosen. We therefore consider the bulk spectral gap, which concerns only the intrinsic excitations of the infinite system, and ask what can and cannot be computed about it. First, we give a general algorithm producing a hierarchy of certified upper bounds on the bulk gap, arbitrarily tight at the cost of more computation. Second, we prove that the spectral gap problem remains undecidable in the bulk, already for translationally invariant nearest-neighbour chains of fixed local dimension. Hence no general algorithm produces convergent lower bounds, and no convergent upper-bounding algorithm, ours included, admits a computable convergence rate. The bulk spectral gap is thus certifiable from above but uncomputable from below; more precisely, the bulk-gaplessness promise problem is RE-complete, exactly as hard as the halting problem. The same construction shows that no general algorithm can decide whether a given product state is a ground state, and that convergent bounds on ground-state expectation values admit no computable convergence rate in general. Finally, we obtain the first nontrivial certified upper bounds on the bulk gap of the spin-1/2 kagome Heisenberg antiferromagnet.
Suppose we can apply the unitary U=eiHU=e^{i H}U=eiH for some Hamiltonian HHH, and are given access to a unitary that prepares a guiding state promised to have overlap at least γ>0γ>0γ>0 with the ground space of HHH. Our goal is to estimate the ground-state energy of HHH within additive error δ>0δ> 0δ>0 and success probability at least 1−ε1-\varepsilon1−ε, ε>0\varepsilon>0ε>0. How many applications of UUU and its inverse U−1U^{-1}U−1 are necessary and sufficient? This quantity corresponds to the total Hamiltonian-simulation time needed. An upper bound O(log⁡(1/ε)log⁡(1/γ)/γδ)O(\log(1/\varepsilon)\log(1/γ)/γδ)O(log(1/ε)log(1/γ)/γδ) was known, and was improved to O(log⁡(1/ε)/γδ)O(\log(1/\varepsilon)/γδ)O(log(1/ε)/γδ) very recently [JW26]. A matching lower bound was known whenever one of the three parameters δ,γ,εδ,γ,\varepsilonδ,γ,ε was held constant [MdW26]. In this paper we prove the joint lower bound Ω(log⁡(1/ε)/γδ)Ω(\log(1/\varepsilon)/γδ)Ω(log(1/ε)/γδ) with the tight ε\varepsilonε-dependence provided the dimension of HHH is at least log⁡(1/ε)/γ2\log(1/\varepsilon)/γ^2log(1/ε)/γ2. Furthermore, we show that this same lower bound (with slightly larger dimension) holds for both the special case in which the ground state is guaranteed to be unique and HHH has a gap of δδδ between its first and second eigenvalue; and for ground-state preparation, where δδδ denotes the spectral gap and ε\varepsilonε now is the approximation error. The lower bounds also apply when the Hamiltonian can be accessed via its block-encoding, and when fractional powers of UUU are allowed, as in continuous-time Hamiltonian simulation. Lastly, improved upper bounds are known when HHH is nonnegative and presented as a sum of squares; and our results imply the lower bound Ω(log⁡(1/ε)/γδ)Ω(\log(1/\varepsilon)/γ\sqrtδ)Ω(log(1/ε)/γδ​) for this case.