Determinant Diagrammatic Monte Carlo Algorithm in the Thermodynamic Limit

Abstract

We present a simple trick that allows us to consider the sum of all connected Feynman diagrams at fixed position of interaction vertices for general fermionic models, such that the thermodynamic limit can be taken analytically. With our approach one can achieve superior performance compared to conventional diagrammatic Monte Carlo algorithm, while rendering the algorithmic part dramatically simpler. By considering the sum of all connected diagrams at once, we allow for massive cancellations between different diagrams, greatly reducing the sign problem. In the end, the computational effort increases only exponentially with the order of the expansion, which should be contrasted with the factorial growth of the standard diagrammatic technique. We illustrate the efficiency of the technique for the two-dimensional Fermi-Hubbard model.