Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1612.05184 · Physical Review Letters

Determinant Diagrammatic Monte Carlo Algorithm in the Thermodynamic Limit

Riccardo Rossi

Published Jul 25, 2017• 110 citations
arXivHTMLPDF

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.

DOI
10.1103/physrevlett.119.045701

Related papers

Determinant Monte Carlo algorithm for dynamical quantities in fermionic quantum systems

Alice Moutenet, Wéi Wú, Michel Ferrero

We introduce a Monte Carlo determinantal algorithm that allows to efficiently sample dynamical quantities, such as the self-energy, of fermionic quantum systems in their thermodynamic limit. The method expresses the sum of a factorial number of one-particle-irreducible diagrams as a recursive sum of determinants with exponential complexity. By comparing results of this algorithm for the lattice Hubbard model with those obtained from diagrammatic Monte Carlo and the recently introduced connected determinant approach, we show that we can reach higher perturbation orders and greater accuracy for the same computational effort.

arXiv:1712.10304?context=cond-mat•Dec 29, 2017•0 citations

Determinant Monte Carlo algorithms for dynamical quantities in fermionic systems

Alice Moutenet, Wéi Wú, Michel Ferrero

We introduce and compare three different Monte Carlo determinantal algorithms that allow one to compute dynamical quantities, such as the self-energy, of fermionic systems in their thermodynamic limit. We show that the most efficient approach expresses the sum of a factorial number of one-particle-irreducible diagrams as a recursive sum of determinants with exponential complexity. By comparing results for the two-dimensional Hubbard model with those obtained from state-of-the-art diagrammatic Monte Carlo, we show that we can reach higher perturbation orders and greater accuracy for the same computational effort.

arXiv:1712.10304•Physical review. B./Physical review. B•Feb 12, 2018•49 citations

Determinant Monte Carlo for irreducible Feynman diagrams

Fedor Šimkovic, Evgeny Kozik

We introduce a numerically exact method for efficient summation of irreducible Feynman diagrams for the fermionic self-energy in the thermodynamic limit. The technique, based on the Diagrammatic Determinant Monte Carlo, allows us to reach unprecedentedly high ($\sim 10$) orders of the weak-coupling expansion for the self-energy of the two-dimensional Hubbard model. Access to high orders reveals a non-trivial analytic structure of the self-energy and enables its controlled reconstruction with arbitrary momentum resolution in the non-perturbative regime of essentially strong correlations, which has recently been reached with ultracold atoms in optical lattices.

•Dec 28, 2017•0 citations

Efficient one-loop-renormalized vertex expansions with connected determinant diagrammatic Monte Carlo

Fedor Šimkovic, Riccardo Rossi, Michel Ferrero

We present a technique that enables the evaluation of perturbative expansions based on one-loop-renormalized vertices up to large expansion orders. Specifically, we show how to compute large-order corrections to the random phase approximation in either the particle-hole or particle-particle channels. The algorithm's efficiency is achieved by the summation over contributions of all symmetrized Feynman diagram topologies using determinants, and by integrating out analytically the two-body long-range interactions in order to yield an effective zero-range interaction. Notably, the exponential scaling of the algorithm as a function of perturbation order leads to a polynomial scaling of the approximation error with computational time for a convergent series. To assess the performance of our approach, we apply it to the nonperturbative regime of the square-lattice fermionic Hubbard model away from half-filling and report, as compared to the bare interaction expansion algorithm, significant improvements of the Monte Carlo variance as well as the convergence properties of the resulting perturbative series.

arXiv:2008.07377•Physical review. B./Physical review. B•Nov 13, 2020•15 citations

Determinant Monte Carlo for irreducible Feynman diagrams in the strongly correlated regime

Fedor Šimkovic, Evgeny Kozik

We develop a numerically exact method for the summation of irreducible Feynman diagrams for fermionic self-energy in the thermodynamic limit. The technique, based on the diagrammatic determinant Monte Carlo and its recent extension to connected diagrams, allows us to reach high $(\ensuremath{\sim}10)$ orders of the weak-coupling expansion for the self-energy of the two-dimensional Hubbard model. Access to high orders reveals a nontrivial analytic structure of the self-energy and enables its controlled reconstruction with arbitrary momentum resolution in the nonperturbative regime of essentially strong correlations, which has recently been reached with ultracold atoms in optical lattices.

arXiv:1712.10001•Physical review. B./Physical review. B•Sep 4, 2019•57 citations

Truncated-determinant diagrammatic Monte Carlo for fermions with contact interaction

