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:1609.08833 · International Symposium on Lattice Field Theory (LATTICE)

Metropolis updates for Diagrammatic Monte-Carlo algorithms from Schwinger-Dyson equations

P. V. Buividovich

Published Feb 17, 2017• 0 citations
arXivHTMLPDF

Abstract

We describe a general recipe for constructing Metropolis updates for Diagrammatic Monte-Carlo (DiagMC) algorithms, based on the Schwinger-Dyson equations in quantum field theory. This approach bypasses explicit duality transformations, enumeration or classification of diagrams and can be used for lattice quantum field theories with unknown or complicated dual representations (such as non-Abelian lattice gauge theories). DiagMC algorithms constructed in this way can still be plagued by the sign problem, which is, however, completely different from the sign problem in conventional Monte-Carlo simulations and has its origin in cancellations between diagrams with positive and negative weights. To test the presented approach, we apply DiagMC to calculate the first 7 orders of $1/N^2$ expansion in the quartic matrix model and find good agreement with analytic results, with the exception of the close vicinity of the critical coupling where the critical slowing down sets in.

DOI
10.22323/1.256.0315

Related papers

Diagrammatic Monte Carlo

Kris Van Houcke, Evgeny Kozik, Nikolay V. Prokof'ev +1 more

Diagrammatic Monte Carlo (DiagMC) is a numeric technique that allows one to calculate quantities specified in terms of diagrammatic expansions, the latter being a standard tool of many-body quantum statistics. The sign problem that is typically fatal to Monte Carlo approaches, appears to be manageable with DiagMC. Starting with a general introduction to the principles of DiagMC, we present a detailed description of the DiagMC scheme for interacting fermions (Hubbard model), as well as the first illustrative results for the equations of state.

•Jan 1, 2008•0 citations

Diagrammatic Monte Carlo

Kris Van Houcke, Evgeny Kozik, Nikolay V. Prokof'ev +1 more

Diagrammatic Monte Carlo (DiagMC) is a numeric technique that allows one to calculate quantities specified in terms of diagrammatic expansions, the latter being a standard tool of many-body quantum statistics. The sign problem that is typically fatal to Monte Carlo approaches, appears to be manageable with DiagMC. Starting with a general introduction to the principles of DiagMC, we present a detailed description of the DiagMC scheme for interacting fermions (Hubbard model), as well as the first illustrative results for the equations of state.

arXiv:0802.2923•Physics Procedia•Jan 1, 2010•181 citations

Towards overcoming the Monte Carlo sign problem with tensor networks

Mari Carmen Bañuls, Krzysztof Cichy, J. I. Cirac +3 more

The study of lattice gauge theories with Monte Carlo simulations is hindered by the infamous sign problem that appears under certain circumstances, in particular at non-zero chemical potential.So far, there is no universal method to overcome this problem.However, recent years brought a new class of non-perturbative Hamiltonian techniques named tensor networks, where the sign problem is absent.In previous work, we have demonstrated that this approach, in particular matrix product states in 1+1 dimensions, can be used to perform precise calculations in a lattice gauge theory, the massless and massive Schwinger model.We have computed the mass spectrum of this theory, its thermal properties and real-time dynamics.In this work, we review these results and we extend our calculations to the case of two flavours and non-zero chemical potential.We are able to reliably reproduce known analytical results for this model, thus demonstrating that tensor networks can tackle the sign problem of a lattice gauge theory at finite density.

•Jan 1, 2016•17 citations

Towards overcoming the Monte Carlo sign problem with tensor networks

Mari Carmen Bañuls, Krzysztof Cichy, J. Ignacio Cirac +3 more

The study of lattice gauge theories with Monte Carlo simulations is hindered by the infamous sign problem that appears under certain circumstances, in particular at non-zero chemical potential. So far, there is no universal method to overcome this problem. However, recent years brought a new class of non-perturbative Hamiltonian techniques named tensor networks, where the sign problem is absent. In previous work, we have demonstrated that this approach, in particular matrix product states in 1+1 dimensions, can be used to perform precise calculations in a lattice gauge theory, the massless and massive Schwinger model. We have computed the mass spectrum of this theory, its thermal properties and real-time dynamics. In this work, we review these results and we extend our calculations to the case of two flavours and non-zero chemical potential. We are able to reliably reproduce known analytical results for this model, thus demonstrating that tensor networks can tackle the sign problem of a lattice gauge theory at finite density.

