📝 SummarXiv

Abstract

Long-range systems, characterized by couplings that decay as a power law $r^{-\alpha}$, are of fundamental importance and attract widespread interest across diverse physical phenomena. Among these, bosonic systems are particularly significant due to their theoretical importance and experimental relevance. In this Letter, we propose a classical algorithm with a quasipolynomial runtime to efficiently approximate the partition function of long-range bosonic systems at high temperatures. For finite-range systems, the complexity improves to almost polynomial time. We also present a rigorous proof for the power-law decay of correlation functions. This property, known as clustering of correlation, is well-established for finite-range spin models. However, in sharp contrast, has remained largely unexplored for long-range bosonic systems. The results presented here address two long-standing gaps concerning the computational complexity and correlation clustering in such systems. The methodology we introduce provides new tools for future studies of challenging problems in statistical and quantum many-body physics concerning bosonic system and computational complexity.