2017
DOI: 10.1103/physrevlett.119.045701
|View full text |Cite
|
Sign up to set email alerts
|

Determinant Diagrammatic Monte Carlo Algorithm in the Thermodynamic Limit

Abstract: We present a simple trick that allows 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, 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, grea… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
161
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 118 publications
(163 citation statements)
references
References 29 publications
1
161
0
Order By: Relevance
“…The control parameters of the calculations are most commonly the lattice size and the maximal perturbation order. Some algorithms [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16] are very efficient for small systems but have not yet reached very large lattice sizes, while others [17][18][19][20][21][22][23][24] can address the thermodynamic limit directly but are limited in the number of perturbation orders that can be computed.…”
Section: Introductionmentioning
confidence: 99%
“…The control parameters of the calculations are most commonly the lattice size and the maximal perturbation order. Some algorithms [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16] are very efficient for small systems but have not yet reached very large lattice sizes, while others [17][18][19][20][21][22][23][24] can address the thermodynamic limit directly but are limited in the number of perturbation orders that can be computed.…”
Section: Introductionmentioning
confidence: 99%
“…The sum of all connected diagrams c ii oo (V ) can then be found by a recursive subtraction of disconnected topologies following Ref. [36],…”
mentioning
confidence: 99%
“…Recent developments in imaginarytime diagrammatic QMC also achieved, through an iterative procedure, the cancellation of vacuum (and, later on, non oneparticle irreducible) diagrams at every Monte Carlo step at an exponential cost in the perturbation order. [38][39][40]…”
Section: B Cancellation Of Vacuum Diagrams When Summing Over Keldyshmentioning
confidence: 99%
“…At a given perturbation order n, its key idea is to regroup a factorial number of Feynman dia-grams in a sum over Keldysh indices of 2 n determinants. This exponential sum has been shown to cancel vacuum diagrams, a property also used in recent diagrammatic QMC methods in imaginary-time [38][39][40] . As a direct consequence, the Monte Carlo sampling only involves interaction times in a neighborhood around the measurement time t max : we talk about the clusterization of times.…”
Section: Introductionmentioning
confidence: 99%