Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature

Helmuth, Tyler; Mann, Ryan L.

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ý, and Ueltschi with the algorithmic framework developed by Helmuth, Perkins, and Regts, and Borgs et al.

Citation

Helmuth, T., & Mann, R. L. (2023). Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature. Quantum, 7, 1155. https://doi.org/10.22331/q-2023-10-25-1155

• Journal Article Type: Article
• Acceptance Date: Sep 25, 2023
• Online Publication Date: Oct 25, 2023
• Publication Date: 2023
• Deposit Date: Feb 20, 2024
• Publicly Available Date: Feb 20, 2024
• Journal: Quantum
• Electronic ISSN: 2521-327X
• Publisher: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
• Peer Reviewed: Peer Reviewed
• Volume: 7
• Pages: 1155
• DOI: https://doi.org/10.22331/q-2023-10-25-1155
• Public URL: https://durham-repository.worktribe.com/output/2270953