Fermionic Sign Structure of High-order Feynman diagrams in a Many-fermion System
Abstract
The sign cancellation between scattering amplitudes makes fermions different from bosons. We systematically investigate Feynman diagrams’ fermionic sign structure in a representative many-fermion system—a uniform Fermi gas with Yukawa interaction. We analyze the role of the crossing symmetry and the global gauge symmetry in the fermionic sign cancellation. The symmetry arguments are then used to identify the sign-canceled groups of diagrams. Sign-structure analysis has two applications. Numerically, it leads to a cluster diagrammatic Monte Carlo algorithm for fast diagram evaluations. The new algorithm is about times faster than the conventional approaches in the sixth order. Furthermore, our analysis provides important hints in constructing the relevant effective field theory for many-fermion systems.
I Introduction
In quantum mechanics, the amplitudes of fermion-fermion scattering satisfy an anti-commutation relation: permuting two incoming (or outgoing) fermions flips the amplitude’s global sign. On the one hand, the sign cancellation plays a vital role in the collective behavior of fermions (For example, it leads to the electron degeneracy pressure which prevents matter from collapsing into a single nucleusDyson and Lenard (1967); Lenard and Dyson (1968)). On the other hand, the same sign cancellation leads to the notorious sign problem in Monte Carlo simulations of many-fermion systems Loh et al. (1990); Troyer and Wiese (2005). Indeed, a Monte Carlo estimator of physical observable is a sum of various elementary scattering amplitudes. Even if each amplitude is precisely calculated, the sign-canceled signal can be easily overwhelmed by numerical noise. This paper explores the sign structure of scattering amplitudes in Feynman diagrams to better understand the fermionic sign cancellation.

In many-body physics, Feynman diagrams describe how excitations in the system scatter incoming particles. The diagram amplitude, namely the scattering amplitude, is obtained by summing all diagram topologies and integrating all internal space-time variables (where the excitations get created and annihilated). Both steps involve massive sign cancellations so that the physical scattering amplitude is merely a small fraction of the total diagram weights. Here we use an example to illustrate the non-triviality of this problem. We consider a two-dimensional homogeneous “electron gas” with Yukawa interaction (see Sec.II for the definition of the Hamiltonian). We calculate four diagrams (see Fig. 1), which are the third-order contributions to the polarization (namely, the system’s linear response function with respect to a screened external electric field perturbation). They all involve a virtual particle-hole pair but with different topologies. As shown in Fig.1, their amplitudes are functions of the external imaginary-time. Four diagrams strongly cancel each other: the summed polarization (the thick black line) is merely of individual diagrams. Later we show such cancellation is a direct consequence of the emergent charge conservation law in this diagram group—while each diagram is time-dependent, their sum turns out to be a constant of motion, reflecting the conservation of total charge in this system.
The above example leads to fundamental questions we want to address: How does the cancellation occur in diagrams? Does it originate from the summation of topologies or the integration of internal variables? Can one identify the diagram groups that feature massive sign cancellations? Concrete answers to the above questions are important at least in two aspects: i) In fermionic systems, individual-diagram-based power-counting estimation could be misleading in many cases due to the cancellations in diagrams. The sign-canceled-group-based estimation fixes this problem (See. Ref. Belitz et al. (1997) and Fig.1 for examples). ii) Numerically, the knowledge of sign-canceled diagram groups alleviates the sign problem in Monte Carlo techniques, particularly the diagrammatic Monte Carlo methods Prokof’ev and Svistunov (1998). In this approach, one calculates the physical observable in terms of diagrammatic expansions with Monte Carlo samplings. The methods have been applied to solve a series of important problems in the Hubbard model Kozik et al. (2010); Gukelberger et al. (2014); Deng et al. (2015); Wu et al. (2017); Šimkovic et al. (2017); Moutenet et al. (2018); Taheridehkordi et al. (2019); Šimkovic and Kozik (2019); Vučičević and Ferrero (2020); Kim et al. (2020), many-electron problem Van Houcke et al. (2012, 2019); Rossi et al. (2018a, b), Fermi polaron problem Prokof’ev and Svistunov (1998); Mishchenko et al. (2000); Prokof’ev and Svistunov (2008a, b); Kroiss and Pollet (2014); Mishchenko et al. (2014); Hahn et al. (2018); Mishchenko et al. (2019); Van Houcke et al. (2020) and frustrated spin systems Kulagin et al. (2013a, b); Huang et al. (2016). The conventional approaches stochastically sample individual diagrams and therefore suffer from the severe sign problem caused by the massive sign cancellation between the diagrams. Recently, a new generation of the algorithms, which sample the summed weight of groups of diagrams, has been developed Rossi (2017); Rossi et al. (2018a); Chen and Haule (2019); Taheridehkordi et al. (2020a); Vučičević and Ferrero (2020). We will refer them to cluster DiagMC algorithms. With the proper grouping of the diagrams, those algorithms can dramatically reduce the sign problem. Indeed, a couple of cluster DiagMC algorithms are reported to be applicable on much higher-order diagrams Rossi (2017), or in problems beyond the ability of the conventional approachesChen and Haule (2019); Taheridehkordi et al. (2020a, b). Despite the impressive progress, we still lack the design principle on diagrammatic groups to minimize the sign problem.
In this paper, we investigate two universal mechanisms of the sign cancellation, one of which is imposed by the crossing symmetry of the two-body scattering. The other is imposed by the global symmetry or the charge conservation law, as previously discussed. We show that the symmetries constrain the sign-canceled diagram groups’ structure and fix the internal variables’ arrangements. We numerically test the idea by calculating the diagrams up to the sixth order for a representative many-fermion system—the uniform Fermi gas with Yukawa interaction. We observe massive sign cancellations in the high-order diagrams and find a significant portion of the overall cancellation originates from the summation of topologies. We then utilize the grouping scheme to formulate a highly efficient cluster DiagMC algorithm. Compared with the conventional approaches, our new algorithm improves the efficiency by at the sixth order.
We have made three contributions in this paper: i) We prove that in the imaginary-time and momentum representation, the charge conservation law is a topological property of Feynman diagrams. We then clarify its essential role in the diagrammatic sign structure. ii) We develop the protocol to quantify the sign cancellations from different mechanisms in high-order diagrams. It enables a systematic investigation of the sign-cancellation effects caused by the two symmetries. iii) A more efficient cluster DiagMC algorithm is proposed. Thanks to the symmetry analysis, we can optimize the grouping scheme systematically. The sign problem considerably is significantly alleviated as compared to the algorithm proposed in Ref.33.
We now sketch the content of the paper and outline how it is organized. In Sec. II, we describe a two-dimensional uniform Fermi gas with Yukawa potential, which is used to quantitatively investigate Feynman diagrams’ sign structure. In Sec. III, we mathematically formulate the concepts of overall and topological sign cancellation. We also clarify the relation between the topological sign cancellation and the efficiency of a typical cluster DiagMC algorithm. Sec. IV and V are dedicated to crossing symmetry and global symmetry induced sign cancellations. The topological sign cancellation and efficiency of the cluster DiagMC are quantitatively investigated. Finally, we outline our conclusions and discuss the outlook for future development and applications in Sec. VI.
II Interacting fermions model

