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čný 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.

中文翻译：

---

近似量子分区函数的高效算法

针对高温下量子自旋模型的划分函数，我们建立了多项式时间近似算法。我们的算法基于Netočný和Redig的量子聚类扩展，以及基于Helmuth，Perkins和Regts的聚类扩展方法来设计算法。以前已经通过相关方法获得了相似的结果，并且我们的主要贡献是对有界图上成对相互作用的情况进行了简单且更加清晰的分析。