Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
Aram W. Harrow, Saeed Mehraban, Mehdi Soleimanifar
摘要
Various statistical properties of quantum many-body systems in thermal equilibrium such as the free energy, entropy, and average energy can be obtained from the partition function. The problem of estimating the partition function has been the subject of numerous studies in statistical physics, computer science, and machine learning. The aim of this work is to present a new classical algorithm for estimating the partition function of quantum systems. We achieve this by studying the connection between the hardness of approximating the partition function and the thermal phase transition. In particular, we show the following:
(1) We demonstrate a quasi-polynomial time classical algorithm that estimates the partition function of quantum systems above the phase transition point. The running time of this algorithm relies heavily on the locus of the complex zeros of the partition function. Intriguingly, these complex zeros are known to mark where the phase transition occurs. By a result of [Sly10], in the worst case, the same problem is NP-hard below this point. Together with our work, this shows that the transition in the phase of a quantum system is also accompanied by a transition in the hardness of approximation.
(2) We show that in a system of n particles at temperatures above the phase transition point, where the complex zeros are far from the real axis, the correlations between two observables whose distance is Ω(log n) decay exponentially. We can improve the factor of log n to a constant when the Hamiltonian has commuting terms or is on a 1D chain. Previously, the decay of correlations was only proved for translationally-invariant 1D systems [Ara69] or at very high temperatures [KGK + 14].
(3) We find a deterministic quasi-polynomial time approximation algorithm for the XXZ model in the ferromagnetic regime at any temperature over arbitrary graphs. Previously, a randomized algorithm was known only for the ferromagnetic XY model [BG17].
This work is the first rigorous study of the connection between the complex zeros of the partition function and the decay of correlations in quantum many-body systems and extends a seminal work of Dobrushin and Shlosman on classical spin models [DS87]. On the algorithmic side, our result extends the scope of a recent approach due to Barvinok for solving classical counting problems [Bar16a] to quantum many-body problems.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- High-Temperature Gibbs States are Unentangled and Efficiently PreparableAinesh Bakshi, Allen Liu, Ankur Moitra, Ewin TangFOCS 2024 · 被引用 15 次
- Fast Mixing of Quantum Spin Chains at All TemperaturesThiago Bergamaschi, Chi-Fang ChenSTOC 2026 · 被引用 13 次
- Sample-efficient learning of quantum many-body systemsAnurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, Mehdi SoleimanifarFOCS 2020 · 被引用 9 次
- On complex roots of the independence polynomialFerenc Bencs, Péter Csikvári, Piyush Srivastava, Jan VondrákSODA 2023 · 被引用 6 次
- On Zeros and Algorithms for Disordered Systems: Mean-Field Spin GlassesFerenc Bencs, Brice Huang, Daniel Z. Lee, Kuikui Liu 等STOC 2026 · 被引用 2 次
相关 Paper
- Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness RegionZongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric VigodaSODA 2022 · 被引用 11 次
- A Sublinear-Time Quantum Algorithm for Approximating Partition FunctionsArjan Cornelissen, Yassine HamoudiSODA 2023 · 被引用 9 次
- Phase Transitions via Complex Extensions of Markov ChainsJingcheng Liu, Chunyang Wang, Yitong Yin, Yixiao YuSTOC 2025 · 被引用 6 次
- Counting independent sets in unbalanced bipartite graphsSarah Cannon, Will PerkinsSODA 2020 · 被引用 22 次
- Zeros of ferromagnetic 2-spin systemsHeng Guo, Jingcheng Liu, Pinyan LuSODA 2020 · 被引用 12 次