To study the sign structure of Feynman diagrams at a quantitative level, we consider a representative model, which is a 2D uniform spin-polarized interacting Fermi gas described by the Hamiltonian,
(1) |
where is the creation (annihilation) operator of a fermion with momentum , is the kinetic energy shifted with the chemical potential . is the Yukawa interaction between fermions with the electric charge and the static screening length. The fermions in this model can be understood as the electrons with a renormalized Coulomb interactionChen and Haule (2019). We adapt the natural units . With a given screening length and temperature , the physics of the system is controlled by the characteristic length scale, namely the Wigner–Seitz radius with the density of the fermions.
Hereby we focus on the physical observable polarization , which is the linear response function of the system with respect to a screened external electric field. It is closely related to the dielectric function, Pauli spin susceptibility and charge compressibility of the system Giuliani and Vignale (2005). More specifically, one couples the system to a small external electric field ,
(2) |
where is the charge density operator. We assume the external electric field doesn’t change with the time since we are mainly interested in the static polarization. The generating functional for the connected correlation function is the grand potential of the system . In particular, the two particle correlation function (charge susceptibility) is given by,
(3) |
where the indexes and are the spatial coordinates of the external perturbation. The polarization is the charge response function with respect to the screened external electric field, rather than the original field . It can be derived from the charge susceptibility,
(4) |
When the fermionic interaction is relatively weak, the polarization can be effectively calculated with the Feynman diagrammatic technique. One first performs a double power expansion of the generating functional in both and , then derives the power series of the charge susceptibility using Eq.(3). Each term in the power series can be vividly represented by a Feynman diagram. They are connected diagrams composed of bare propagator lines and bare interaction lines. All of them have two external vertices connecting two external perturbations. In the end, the polarization diagrams can be derived from the charge susceptibility diagrams using Eq.(4). Diagrammatically, it means one should exclude all reducible diagrams that would fall into two pieces if one interaction line were cut off. We show some of the first two orders of polarization diagrams in Fig. 2. We use the momentum and imaginary-time representation so that all diagram weights are real-valued.
To further improve the convergence of the diagrammatic series, we replace each bare Green’s function line in the diagrams with the renormalized Green’s function which resumes the Hatree-Fock self-energy,
(5) |
where with the Hatree-Fock self-energy which doesn’t depend on the imaginary-time. To avoid double-counting in the diagrammatic series, all diagrams which contain at least one Hatree-Fock sub-diagram are removed.

