Papers
Topics
Authors
Recent
Search
2000 character limit reached

Diagrammatic Monte Carlo (DiagMC)

Updated 8 January 2026
  • Diagrammatic Monte Carlo is a stochastic computational method that directly samples Feynman diagrams in configuration space to evaluate series expansions in quantum many-body theory.
  • It uses advanced Monte Carlo moves—including insertion, topology changes, and internal variable shifts—to efficiently navigate high-order diagrammatic spaces and mitigate combinatorial challenges.
  • DiagMC has broad applications in condensed matter, quantum chemistry, and nuclear physics, offering benchmark-quality results and strategies for managing alternating sign issues.

Diagrammatic Monte Carlo (DiagMC) is a stochastic computational methodology for evaluating high-order series expansions in quantum many-body theory, based on sampling Feynman diagrams directly in configuration space. DiagMC enables numerically exact, unbiased results for observables such as Green’s functions and self-energies by summing all diagrammatic contributions up to high order, typically circumventing the combinatorial complexity of diagram enumeration through efficient Markov Chain Monte Carlo (MCMC) algorithms. It has demonstrated broad applicability in fields ranging from condensed matter to nuclear and quantum chemistry, adapting to bare, skeleton (“bold”), dual, and action-shifted expansions. DiagMC fundamentally differs from determinant-based or world-line methods, as it samples the diagrammatic series itself, not the many-body Hilbert space configurations.

1. Theoretical Foundations and Expansion Structure

DiagMC is rooted in the perturbative expansion of quantum many-body observables in terms of Feynman diagrams, each representing terms of the series generated by Wick’s theorem. For instance, the imaginary-time single-particle Green's function is expanded as

G(k,τ)=θ(τ)vacck(τ)ck(0)vac=θ(τ)νν(k)ckvac2eEν(k)τG(k, \tau) = -\theta(\tau)\langle \text{vac} | c_k(\tau) c_k^\dagger(0) | \text{vac} \rangle = -\theta(\tau)\sum_\nu |\langle \nu(k) | c_k^\dagger | \text{vac}\rangle|^2 e^{-E_\nu(k)\tau}

with the long-time asymptotics dominated by the lowest-energy state Ep(k)E_p(k) and quasiparticle residue Z0(k)Z_0(k) (Vlietinck et al., 2014). The corresponding perturbative geometric or skeleton series is written for the self-energy Σ(k,ω)\Sigma(k, \omega) (or Σ(k,τ)\Sigma(k, \tau)) whose terms are irreducible Feynman diagrams characterized by their topology, internal times, and momenta: Σ(p,τ)=n=1topologies ξn0<τ1<<τn<τi=1nd3qi(2π)3W(ξn;p,τ;{τi},{qi}).\Sigma(p, \tau) = \sum_{n=1}^\infty\sum_{\text{topologies } \xi_n} \int_{0<\tau_1<\cdots<\tau_n<\tau} \prod_{i=1}^n \frac{d^3 q_i}{(2\pi)^3} W(\xi_n; p, \tau; \{\tau_i\}, \{q_i\}) . This stochastically sums not only the integrals but the factorially large set of diagram topologies. DiagMC can treat bare or bold (self-consistent) expansions, as well as expansions built around nontrivial reference points such as DMFT or dual fermions/bosons (Vandelli et al., 2020, Iskakov et al., 2016, Pollet et al., 2010, Carlström, 2023).

2. Algorithmic Implementation: Sampling and Update Scheme

DiagMC defines a Markov chain on the space of diagrams, each configuration fully specifying the diagram order, topology, internal variables (times, momenta, frequencies), and external “measuring” variables. Monte Carlo moves include:

  • Insertion/removal of internal lines or vertices: Increasing or decreasing perturbation order by proposing new phonon/boson/interaction insertions within allowed topological sectors, e.g., inserting a phonon arc onto the impurity line at a random segment and sampling its time and momentum (Greitemann et al., 2017, Vlietinck et al., 2014).
  • Topology-changing updates: Reconnection, swap, or “shuffle” moves that permute internal structure without altering the order.
  • Internal variable shifts: Proposals that resample internal variables such as momenta or integration times (Greitemann et al., 2017).

Each move is governed by the Metropolis–Hastings acceptance probability

