← Back to papers
Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
Ryan L. Mann, Gabriel Waite·January 29, 2026
Quantum PhysicsComplexityData Structuresmath.CO
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling scheme for the thermal distribution over a classical spin space. Our approach is based on the cluster expansion method and a standard reduction from approximate sampling to approximate counting.