Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Statistical Physics

Uniqueness and clustering properties of Gibbs states for classical and quantum unbounded spin systems

Yong‐Moon Park, Hyun Jae Yoo

Published Jul 1, 1995• 54 citations
Publisher
DOI
10.1007/bf02178359

Related papers

Small-Mass Behavior of Quantum Gibbs States for Lattice Models with Unbounded Spins

Sergio A Albeverio, Yu. G. Kondratiev, R. A. Minlos +1 more

Journal of Statistical Physics•Sep 1, 1998•12 citations

Gibbs states in the case of classical representation of quantum spin systems

I. L. Simyatitskii

Theoretical and Mathematical Physics•Jun 1, 1979•0 citations

Purification and uniqueness of quantum Gibbs states

Taku Matsui

Communications in Mathematical Physics•May 1, 1994•8 citations

Cluster Expansions for Many Boson and Unbounded Spin Systems

Martin Lohmann

•Jan 1, 2014•0 citations

Clustering of Conditional Mutual Information for Quantum Gibbs States above a Threshold Temperature

Tomotaka Kuwahara, Kohtaro Kato, Fernando G. S. L. Brandão

We prove that the quantum Gibbs states of spin systems above a certain threshold temperature are approximate quantum Markov networks, meaning that the conditional mutual information decays rapidly with distance. We demonstrate the exponential decay for short-ranged interacting systems and power-law decay for long-ranged interacting systems. Consequently, we establish the efficiency of quantum Gibbs sampling algorithms, a strong version of the area law, the quasilocality of effective Hamiltonians on subsystems, a clustering theorem for mutual information, and a polynomial-time algorithm for classical Gibbs state simulations.

arXiv:1910.09425•Physical Review Letters•Jun 1, 2020•68 citations

Gibbs state sampling via cluster expansions

Norhan M. Eassa, Mahmoud M. Moustafa, Arnab Banerjee +1 more

Gibbs states (i.e., thermal states) can be used for several applications such as quantum simulation, quantum machine learning, quantum optimization, and the study of open quantum systems. Moreover, semi-definite programming, combinatorial optimization problems, and training quantum Boltzmann machines can all be addressed by sampling from well-prepared Gibbs states. With that, however, comes the fact that preparing and sampling from Gibbs states on a quantum computer are notoriously difficult tasks. Such tasks can require large overhead in resources and/or calibration even in the simplest of cases, as well as the fact that the implementation might be limited to only a specific set of systems. We propose a method based on sampling from a quasi-distribution consisting of tensor products of mixed states on local clusters, i.e., expanding the full Gibbs state into a sum of products of local “Gibbs-cumulant” type states easier to implement and sample from on quantum hardware. We begin with presenting results for 4-spin linear chains with XY spin interactions, for which we obtain the Z Z dynamical spin-spin correlation functions and dynamical structure factor. We also present the results of measuring the specific heat of the 8-spin chain Gibbs state ρ 8 .

arXiv:2310.20129•npj Quantum Information•Oct 4, 2024•2 citations
We prove that the quantum Gibbs states of spin systems above a certain threshold temperature are approximate quantum Markov networks, meaning that the conditional mutual information decays rapidly with distance. We demonstrate the exponential decay for short-ranged interacting systems and power-law decay for long-ranged interacting systems. Consequently, we establish the efficiency of quantum Gibbs sampling algorithms, a strong version of the area law, the quasilocality of effective Hamiltonians on subsystems, a clustering theorem for mutual information, and a polynomial-time algorithm for classical Gibbs state simulations.
Gibbs states (i.e., thermal states) can be used for several applications such as quantum simulation, quantum machine learning, quantum optimization, and the study of open quantum systems. Moreover, semi-definite programming, combinatorial optimization problems, and training quantum Boltzmann machines can all be addressed by sampling from well-prepared Gibbs states. With that, however, comes the fact that preparing and sampling from Gibbs states on a quantum computer are notoriously difficult tasks. Such tasks can require large overhead in resources and/or calibration even in the simplest of cases, as well as the fact that the implementation might be limited to only a specific set of systems. We propose a method based on sampling from a quasi-distribution consisting of tensor products of mixed states on local clusters, i.e., expanding the full Gibbs state into a sum of products of local “Gibbs-cumulant” type states easier to implement and sample from on quantum hardware. We begin with presenting results for 4-spin linear chains with XY spin interactions, for which we obtain the Z Z dynamical spin-spin correlation functions and dynamical structure factor. We also present the results of measuring the specific heat of the 8-spin chain Gibbs state ρ 8 .