REVIEW 1 cited by
Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
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 at Low Temperature
read the original 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\'y, and Ueltschi with the algorithmic framework developed by Helmuth, Perkins, and Regts, and Borgs et al.
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.