Evgueni Bourovski, Nikolay V. Prokof'ev, Boris V. Svistunov

For some models of interacting fermions the known solution to the notorious sign problem in Monte Carlo (MC) simulations is to work with macroscopic fermionic determinants; the price, however, is a macroscopic scaling of the numerical effort spent on elementary local updates. We find that the ratio of two macroscopic determinants can be found with any desired accuracy by considering truncated (local in space and time) matices. In this respect, MC for interacting fermionic systems becomes similar to that for the sign-problem-free bosonic systems with system-size independent update cost. We demonstrate the utility of the truncated-determinant method by simulating the attractive Hubbard model within the MC scheme based on partially summed Feynman diagrams. We conjecture that similar approach may be useful in other implementations of the sign-free determinant schemes.

arXiv:cond-mat/0312108•Physical Review B•Nov 4, 2004•16 citations
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.
We introduce a Monte Carlo determinantal algorithm that allows to efficiently sample dynamical quantities, such as the self-energy, of fermionic quantum systems in their thermodynamic limit. The method expresses the sum of a factorial number of one-particle-irreducible diagrams as a recursive sum of determinants with exponential complexity. By comparing results of this algorithm for the lattice Hubbard model with those obtained from diagrammatic Monte Carlo and the recently introduced connected determinant approach, we show that we can reach higher perturbation orders and greater accuracy for the same computational effort.
We introduce and compare three different Monte Carlo determinantal algorithms that allow one to compute dynamical quantities, such as the self-energy, of fermionic systems in their thermodynamic limit. We show that the most efficient approach expresses the sum of a factorial number of one-particle-irreducible diagrams as a recursive sum of determinants with exponential complexity. By comparing results for the two-dimensional Hubbard model with those obtained from state-of-the-art diagrammatic Monte Carlo, we show that we can reach higher perturbation orders and greater accuracy for the same computational effort.
We introduce a numerically exact method for efficient summation of irreducible Feynman diagrams for the fermionic self-energy in the thermodynamic limit. The technique, based on the Diagrammatic Determinant Monte Carlo, allows us to reach unprecedentedly high (∼10\sim 10∼10) orders of the weak-coupling expansion for the self-energy of the two-dimensional Hubbard model. Access to high orders reveals a non-trivial analytic structure of the self-energy and enables its controlled reconstruction with arbitrary momentum resolution in the non-perturbative regime of essentially strong correlations, which has recently been reached with ultracold atoms in optical lattices.
We present a technique that enables the evaluation of perturbative expansions based on one-loop-renormalized vertices up to large expansion orders. Specifically, we show how to compute large-order corrections to the random phase approximation in either the particle-hole or particle-particle channels. The algorithm's efficiency is achieved by the summation over contributions of all symmetrized Feynman diagram topologies using determinants, and by integrating out analytically the two-body long-range interactions in order to yield an effective zero-range interaction. Notably, the exponential scaling of the algorithm as a function of perturbation order leads to a polynomial scaling of the approximation error with computational time for a convergent series. To assess the performance of our approach, we apply it to the nonperturbative regime of the square-lattice fermionic Hubbard model away from half-filling and report, as compared to the bare interaction expansion algorithm, significant improvements of the Monte Carlo variance as well as the convergence properties of the resulting perturbative series.
We develop a numerically exact method for the summation of irreducible Feynman diagrams for fermionic self-energy in the thermodynamic limit. The technique, based on the diagrammatic determinant Monte Carlo and its recent extension to connected diagrams, allows us to reach high $(\ensuremath{\sim}10)$ orders of the weak-coupling expansion for the self-energy of the two-dimensional Hubbard model. Access to high orders reveals a nontrivial analytic structure of the self-energy and enables its controlled reconstruction with arbitrary momentum resolution in the nonperturbative regime of essentially strong correlations, which has recently been reached with ultracold atoms in optical lattices.
For some models of interacting fermions the known solution to the notorious sign problem in Monte Carlo (MC) simulations is to work with macroscopic fermionic determinants; the price, however, is a macroscopic scaling of the numerical effort spent on elementary local updates. We find that the ratio of two macroscopic determinants can be found with any desired accuracy by considering truncated (local in space and time) matices. In this respect, MC for interacting fermionic systems becomes similar to that for the sign-problem-free bosonic systems with system-size independent update cost. We demonstrate the utility of the truncated-determinant method by simulating the attractive Hubbard model within the MC scheme based on partially summed Feynman diagrams. We conjecture that similar approach may be useful in other implementations of the sign-free determinant schemes.