In our numerical calculation, we fine-tune the chemical potential so that the Fermi momentum of the Green’s function Eq. 5 matches , where the spin factor and the radius . As one includes higher-order quantum corrections, we expect the Fermi momentum, as well as the Wigner–Seitz radius, get renormalized. Therefore, both and should be slightly different from the actual physical values. It does not affect the claims in this paper. At the temperature , we calculate static polarization diagrams up to order . The result is shown in Fig. 3. With the above parameters, we observe exponential convergence with the truncated diagram order.
III Overall and Topological Sign Cancellation
This section quantifies the concepts of overall and topological sign cancellation in Feynman diagrams. We also clarify the connection between topological sign cancellation and cluster diagrammatic Monte Carlo algorithms’ efficiency.
We consider a diagrammatic series for a positively defined physical quantity (for example, the polarization Eq.(4)),
(6) |
where is the weight of an -th order diagram with a topological index and a set of internal variables (in this paper, they are the internal momenta and imaginary times). Due to the sign cancellation between diagrams, we expect to be much smaller than the weight function,
(7) |
where sums the absolute weight of the diagrams.
We numerically calculate the ratio , where is the power series of the polarization in Fig.4. As shown in the red curve in Fig.4, we find this ratio roughly exponentially decays to zero with increasing orders, indicating massive sign cancellations. As a result, while the absolute weight function factorially diverge (the number of Feynman diagrams diverge as ), the sign-canceled net contribution to the polarization exponentially converges. In literature, this effect is referred as the sign blessing Prokof’ev and Svistunov (2008a). In what follows, we will define the overall sign cancellation as the ratio .
We expect a significant amount of the overall sign cancellation can be traced back to the sign cancellation between different diagram topologies before the internal variables are integrated out. To measure the topological sign cancellation, one should classify the diagrams into sign-canceled topological clusters , then calculate the absolute weight of the clusters rather than individual diagrams,
(8) |
This weight function satisfies an exact inequality,
(9) |
Of course, the magnitude of strongly depends on the choice of the topological cluster and the arrangement of internal variables. Our overall goal is to find the optimized topological clusters to make as small as possible. We calculate the ratio for the polarization using the clustering scheme discussed in the following section. As shown in the blue curve in Fig.4, we find the ratio , indicating a significant amount of the overall sign cancellation indeed has a topological origin.

Now we discuss the relation between the above weight functions and the efficiency of DiagMC algorithms. In conventional diagrammatic Monte Carlo approaches Prokof’ev and Svistunov (1998); Prokof’ev and Svistunov (2008a); Van Houcke et al. (2010); Kozik et al. (2010); Van Houcke et al. (2012); Deng et al. (2015), the weight function Eq.(7) is treated as the weight of the configuration space spanned by the toplogies, the internal variables as well as the order of diagrams. It defines a probability density, , which can be efficiently sampled with a Metropolis algorithm. Supplemented with a normalization scheme, one can use the Monte Carlo estimator to calculate diagram weight .
In contrast to the conventional algorithm, the recent cluster algorithms Rossi (2017); Rossi et al. (2018a); Chen and Haule (2019); Taheridehkordi et al. (2020a) propose to use the weight function Eq.(8) instead of Eq.(7). It is reported that the sign problem is greatly alleviated. We derive the following relation to explain such observation,
(10) |
The detailed derivation is presented in Appendix References. Here is the number of Monte Carlo samples, is the statistical absolute error in a typical set up of DiagMC algorithm, and is the weight of the configuration space. To achieve the desired relative accuracy, the number of the samples should be proportional to the squared ratio . Therefore, the smaller , the less sign problem. Indeed, the conventional DiagMC choose , while the cluster algorithms choose . we expect the latter improves the efficiency by a factor,
(11) |
To achieve better efficiency, one should minimize the weight function . Of course, this is quite challenging in general. In fact, we find that a randomly picked arrangement of internal variables can hardly improve the sign problem, namely . To make small, one has to carefully group the topology of diagrams and arrange the internal variables, so that the diagrams with similar topologies maximally cancel with each other before the integration of internal variables . Thus, we are motivated to explore the underlying mechanism of the topological sign cancellation in the next two sections.
IV Topological Sign Cancellation
In this section, we explore how different symmetries lead to the topological sign cancellation between Feynman diagrams. We focus on two most common symmetries: the crossing symmetry in the two-fermion scattering amplitudes, and the global gauge symmetry associated with the charge conservation.
IV.1 Crossing-Symmetry induced Sign cancellation

