Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
arXiv:2601.21140 · doi:10.1103/45rz-42gr
summary
The paper presents efficient algorithms for approximating the partition function and sampling the thermal distribution of weakly-interacting quantum spin systems at any temperature.
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.
6 pages, 0 figures, published version
Topics & keywords
#quantum spin systems#partition function approximation#cluster expansion#sampling algorithms#weak interactionsFPTASapproximate countingthermal distributioncluster expansion methodapproximate sampling