Pacc=min{1,WDTrevWDTforw},P_{\text{acc}} = \min\left\{ 1, \frac{W_{D'} T_{\text{rev}}}{W_D T_{\text{forw}}}\right\},

where WDW_D is the current diagram’s weight and Tforw,revT_{\text{forw,rev}} are the forward and reverse proposal probabilities (Vlietinck et al., 2014, Brolli et al., 5 Jan 2025, Buividovich, 2016). In sectors with nonpositive weights, the algorithm keeps track of diagram signs, accumulating the observable with sign reweighting; this is essential for convergent alternating series and is known as the “sign problem” in DiagMC.

DiagMC is formally ergodic: by iteratively proposing these changes, it achieves asymptotically unbiased sampling over the entire diagrammatic space. Exact normalization is achieved by periodically visiting diagrams of known analytical weight (“normalization sectors”).

3. Series Convergence, Sign Structure, and Statistical Control

The convergence of DiagMC relies on the “sign blessing” property: in physically well-behaved models, alternating signs between diagrams lead to strong cancellations, resulting in convergent series—even for expansions where individual diagrams are factorially numerous. Examples include the Fermi polaron, bosonic/fermionic impurity models, and Holstein–type electron–phonon systems where bare and skeleton expansions remain resummable (Vlietinck et al., 2014, Mishchenko et al., 2014).

For models plagued by strong alternating signs (particularly with long-range or retarded interactions), enhancing series convergence requires advanced resummation strategies (e.g., Riesz or Lindelöf summations, regrouping techniques) and systematic error control via cutoff extrapolation in diagram order, integration boundaries, and statistical error bars (Kroiss et al., 2014, Vlietinck et al., 2014).

DiagMC is often essentially free of the configuration-space “fermionic sign problem” that afflicts determinant or path-integral MC, but series convergence is generically more subtle. For example, in interacting Fermi gases at unitarity, the sign structure of the series (arising from fermion exchange) strictly impedes sampling at high order, bounding feasible NmaxN_{\text{max}}.

Statistical accuracy is quantified by repeated (or block-binned) averages and error propagation on spectral and quasiparticle quantities (e.g., polaron energy, residue, contact coefficient). Series convergence is established by explicit checks with increasing order, momentum/frequency cutoffs, and integration length (Vlietinck et al., 2014, Greitemann et al., 2017, Brolli et al., 5 Jan 2025).

4. Extensions: Bold/Skeleton, Dual, and Hybrid Embedding Schemes

Bold DiagMC (“skeleton” expansion) absorbs infinite-order diagrammatic subseries into dressed propagators (and in some cases vertices). The self-energy is sampled as a sum over skeleton, irreducible diagrams built entirely from fully dressed lines, with Dyson equations closing the loop: G=[G01Σ]1.G = \left[ G_0^{-1} - \Sigma \right]^{-1} . The bold framework accelerates convergence in correlated regimes and enables integration with other self-consistent mean-field embeddings (Kulagin et al., 2012, Mishchenko et al., 2014, Pollet et al., 2010). For example, BDMC+DMFT schemes split the self-energy Σ(k,ω)=Σloc(ω)+Σ(k,ω)\Sigma(k, \omega) = \Sigma_{\text{loc}}(\omega) + \Sigma'(k, \omega), with local diagrams (summed to all orders) handled by a DMFT impurity solver and non-local diagrams stochastically sampled (Pollet et al., 2010, Carlström, 2023, Vandelli et al., 2020).

Dual fermion/boson DiagMC expands around a DMFT (or impurity) reference, introducing dual degrees of freedom whose diagrams systematically encode nonlocal corrections to the local theory (Iskakov et al., 2016, Vandelli et al., 2020). Stochastic sampling of dual diagrams includes general two-particle vertices, yielding rapid convergence for observables when the dual corrections are small.

Flat-histogram DiagMC enhances efficiency, particularly at long times or high diagram order, by employing multicanonical or Wang-Landau histogram-flattening weights. This technique ensures uniform sampling across diagram order or target observable bins (e.g., late imaginary-time Green’s function), eliminating bottlenecks from rapidly decaying contributions (Diamantis et al., 2013).

Action-shifted and real-frequency DiagMC schemes perform analytic integration over internal times, combining exact formulae for diagram weights with stochastic sampling over momenta or topology, thus eliminating some of the difficulties associated with analytic continuation or frequency summations (Vucicevic et al., 2020).

5. Benchmark Applications and Computational Performance

DiagMC has produced benchmark-quality results in numerous paradigmatic problems:

  • Polaron physics: Automated sampling up to high order for Fröhlich, acoustic, and BEC polaron models yields ground-state energies and residues in quantitative agreement with variational bounds, and establishes the near-exactness of low particle–hole truncations for quasiparticle properties (Vlietinck et al., 2014, Greitemann et al., 2017, Vlietinck et al., 2014, Kroiss et al., 2014).
  • Fermi and Bose gases: The method accurately captures the contact, high-momentum tails, and thermodynamics of resonant and imbalanced Fermi gases, including the challenging unitary and high-correlation regimes (Houcke et al., 2013).
  • Frustrated magnets: Bold DiagMC for frustrated lattice spin systems, using fermionic Popov–Fedotov representations, delivers quantitative susceptibility and response results in the thermodynamic limit free from sign and size biases (Kulagin et al., 2012).
  • Holstein and electron–phonon models: Skeleton DiagMC resolves vertex corrections in many-polaron systems up to high order, yielding precise quasiparticle renormalization trends as a function of carrier density (Mishchenko et al., 2014).
  • Quantum chemistry and nuclear pairing: Recent adaptations allow sampling of full configuration-interaction ladder expansions in discrete-level systems, naturally extending ab initio methods (Brolli et al., 5 Jan 2025, Li et al., 2020).

Performance is dictated by diagram order cutoff, available computational resources, and convergence rate of the specific model. Statistical error scales as 1/NMC1/\sqrt{N_\text{MC}}, and wall time typically increases polynomially with diagram order and system size, though factorial diagram proliferation still constrains feasible NmaxN_{\text{max}} despite standard importance-sampling optimizations.

6. Limitations, Open Problems, and Future Directions

DiagMC remains limited by the combinatorics of diagram enumeration at extremely high order and by the sign structure of the series in models with intrinsic “Dyson divergence”. Its applicability to strong-correlation problems beyond perturbative or resummable regimes is model-dependent, with ongoing research into summation optimizations, resummation methods, and embedding techniques.

Extensions to real-frequency, zero-temperature, and real-time calculations have seen significant recent advances, leveraging analytic τ-integral solutions, action-shifted schemes, and stochastic Keldysh diagrammatics (Vucicevic et al., 2020, Brolli et al., 5 Jan 2025). Incorporation of multi-particle and higher-rank vertices, integration with dynamical mean-field and other embedding frameworks, and applications to quantum chemistry through determinant-based methods continue to broaden its impact (Vandelli et al., 2020, Carlström, 2023, Li et al., 2020, Scott et al., 2020).

Current frontiers include improving variance-reduction and histogram-flattening algorithms (Diamantis et al., 2013), devising new embedding reference schemes for correlated lattice and molecular systems (Carlström, 2023), and extending DiagMC strategies to systematically include three-body forces or configuration-interaction expansions at zero temperature (Brolli et al., 5 Jan 2025). The method’s flexibility and rigor ensure its ongoing relevance at the intersection of condensed matter, quantum chemistry, and nuclear theory.


Key references:

"Diagrammatic Monte Carlo study of the acoustic and the BEC polaron" (Vlietinck et al., 2014); "Bold Diagrammatic Monte Carlo technique for frustrated spin systems" (Kulagin et al., 2012); "Diagrammatic Monte Carlo for Finite Systems at Zero Temperature" (Brolli et al., 5 Jan 2025); "Flat histogram diagrammatic Monte Carlo method" (Diamantis et al., 2013); "Incorporating Dynamic Mean-Field Theory into Diagrammatic Monte Carlo" (Pollet et al., 2010); "Diagrammatic Monte Carlo for Dual Fermions" (Iskakov et al., 2016); "Analytical solution for time-integrals in diagrammatic expansions: application to real-frequency diagrammatic Monte Carlo" (Vucicevic et al., 2020); "Dual Boson Diagrammatic Monte Carlo Approach Applied to the Extended Hubbard Model" (Vandelli et al., 2020).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (17)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Diagrammatic Monte Carlo (DiagMC).