We first discuss the crossing symmetry, which means that the direct and exchange parts of the two-fermion scattering amplitude must be anti-symmetric. It indicates massive sign cancellations when the two incoming fermions have similar momenta and frequencies. Fig. 5a is the elementary event of the model Eq. (1), where two fermions directly interact through the bare Yukawa interaction. For a given Feynman diagram with interactions, each interaction line has its direct or exchange contributions. The combination defines a topological group of similar or equivalent Feynman diagrams (some may not be polarization diagrams and must be excluded). We expect a massive sign cancellation in the group. In literature Hugenholtz (1965), the combined direct and exchange interactions are labeled as a single vertex, and the above topological group of Feynman diagrams is referred to as a Hugenholz diagram. Fig.5b gives a second-order example.
The weight function which quantifies the crossing-symmetry induced sign cancellation is given by,
(12) |
where is the amplitude of an -order Feynman diagram belonging to the same Hugenholz topology . The cancellation ratio is shown in Fig.5c. We observe an approximately exponential trend of topological sign cancellation as the diagram order increases.
The massive sign cancellation between Feynman diagrams with the same Hugenholz topology can be used to alleviate the sign problem in the conventional DiagMC algorithmChen and Haule (2019). As explained in Sec.V, one can implement a cluster DiagMC algorithm that samples the Hugenholtz diagrams instead of the Feynman diagrams. In calculations of the polarization for Eq.(1), this trick improves the efficiency by a factor , which is depicted in the inset of Fig.5c.
In the end, we would like to discuss the crossing-symmetry-induced sign cancellation between the high-order scattering amplitudes. They are fermion-fermion scattering mediated by the exctations of the system. Diagrammatically, they are -point vertex function with internal structures. Due to the crossing symmetry, permuting two outgoing (or two incoming) legs of the vertex flips the entire diagram’s sign. Therefore, it also makes sense to cluster the diagrams associated with this high-order crossing symmetry. Interestingly, we find that the rule is given by the parquet equations Diatlov et al. (1957); Roulet et al. (1969); Bickers (2004). Physically, the parquet equations are a non-perturbative technique to self-consistently calculate a two-particle vertex function from the irreducible vertex functions. However, there is also a perturbative interpretation: they provide a set of recursive rules to build higher-order vertex diagrams out of lower-order sub-vertex diagrams. The generated diagrams are automatically organized in a hierarchy of -point vertex (sub-)diagrams. Each (sub-)diagram consists of direct or exchange contributions which greatly cancel with each other. It is also possible to generalize the crossing-symmetry clustering for the two-particle scattering to particles. One then needs to use the Dyson-Schwinger equations Dyson (1949); Schwinger (1951) instead of the parquet equations.
IV.2 -Symmetry-Induced Sign Cancellation

The action of the model (1) is invariant under the global transformation , where is a space-time independent phase. This global symmetry, sometimes referred to as the global gauge symmetry, guarantees the conservation of charge (or particle number). It is a property shared by many quantum systems.
We argue that the total charge conservation leads to a massive overall sign cancellation between diagrams in the introduction. Does such cancellation originate from the summation of diagram topologies? We will approach this problem in two steps: we first show that in the imaginary-time representation, the charge conservation law is a topological property of diagrams, which means that it can be implemented before integrating out the internal variables. We then show that the conserving diagrams inevitably leads to massive topological sign cancellation.
Baym and Kadanoff developed a program to construct conserving approximations using the functional-derivative approachBaym and Kadanoff (1961, 1961). They showed that any diagrammatic truncation of the generating functional (such as in Eq.(3)) fulfills a set of conservation laws. Taking the derivative of such functional then generates conserving approximations for correlation functions. Their theory explains the emergent charge conservation law in the four polarization diagrams in Fig.1: they are all functional derivatives of the same vacuum diagram, as shown in Fig.6 (a). The derivative of the vacuum diagram with respect to () splits a Green’s function into two (The same for ). Such operation inserts an external vertex () in the Green’s function line. Since the external vertices carry zero momentum for the uniform polarization, the derivatives will not change the internal momenta (the colored loops in Fig.6a). For some vacuum diagrams, the above operations may generate several copies of the same polarization diagrams. However, they have different momentum-loop arrangements and should be kept to maximize the sign cancellation.
The Baym-Kadanoff theory is about the charge conservation of the overall weight of the polarization diagrams. In the imaginary-time and momentum representation, we find that the conservation is already implemented at the diagram topologies level before any explicit integration of the internal variables. This property is crucial for understanding the symmetry-induced sign cancellation but is far from obvious. Here we provide a constructive proof of the total charge conservation. A similar approach has been used to prove the Ward identity in quantum electrodynamics in the frequency representationPeskin (2018).

