Efficient algorithms for approximating quantum partition functions

Mann, RL; Helmuth, T

Efficient algorithms for approximating quantum partition functions

Mann, RL Helmuth, T

Permalink

Publisher:: AMER INST PHYSICS
Publication Type:: Journal Article
Citation:: Journal of Mathematical Physics, 2021, 62, (2)
Issue Date:: 2021-02-01

Closed Access

	Filename	Description	Size
	5.0013689.pdf	Published version	4.39 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Mann, RL
dc.contributor.author	Helmuth, T
dc.date.accessioned	2022-07-21T23:05:53Z
dc.date.available	2022-07-21T23:05:53Z
dc.date.issued	2021-02-01
dc.identifier.citation	Journal of Mathematical Physics, 2021, 62, (2)
dc.identifier.issn	0022-2488
dc.identifier.issn	1089-7658
dc.identifier.uri	http://hdl.handle.net/10453/159094
dc.description.abstract	We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Netočný and Redig and the cluster expansion approach to designing algorithms due to Helmuth, Perkins, and Regts. Similar results have previously been obtained by related methods, and our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs.
dc.language	English
dc.publisher	AMER INST PHYSICS
dc.relation.ispartof	Journal of Mathematical Physics
dc.relation.isbasedon	10.1063/5.0013689
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	01 Mathematical Sciences, 02 Physical Sciences
dc.subject.classification	Mathematical Physics
dc.title	Efficient algorithms for approximating quantum partition functions
dc.type	Journal Article
utslib.citation.volume	62
utslib.for	01 Mathematical Sciences
utslib.for	02 Physical Sciences
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	closed_access	*
dc.date.updated	2022-07-21T23:05:50Z
pubs.issue	2
pubs.publication-status	Published
pubs.volume	62
utslib.citation.issue	2

Abstract:

We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Netočný and Redig and the cluster expansion approach to designing algorithms due to Helmuth, Perkins, and Regts. Similar results have previously been obtained by related methods, and our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs.

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

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