arXiv:1611.04791•EPJ Web of Conferences•Jan 1, 2017•33 citations

Diagrammatic Methods for Strongly-Correlated Electrons in Realistic Systems

Jia Li

This thesis is devoted to the development of numerical methods for correlated electrons in realistic systems based on perturbation theories using Feynman diagrams. Electron correlations in realistic systems give rise to a wide range of interesting physical properties. Diagrammatic expansions and its low-order approximations are key building blocks of theoretical and numerical methods for studying correlated electrons. Recent developments of the diagrammatic quantum Monte Carlo (DiagMC) methods enable efficient stochastic evaluations of diagrams and does not suffer from numerical sign problem which worsens with increasing system size. It is therefore a promising direction to apply DiagMC techniques to realistic electron systems in the pursuit of ab initio calculations of correlated materials. This thesis starts by reviewing basic concepts and definitions of realistic electron systems, the perturbation theory based on Feynman diagrams, Monte Carlo evaluations of the series, as well as self-consistent diagrammatic methods. Low-order diagrammatic methods are applied to realistic calculations and benchmarked against large collections of state-of-the-art many-body methods. The thesis then proposes a diagrammatic Monte Carlo solver for realistic molecules and impurities based on a recursive evaluation of diagrams, which is tested on realistic molecules and impurities with varying temperature, system size, and interaction strength. We observe that this method is ideal for problems with many orbitals with moderate correlations, but may suffer from series divergence at strong correlations. Next, we propose the inchworm Monte Carlo algorithm for interaction expansion, which overcomes limitations of divergent diagrammatic series by replacing the standard perturbation series with a sequence of incremental series expansions. A prototype implementation is presented for system with on-site Hubbard interactions. Finally, we discuss technical aspects of numerical representations of the Green's function, which has significant impact on the efficiency of diagrammatic methods. We review several common numerical representations, and introduce our development of the sparse sampling method, which provides compact representations of the Green's function in both imaginary time and frequency as well as fast transformation formula between the two.

•Jan 1, 2021•0 citations

Diagrammatic Monte Carlo procedure for the spin-charge transformed Hubbard model

Johan Carlström

Using a dual representation of lattice fermion models that is based on spin-charge transformation and fermionization of the original description, I derive an algorithm for diagrammatic Monte Carlo simulation of strongly correlated systems. This scheme allows eliminating large expansion parameters, as well as large corrections to the density matrix that generally prevent diagrammatic methods from being efficient in this regime. As an example, I compute the filling factor for the Hubbard model at infinite on-site repulsion and compare the results to controllable data obtained from numerical linked-cluster expansion. I find excellent agreement between the two methods, as well as rapid convergence of the diagrammatic series. I also report results for the momentum distribution and kinetic energy of the electrons.

