Efficient Algorithms for Weakly-Interacting Quantum Spin Systems

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

References in corpus (8)

• Independent sets in the hypercube revisited
• Efficient Algorithms for Approximating Quantum Partition Functions
• Rapid quantum ground state preparation via dissipative dynamics
• Algorithmic Cluster Expansions for Quantum Problems
• Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
• Polynomial Time Quantum Gibbs Sampling for Fermi-Hubbard Model at any Temperature
• Polynomial-time algorithm for simulation of weakly interacting quantum spin systems
• Algorithms for the ferromagnetic Potts model on expanders