Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
Quantum Physics
2026-01-30 v1 Computational Complexity
Data Structures and Algorithms
Combinatorics
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.
Cite
@article{arxiv.2601.21140,
title = {Efficient Algorithms for Weakly-Interacting Quantum Spin Systems},
author = {Ryan L. Mann and Gabriel Waite},
journal= {arXiv preprint arXiv:2601.21140},
year = {2026}
}
Comments
6 pages, 0 figures