Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
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 o...
Main Authors: | Tyler Helmuth, Ryan L. Mann |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2023-10-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2023-10-25-1155/pdf/ |
Similar Items
-
Approximation algorithms and inapproximability of partition functions of spin systems
by: Yang, K
Published: (2019) -
Approximating the Log-Partition Function
by: Cosson, Romain
Published: (2022) -
Quantum algorithms for approximate function loading
by: Gabriel Marin-Sanchez, et al.
Published: (2023-08-01) -
Approximating the partition function of the ferromagnetic potts model
by: Goldberg, L, et al.
Published: (2012) -
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions
by: Srinivasan Arunachalam, et al.
Published: (2022-09-01)