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...

Full description

Bibliographic Details
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/
_version_ 1797649922530476032
author Tyler Helmuth
Ryan L. Mann
author_facet Tyler Helmuth
Ryan L. Mann
author_sort Tyler Helmuth
collection DOAJ
description 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.
first_indexed 2024-03-11T15:54:06Z
format Article
id doaj.art-8951f539e32d47f8baf1b24bdb318366
institution Directory Open Access Journal
issn 2521-327X
language English
last_indexed 2024-03-11T15:54:06Z
publishDate 2023-10-01
publisher Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
record_format Article
series Quantum
spelling doaj.art-8951f539e32d47f8baf1b24bdb3183662023-10-25T13:16:49ZengVerein zur Förderung des Open Access Publizierens in den QuantenwissenschaftenQuantum2521-327X2023-10-017115510.22331/q-2023-10-25-115510.22331/q-2023-10-25-1155Efficient Algorithms for Approximating Quantum Partition Functions at Low TemperatureTyler HelmuthRyan L. MannWe 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.https://quantum-journal.org/papers/q-2023-10-25-1155/pdf/
spellingShingle Tyler Helmuth
Ryan L. Mann
Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
Quantum
title Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
title_full Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
title_fullStr Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
title_full_unstemmed Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
title_short Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
title_sort efficient algorithms for approximating quantum partition functions at low temperature
url https://quantum-journal.org/papers/q-2023-10-25-1155/pdf/
work_keys_str_mv AT tylerhelmuth efficientalgorithmsforapproximatingquantumpartitionfunctionsatlowtemperature
AT ryanlmann efficientalgorithmsforapproximatingquantumpartitionfunctionsatlowtemperature