Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature

2022/01/17 by Tyler Helmuth, Ryan L. Mann · 1 voice
Physics and Astronomy · Computer Science · Mathematics · #quant-ph #cs.CC #cs.DS #math.CO

paper · pdf · doi:10.22331/q-2023-10-25-1155

arxiv published 2022/01/17 · arxiv updated 2023/10/13

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.

Discussions

• New paper with Tyler Helmuth: Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature https://arxiv.org/abs/2201.06533 [bsky, 0 points, 0 comments]

Related

• Efficient Algorithms for Approximating Quantum Partition Functions
• Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
• Approximating Partition Functions of Two-State Spin Systems
• An exact solution of the partition function for mean-field quantum spin systems without the static approximation
• High-Temperature Partition Functions and Classical Simulatability of Long-Range Quantum Systems