Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914289264099328 |
|---|---|
| author | Mann, Ryan L. Waite, Gabriel |
| author_facet | Mann, Ryan L. Waite, Gabriel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_21140 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient Algorithms for Weakly-Interacting Quantum Spin Systems Mann, Ryan L. Waite, Gabriel Quantum Physics Computational Complexity Data Structures and Algorithms Combinatorics 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. |
| title | Efficient Algorithms for Weakly-Interacting Quantum Spin Systems |
| topic | Quantum Physics Computational Complexity Data Structures and Algorithms Combinatorics |
| url | https://arxiv.org/abs/2601.21140 |