We consider a fermion loop with interaction legs as shown in Fig. 7(a). It is the elementary building block of all high-order Feynman diagrams. For example, the polarization diagrams in Fig. 6 (a) all can be decomposed into two fermion loops. All internal momentum variables and imaginary-time variables should not be integrated out. The variables are in the interval and are unequal to each other. We now pick one Green’s function and insert an external vertex with a given momentum and imaginary-time . Note that is the external time, which evolves from to . The operation generates diagrams. Later, we will show that this is the minimal topological cluster to implement the total charge conservation law. This statement is nontrivial because an individual diagram, as the one in Fig.7(a), violates the total charge conservation.
Without loss of generality, we may choose an arbitrary time order for the internal time variables, as in Fig.7(b). If one inserts the external vertex between the vertices and , the two Green’s functions contribute a weight factor,
(13) | ||||
where or , depending on the ordering of , and . It is clear that the diagram weight cannot be a constant of motion as the external time evolves from to .
We next show that the summed weight of all diagrams is independent of the time evolution of , thus obeys the charge conservation. We consider the weight
(14) | ||||
Using Eq.(13) and the fact that always contains despite the time ordering, we derive
(15) | ||||
where the integer constant is the number of backward-propagating Green’s functions, and the index sums over all Green’s functions. Both quantities should be counted with the fermion loop in the absence of the external vertex . It is therefore independent of evolution.
To prove Eq.(15), one may start with so that is larger than all internal imaginary-time variables. One can calculate the factor using the first two conditions in Eq.(13). We then prove that this factor does not change as decreases from to . Without loss of generality, we assume is the largest among the remaining time variables. As evolves from to , the weight of and abruptly changes. However, their combined weight remains the same, since two Green’s functions must propagate in the opposite temporal direction. As further decreases, intersects with Green’s functions, which are always paired. As a result, the combined weight never changes. We thus conclude that the summed weight of diagrams must be a constant of motion as in Eq.(15). The derivation can also be generalized to generic charge conservation law with .

