Efficient Algorithms for Approximating Quantum Partition Functions
Data Structures and Algorithms
2021-02-02 v2 Computational Complexity
Combinatorics
Quantum Physics
Abstract
We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Neto\v{c}n\'y and Redig and the cluster expansion approach to designing algorithms due to Helmuth, Perkins, and Regts. Similar results have previously been obtained by related methods, and our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs.
Cite
@article{arxiv.2004.11568,
title = {Efficient Algorithms for Approximating Quantum Partition Functions},
author = {Ryan L. Mann and Tyler Helmuth},
journal= {arXiv preprint arXiv:2004.11568},
year = {2021}
}
Comments
7 pages, 0 figures, published version