Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
Summarize this article with:
Quantum Physics arXiv:2601.21140 (quant-ph) [Submitted on 29 Jan 2026] Title:Efficient Algorithms for Weakly-Interacting Quantum Spin Systems Authors:Ryan L. Mann, Gabriel Waite View a PDF of the paper titled Efficient Algorithms for Weakly-Interacting Quantum Spin Systems, by Ryan L. Mann and 1 other authors View PDF HTML (experimental) Abstract:We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling scheme for the thermal distribution over a classical spin space. Our approach is based on the cluster expansion method and a standard reduction from approximate sampling to approximate counting. Comments: Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS); Combinatorics (math.CO) Cite as: arXiv:2601.21140 [quant-ph] (or arXiv:2601.21140v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2601.21140 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Ryan Mann [view email] [v1] Thu, 29 Jan 2026 00:49:31 UTC (11 KB) Full-text links: Access Paper: View a PDF of the paper titled Efficient Algorithms for Weakly-Interacting Quantum Spin Systems, by Ryan L. Mann and 1 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-01 Change to browse by: cs cs.CC cs.DS math math.CO References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)