REVIEW 1 cited by
Efficient Algorithms for Approximating Quantum Partition Functions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Efficient Algorithms for Approximating Quantum Partition Functions
read the original 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\v{c}n\'y 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.
Forward citations
Cited by 1 Pith paper
-
Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
A cluster-expansion FPTAS for the partition function and an approximate sampler for weakly-interacting quantum spin systems at arbitrary temperature are claimed, but a key bound in the proof fails.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.