Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
Quantum Physics
2023-10-25 v2 Computational Complexity
Data Structures and Algorithms
Combinatorics
Abstract
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\'y, and Ueltschi with the algorithmic framework developed by Helmuth, Perkins, and Regts, and Borgs et al.
Cite
@article{arxiv.2201.06533,
title = {Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature},
author = {Tyler Helmuth and Ryan L. Mann},
journal= {arXiv preprint arXiv:2201.06533},
year = {2023}
}
Comments
12 pages, 0 figures, published version