Convergence of the Cumulant Expansion and Polynomial-Time Algorithm for Weakly Interacting Fermions
This paper presents a mathematically rigorous, randomized polynomial-time algorithm for computing the log-partition function of weakly interacting fermions by extending cumulant expansion convergence proofs to non-periodic systems and utilizing a tree-determinant expansion with importance sampling and belief propagation.