Efficient Algorithms for Weakly-Interacting Quantum Spin Systems

2026/01/29 by Ryan L. Mann, Gabriel Waite · 1 voice
Physics and Astronomy · Computer Science · Mathematics · #quant-ph #cs.CC #cs.DS #math.CO

paper · pdf · doi:10.1103/45rz-42gr

arxiv published 2026/01/29 · arxiv updated 2026/07/14

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.

Discussions

• I'm pleased to share that my note with Gabe Waite on efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature has now been published in PRA. arxiv.org/abs/2601.21140 [bsky, 1 points, 0 comments]

Related

• Efficient Algorithms for Approximating Quantum Partition Functions
• Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
• Algorithmic Cluster Expansions for Quantum Problems
• Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
• Numerical linked-cluster algorithms. I. Spin systems on square, triangular, and kagomé lattices