quantum computing

Efficient quantum algorithm for Heisenberg spin systems

arXiv:2607.14401

summary

The paper proves a lower bound on the spectral gap of a broad class of Heisenberg spin Hamiltonians and uses this to design an efficient quantum adiabatic algorithm for estimating their ground‑state energy.

Abstract

We consider a broad family of Heisenberg-type quantum spin systems that were studied by Suzuki and Fisher in 1971. This family includes, for example, the Heisenberg antiferromagnet on any bipartite graph. The ground and Gibbs states of these models are Lee-Yang tensors with radius 1: they are associated with multilinear polynomials that possess an extraordinary zero-freeness property inside the unit polydisk in the complex plane. For each Hamiltonian in this family we show that the spectral gap between the first-excited and ground-state energies is lower bounded by , where is the magnetic field along the direction. Using this result we obtain an efficient quantum adiabatic algorithm for the ground energy of any model in this family. The proof is based on a new inequality that relates the spectral gap of a positive semidefinite operator to its Lee-Yang radius -- a quantitative strengthening of prior work of the authors that may find applications elsewhere.

10 pages

Topics & keywords

#quantum algorithms#heisenberg model#spin systems#spectral gap#lee-yang zeros#adiabatic computationHeisenberg antiferromagnetbipartite graphLee-Yang tensorsspectral gap lower boundquantum adiabatic algorithm