arXiv:1709.06415•Physical review. B./Physical review. B•Feb 12, 2018•21 citations
We describe a general recipe for constructing Metropolis updates for Diagrammatic Monte-Carlo (DiagMC) algorithms, based on the Schwinger-Dyson equations in quantum field theory. This approach bypasses explicit duality transformations, enumeration or classification of diagrams and can be used for lattice quantum field theories with unknown or complicated dual representations (such as non-Abelian lattice gauge theories). DiagMC algorithms constructed in this way can still be plagued by the sign problem, which is, however, completely different from the sign problem in conventional Monte-Carlo simulations and has its origin in cancellations between diagrams with positive and negative weights. To test the presented approach, we apply DiagMC to calculate the first 7 orders of 1/N21/N^21/N2 expansion in the quartic matrix model and find good agreement with analytic results, with the exception of the close vicinity of the critical coupling where the critical slowing down sets in.
Diagrammatic Monte Carlo (DiagMC) is a numeric technique that allows one to calculate quantities specified in terms of diagrammatic expansions, the latter being a standard tool of many-body quantum statistics. The sign problem that is typically fatal to Monte Carlo approaches, appears to be manageable with DiagMC. Starting with a general introduction to the principles of DiagMC, we present a detailed description of the DiagMC scheme for interacting fermions (Hubbard model), as well as the first illustrative results for the equations of state.
Diagrammatic Monte Carlo (DiagMC) is a numeric technique that allows one to calculate quantities specified in terms of diagrammatic expansions, the latter being a standard tool of many-body quantum statistics. The sign problem that is typically fatal to Monte Carlo approaches, appears to be manageable with DiagMC. Starting with a general introduction to the principles of DiagMC, we present a detailed description of the DiagMC scheme for interacting fermions (Hubbard model), as well as the first illustrative results for the equations of state.
The study of lattice gauge theories with Monte Carlo simulations is hindered by the infamous sign problem that appears under certain circumstances, in particular at non-zero chemical potential.So far, there is no universal method to overcome this problem.However, recent years brought a new class of non-perturbative Hamiltonian techniques named tensor networks, where the sign problem is absent.In previous work, we have demonstrated that this approach, in particular matrix product states in 1+1 dimensions, can be used to perform precise calculations in a lattice gauge theory, the massless and massive Schwinger model.We have computed the mass spectrum of this theory, its thermal properties and real-time dynamics.In this work, we review these results and we extend our calculations to the case of two flavours and non-zero chemical potential.We are able to reliably reproduce known analytical results for this model, thus demonstrating that tensor networks can tackle the sign problem of a lattice gauge theory at finite density.
The study of lattice gauge theories with Monte Carlo simulations is hindered by the infamous sign problem that appears under certain circumstances, in particular at non-zero chemical potential. So far, there is no universal method to overcome this problem. However, recent years brought a new class of non-perturbative Hamiltonian techniques named tensor networks, where the sign problem is absent. In previous work, we have demonstrated that this approach, in particular matrix product states in 1+1 dimensions, can be used to perform precise calculations in a lattice gauge theory, the massless and massive Schwinger model. We have computed the mass spectrum of this theory, its thermal properties and real-time dynamics. In this work, we review these results and we extend our calculations to the case of two flavours and non-zero chemical potential. We are able to reliably reproduce known analytical results for this model, thus demonstrating that tensor networks can tackle the sign problem of a lattice gauge theory at finite density.
This thesis is devoted to the development of numerical methods for correlated electrons in realistic systems based on perturbation theories using Feynman diagrams. Electron correlations in realistic systems give rise to a wide range of interesting physical properties. Diagrammatic expansions and its low-order approximations are key building blocks of theoretical and numerical methods for studying correlated electrons. Recent developments of the diagrammatic quantum Monte Carlo (DiagMC) methods enable efficient stochastic evaluations of diagrams and does not suffer from numerical sign problem which worsens with increasing system size. It is therefore a promising direction to apply DiagMC techniques to realistic electron systems in the pursuit of ab initio calculations of correlated materials. This thesis starts by reviewing basic concepts and definitions of realistic electron systems, the perturbation theory based on Feynman diagrams, Monte Carlo evaluations of the series, as well as self-consistent diagrammatic methods. Low-order diagrammatic methods are applied to realistic calculations and benchmarked against large collections of state-of-the-art many-body methods. The thesis then proposes a diagrammatic Monte Carlo solver for realistic molecules and impurities based on a recursive evaluation of diagrams, which is tested on realistic molecules and impurities with varying temperature, system size, and interaction strength. We observe that this method is ideal for problems with many orbitals with moderate correlations, but may suffer from series divergence at strong correlations. Next, we propose the inchworm Monte Carlo algorithm for interaction expansion, which overcomes limitations of divergent diagrammatic series by replacing the standard perturbation series with a sequence of incremental series expansions. A prototype implementation is presented for system with on-site Hubbard interactions. Finally, we discuss technical aspects of numerical representations of the Green's function, which has significant impact on the efficiency of diagrammatic methods. We review several common numerical representations, and introduce our development of the sparse sampling method, which provides compact representations of the Green's function in both imaginary time and frequency as well as fast transformation formula between the two.
Using a dual representation of lattice fermion models that is based on spin-charge transformation and fermionization of the original description, I derive an algorithm for diagrammatic Monte Carlo simulation of strongly correlated systems. This scheme allows eliminating large expansion parameters, as well as large corrections to the density matrix that generally prevent diagrammatic methods from being efficient in this regime. As an example, I compute the filling factor for the Hubbard model at infinite on-site repulsion and compare the results to controllable data obtained from numerical linked-cluster expansion. I find excellent agreement between the two methods, as well as rapid convergence of the diagrammatic series. I also report results for the momentum distribution and kinetic energy of the electrons.