Efficient algorithms for weakly interacting quantum spin systems
Physical Review A · 13.07.2026 · 114 (1)
DOI: 10.1103/45rz-42gr ↗Kurz gefasst
Fachartikel in der Zeitschrift Physical Review A, online erschienen am 13.07.2026. Verfasst von Ryan L. Mann und 1 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Gefördert von: Centre of Excellence for Quantum Computation and Communication Technology, Australian Research Council.
Abstract (Originalsprache)
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.
Förderung
- Centre of Excellence for Quantum Computation and Communication Technology, Australian Research Council
Zitieren
APA
Mann, R. L., & Waite, G. (2026). Efficient algorithms for weakly interacting quantum spin systems. Physical Review A, 114(1). https://doi.org/10.1103/45rz-42gr
Vancouver
Mann RL, Waite G. Efficient algorithms for weakly interacting quantum spin systems. Physical Review A. 2026;114(1). doi:10.1103/45rz-42gr
BibTeX
@article{Mann2026,
author = {Mann, Ryan L. and Waite, Gabriel},
title = {Efficient algorithms for weakly interacting quantum spin systems},
journal = {Physical Review A},
year = {2026},
volume = {114},
number = {1},
doi = {10.1103/45rz-42gr}
}
EUVIMED