Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature

Helmuth, T; Mann, RL

Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature

Helmuth, T Mann, RL

Permalink

Publisher:: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Publication Type:: Journal Article
Citation:: Quantum, 2023, 7, pp. 1155
Issue Date:: 2023-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (482.76 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Helmuth, T
dc.contributor.author	Mann, RL
dc.date.accessioned	2024-02-06T23:00:30Z
dc.date.available	2024-02-06T23:00:30Z
dc.date.issued	2023-01-01
dc.identifier.citation	Quantum, 2023, 7, pp. 1155
dc.identifier.issn	2521-327X
dc.identifier.issn	2521-327X
dc.identifier.uri	http://hdl.handle.net/10453/175392
dc.description.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.
dc.language	en
dc.publisher	Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
dc.relation.ispartof	Quantum
dc.relation.isbasedon	10.22331/q-2023-10-25-1155
dc.rights	info:eu-repo/semantics/openAccess
dc.subject.classification	49 Mathematical sciences
dc.subject.classification	51 Physical sciences
dc.title	Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
dc.type	Journal Article
utslib.citation.volume	7
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	open_access	*
dc.date.updated	2024-02-06T23:00:29Z
pubs.publication-status	Published
pubs.volume	7

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/175392