How does the charge conservation lead to the topological sign cancellation? We show it with an inspiring example. Consider the fermion loop and assume . Most of the diagram weights are associated with small momenta on interaction lines. For clarity, we will simply set all interaction momenta to be zero. This fixes the internal momenta so that is the only variable in the system.
Inserting the external vertex ( not equal to and ) generates two diagrams and , which have weights , and . The summed weight is thus . It is independent of the external time as expected.
We now study the sign cancellation in these two diagrams. With the definition in Sec. III, the physical, cluster and absolute weight functions are given by
(16) | ||||
(17) | ||||
(18) |
In Fig. 8, we plot three integrands as functions of the momentum . Two mechanisms of sign cancellation are observed. The first is the cancellation caused by different diagram topologies. It implies . The second mechanism is implied by the anti-symmetric structure of near the Fermi momentum. It indicates the physical weight since is further suppressed by momentum symmetrization operation . Both are responsible for the small constant of motion in Fig.1.
Similar to the case of crossing symmetry, the -symmetry-induced sign cancellation is also useful to reduce the sign problem in the conventional DiagMC algorithmChen and Haule (2019). In the next Sec.V, we provide the protocol to classify Hugenholtz diagrams into conserving groups. In this algorithm, one samples the diagrams with the weight function,
(19) |
where is the amplitude of Feynman diagrams generated from Hugenholtz topology which belong to the conserving group . Since each group in this scheme respects the topological conservation law as defined in Eq.(14), we expect . Indeed, with the polarization of the model (1), as shown in Fig.4(b), we find this ratio decays approximately exponentially with diagram orders. Compared to the Monte Carlo scheme with Hugenholtz diagrams, the new scheme further improves the efficiency by a factor as shown in the inset of Fig.5b. Combining the Hugenholtz and conserving grouping schemes, the overall efficiency gain compared to the conventional DiagMC is the factor . We plot this quantity in the inset of Fig.4. At the order , we find this factor is of the magnitude . Note that in our algorithm, we have not incorporated the momentum symmetrization operation, as discussed in Fig.8. We expect that it will further alleviate the sign problem, and we plan to implement it in future publications.
V Cluster Diagrammatic Monte Carlo Algorithm
V.1 Diagram Grouping
Here we summarize the algorithm to group the diagrams. To ensure massive sign cancellation, one must choose proper topologies as well as internal variables. We will follow the symmetry arguments proposed in the previous section to achieve this goal. We illustrate the key steps as follows:
i) Generate all order- Hugenholtz vacuum diagrams for the generating functional. A fast algorithm is developed in Ref Tag and Khène (2017). For each vacuum diagram, one then labels time variables and chooses independent momentum loops. An example of a second-order diagram can be found in Fig. 6 (a), where we label the independent momentum loops with different colors and the imaginary-time variables with numbers. All diagrams must share the same set of variables so that they can be sampled altogether by a Monte Carlo algorithm. To maximize efficiency, it is also essential to choose all loop variables to be fermionic. The main contributions of all integrals come from a thin shell near the Fermi momentum.
ii) For each order- vacuum diagram, we generate a group of order- polarization diagrams featuring both the global symmetry and the crossing symmetry (if possible). This is achieved in two steps: one first inserts two external vertices and to the Green’s functions in the vacuum diagram in all possible ways, as shown in Fig. 6 (a). One then expands each Hugenholtz diagram into Feynman diagrams, meanwhile, eliminates one-interaction-reducible diagrams. In both steps, the derived diagram inherits the internal-variable arrangement of the parent diagram (In the first step, one may need to add one external momentum loop variable if transfer momentum between two external vertices is nonzero).
We symmetrize the external vertices and , which reduces the diagram number by two. Nevertheless, the above operations may generate multiple copies with the same topology but the different internal-variable arrangement, as shown in Fig. 6 (a). Those copies are required by the symmetry and the conservation law.
In the end, we point out that the above scheme achieves better sign cancellation than the scheme proposed in Ref.Chen and Haule (2019). One of the most significant differences is that the previous scheme only keeps one copy for each topology, thus violating the symmetry and resulting in considerably less topological sign cancellation.
V.2 Monte Carlo Algorithm
We will only briefly explain the protocol because we use the standard Monte Carlo integration algorithm to calculate the diagram weights.
The configuration space in our algorithm consists of the diagram order , imaginary-time variables and momentum loop variables. The probability density of the order contribution is given by the weight function,
(20) |
where represents all internal variables, and is the amplitude of an -order Feynman diagram belonging to the Hugenholz topology , and is the collection of order conserving groups.
To normalize the integral, we also include a special zeroth order “diagram”,
(21) |
which is simply a normalization constant without any internal variables.
The minimal set of Monte Carlo updates includes three operations: increase or decrease diagram order by one (add or remove a pair of internal variables), and randomly select an internal variable to update. The standard Metropolis algorithm is used for the acceptance probability. By adjusting the re-weighting factor of each order, we find all updates are quite efficient.
A detailed discussion of the statistical error-bar estimation is given in Appendix References.
VI conclusion
In conclusion, we reveal the fermionic sign structure of high-order Feynman diagrams constrained by the crossing symmetry and the charge conservation law, which are two universal features of many-fermion systems. As a by-product, we prove that the charge conservation law is a topological property of Feynman diagrams in the imaginary-time/momentum representation. With modern numerical techniques, we investigate the significance of sign cancellations from the crossing symmetry and the conservation law.
The diagrammatic sign structure knowledge is used to optimize the internal-variable arrangements and construct the sign-canceled diagram groups. We then propose a cluster Diagrammatic Monte Carlo algorithm, which samples the sign-canceled diagram groups instead of individual diagrams. Compared to the conventional algorithm, we achieve an efficiency boost up to a factor at the diagram order .
Besides the numerical application, identifying the sign-canceled groups provides important hints in constructing the relevant perturbative effective field theory of many-fermion systems. The diagrams in Fig.1, which forms a sign-canceled group, provides a particularly relevant example. The massive sign cancellation between those diagrams results in an emergent “unreasonably” small number, invalidating the conventional power-counting argument. It indicates that the relevance of perturbation in fermionic systems is better discussed in the context of sign-canceled groups rather than individual diagrams.
In the end, we summarize open questions for future work. There are questions associated with the charge conservation law in the topological structure of diagrams. Are there similar properties for other conservation laws (e.g., energy, momentum, and angular momentum)? Does the type of internal variables (space versus momentum, time versus frequency) matter? One probably needs to formulate a stronger version of the celebrated Baym-Kadanoff theory to address the above questions. There are also technical problems. For example, in Sec.IV.2, we point out that the momentum symmetrization operation leads to a significant sign cancellation as indicated by Fig. 8. However, it is not clear how to implement it in the Monte Carlo algorithm to alleviate the sign problem.
Acknowledgements.
The authors would like to thank Nikolay Prokof’ev, Boris Svistunov, and Zhiyuan Yao for stimulating discussion and important input. B.-Z. Wang, P.-C. Hou and Y. Deng were supported by the National Natural Science Foundation of China (under Grant No. 11625522) and by the National Key R&D Program of China (under Grants No. 2016YFA0301604 and No. 2018YFA0306501). K. Chen was supported by the Simons Collaboration on the Many Electron Problem and K. Haule was supported by NSF DMR-1709229.References
- Dyson and Lenard (1967) F. J. Dyson and A. Lenard, Journal of Mathematical Physics 8, 423 (1967).
- Lenard and Dyson (1968) A. Lenard and F. J. Dyson, Journal of Mathematical Physics 9, 698 (1968).
- Loh et al. (1990) E. Y. Loh, J. E. Gubernatis, R. T. Scalettar, S. R. White, D. J. Scalapino, and R. L. Sugar, Phys. Rev. B 41, 9301 (1990).
- Troyer and Wiese (2005) M. Troyer and U.-J. Wiese, Phys. Rev. Lett. 94, 170201 (2005).
- Belitz et al. (1997) D. Belitz, T. R. Kirkpatrick, and T. Vojta, Physical Review B 55, 9452 (1997).
- Prokof’ev and Svistunov (1998) N. V. Prokof’ev and B. V. Svistunov, Phys. Rev. Lett. 81, 2514 (1998).
- Kozik et al. (2010) E. Kozik, K. V. Houcke, E. Gull, L. Pollet, N. V. Prokof’ev, B. V. Svistunov, and M. Troyer, EPL 90, 10004 (2010).
- Gukelberger et al. (2014) J. Gukelberger, E. Kozik, L. Pollet, N. V. Prokof’ev, M. Sigrist, B. V. Svistunov, and M. Troyer, Phys. Rev. Lett. 113, 195301 (2014).
- Deng et al. (2015) Y. Deng, E. Kozik, N. V. Prokof’ev, and B. V. Svistunov, EPL 110, 57001 (2015).
- Wu et al. (2017) W. Wu, M. Ferrero, A. Georges, and E. Kozik, Phys. Rev. B 96, 041105 (2017).
- Šimkovic et al. (2017) F. Šimkovic, Y. Deng, N. V. Prokof’ev, B. V. Svistunov, I. S. Tupitsyn, and E. Kozik, Phys. Rev. B 96, 081117 (2017).
- Moutenet et al. (2018) A. Moutenet, W. Wu, and M. Ferrero, Phys. Rev. B 97, 085117 (2018).
- Taheridehkordi et al. (2019) A. Taheridehkordi, S. H. Curnoe, and J. P. F. LeBlanc, Phys. Rev. B 99, 035120 (2019).
- Šimkovic and Kozik (2019) F. Šimkovic and E. Kozik, Phys. Rev. B 100, 121102 (2019).
- Vučičević and Ferrero (2020) J. Vučičević and M. Ferrero, Phys. Rev. B 101, 075113 (2020).
- Kim et al. (2020) A. J. Kim, F. Simkovic, and E. Kozik, Phys. Rev. Lett. 124, 117602 (2020).
- Van Houcke et al. (2012) K. Van Houcke, F. Werner, E. Kozik, N. V. Prokof’ev, B. V. Svistunov, M. Ku, A. Sommer, L. Cheuk, A. Schirotzek, and M. Zwierlein, Nature Physics 8, 366 (2012).
- Van Houcke et al. (2019) K. Van Houcke, F. Werner, T. Ohgoe, N. V. Prokof’ev, and B. V. Svistunov, Phys. Rev. B 99, 035140 (2019).
- Rossi et al. (2018a) R. Rossi, T. Ohgoe, K. Van Houcke, and F. Werner, Phys. Rev. Lett. 121, 130405 (2018a).
- Rossi et al. (2018b) R. Rossi, T. Ohgoe, E. Kozik, N. V. Prokof’ev, B. V. Svistunov, K. Van Houcke, and F. Werner, Phys. Rev. Lett. 121, 130406 (2018b).
- Mishchenko et al. (2000) A. S. Mishchenko, N. V. Prokof’ev, A. Sakamoto, and B. V. Svistunov, Phys. Rev. B 62, 6317 (2000).
- Prokof’ev and Svistunov (2008a) N. V. Prokof’ev and B. V. Svistunov, Phys. Rev. B 77, 020408 (2008a).
- Prokof’ev and Svistunov (2008b) N. V. Prokof’ev and B. V. Svistunov, Phys. Rev. B 77, 125101 (2008b).
- Kroiss and Pollet (2014) P. Kroiss and L. Pollet, Phys. Rev. B 90, 104510 (2014).
- Mishchenko et al. (2014) A. S. Mishchenko, N. Nagaosa, and N. V. Prokof’ev, Phys. Rev. Lett. 113, 166402 (2014).
- Hahn et al. (2018) T. Hahn, S. Klimin, J. Tempere, J. T. Devreese, and C. Franchini, Phys. Rev. B 97, 134305 (2018).
- Mishchenko et al. (2019) A. S. Mishchenko, L. Pollet, N. V. Prokof’ev, A. Kumar, D. L. Maslov, and N. Nagaosa, Phys. Rev. Lett. 123, 076601 (2019).
- Van Houcke et al. (2020) K. Van Houcke, F. Werner, and R. Rossi, Phys. Rev. B 101, 045134 (2020).
- Kulagin et al. (2013a) S. A. Kulagin, N. V. Prokof’ev, O. A. Starykh, B. V. Svistunov, and C. N. Varney, Phys. Rev. Lett. 110, 070601 (2013a).
- Kulagin et al. (2013b) S. A. Kulagin, N. V. Prokof’ev, O. A. Starykh, B. V. Svistunov, and C. N. Varney, Phys. Rev. B 87, 024407 (2013b).
- Huang et al. (2016) Y. Huang, K. Chen, Y. Deng, N. V. Prokof’ev, and B. V. Svistunov, Phys. Rev. Lett. 116, 177203 (2016).
- Rossi (2017) R. Rossi, Phys. Rev. Lett. 119, 045701 (2017).
- Chen and Haule (2019) K. Chen and K. Haule, Nature Communications 10 (2019).
- Taheridehkordi et al. (2020a) A. Taheridehkordi, S. H. Curnoe, and J. P. F. LeBlanc, Phys. Rev. B 101, 125109 (2020a).
- Taheridehkordi et al. (2020b) A. Taheridehkordi, S. H. Curnoe, and J. P. F. LeBlanc, Algorithmic approach to diagrammatic expansions for real-frequency evaluation of susceptibility functions (2020b), eprint arXiv:2004.11091.
- Giuliani and Vignale (2005) G. Giuliani and G. Vignale, Quantum theory of the electron liquid (Cambridge university press, 2005).
- Van Houcke et al. (2010) K. Van Houcke, E. Kozik, N. V. Prokof’ev, and B. V. Svistunov, Physics Procedia 6, 95 (2010), computer Simulations Studies in Condensed Matter Physics XXI.
- Hugenholtz (1965) N. M. Hugenholtz, Reports on Progress in Physics 28, 201 (1965).
- Diatlov et al. (1957) I. Diatlov, V. Sudakov, and K. Ter-Martirosian, Soviet Phys. JETP Vol: 5 (1957).
- Roulet et al. (1969) B. Roulet, J. Gavoret, and P. Nozières, Phys. Rev. 178, 1072 (1969).
- Bickers (2004) N. E. Bickers, Theoretical Methods for Strongly Correlated Electrons (Springer-Verlag, 2004), pp. 237–296.
- Dyson (1949) F. J. Dyson, Phys. Rev. 75, 1736 (1949).
- Schwinger (1951) J. Schwinger, Proceedings of the National Academy of Sciences 37, 452 (1951).
- Baym and Kadanoff (1961) G. Baym and L. P. Kadanoff, Phys. Rev. 124, 287 (1961).
- Peskin (2018) M. Peskin, An introduction to quantum field theory (CRC press, 2018).
- Tag and Khène (2017) M. Tag and S. Khène, International Journal of Modern Physics C 28, 1750113 (2017).
Appendix A Statistic Error Estimation in Diagrammatic Monte Carlo Algorithms
In our diagrammatic Monte Carlo algorithm, the configuration spaces consist of two sub-spaces : the physical diagrams with orders and the normalization “diagram” with the order . The weight function of the latter, , should be simple enough so that the integral is explicitly known. In our algorithm we use a constant for simplicity. In this setup, the physical diagram weight can be calculated with the equation
(1) |
where the MC estimators and are measured with
(2) | ||||
For simplicity, here we have suppressed the labels such as the order and the topological index in the diagram weight , so that the total amplitude is a simple integral . The probability density of a given configuration is proportional to and , respectively. In the total MC steps , the physical diagrams are sampled for times, and the normalization “diagram” are for times.
Now we estimate the statistic error. According to the propagation of uncertainty, the variance of in Eq.(1) is given by
(3) |
where and are variance of the MC integration and , respectively. In the Markov chain MC, according to definition the variance of can be written as
(4) |
Here and are the partition sums of the corresponding configuration spaces. Due to the detailed balance, one has .
Similarly, the variance of can be written as
(5) |
By substituting and , the variances of and are given by
(6) | ||||
With the Eq. 3, we derive the variance of as
(7) | ||||
The approximations are based on the facts that (massive sign cancellation), and . The final expression is simple but heuristic: the variance of only depends on the partition sum . The statistical error after MC steps is
(8) |