Projects per year
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.
Original language | English |
---|---|
Article number | 022201 |
Number of pages | 8 |
Journal | Journal of Mathematical Physics |
Volume | 62 |
Issue number | 2 |
Early online date | 1 Feb 2021 |
DOIs | |
Publication status | Published - 1 Feb 2021 |
Fingerprint
Dive into the research topics of 'Efficient Algorithms for Approximating Quantum Partition Functions'. Together they form a unique fingerprint.Projects
- 1 Finished