Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature

01/17/2022

∙

by   Tyler Helmuth, et al.

∙

0

∙

share

We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on combining the contour representation of quantum spin systems of this type due to Borgs, Kotecký, and Ueltschi with the algorithmic framework developed by Helmuth, Perkins, and Regts, and Borgs et al.