Classical algorithms, correlation decay, and complex zeros of partition functions of Quantum many-body systems

DOI10.1145/3357713.3384322OpenAlexW2980515189MaRDI QIDQ5144925

Mehdi Soleimanifar, Aram W. Harrow, Saeed Mehraban

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.09071

zbMATH Keywords

partition functionapproximation algorithmscomplex zerosdecay of correlationsquantum many-body systemsthermal phase transitionHamiltonian complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

The complexity of approximating the complex-valued Potts model ⋮ Efficient algorithms for approximating quantum partition functions ⋮ The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs

This page was built for publication: Classical algorithms, correlation decay, and complex zeros of partition functions of Quantum many-body systems