Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication

Topics

Quantum State Preparation Representation

Efficient Algorithms for Weakly-Interacting Quantum Spin Systems

arXiv
Authors: Ryan L. Mann, Gabriel Waite

Year

2026

Paper ID

3166

Status

Preprint

Abstract Read

~2 min

Abstract Words

59

Citations

N/A

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.

Why This Paper Matters

  • This paper contributes to the Quantum State Preparation & Representation research area in the Quantum Articles archive.
  • It adds a 2026 reference point for readers tracking recent quantum research.
  • We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in
Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:2601.21140 [2] arXiv https://arxiv.org/abs/2601.21140 [3] Publisher https://arxiv.org/abs/2601.21140

Local Citation Graph (Related-Paper Links)

Current Paper #3166

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.