3.3 Continuous-Time Hybridization Expansion Quantum Monte-Carlo Algorithm
3.3.1 Configurations, Weights and Observables
To find the configurations and weights, we follow an opposite way as for the CT-AUX solver, namely, we start with a functional integral formulation of the AIM and switch back to operator notation after an expansion of the effective action exponential in the hybridization function. The effective action of the AIM reads (3.6)
Seff = Z
dτ
"
X
σ
c†σ(τ)(∂τ−µσ)cσ(τ) +U n↑(τ)n↓(τ)
#
− Z
dτ dτ0X
σ
c†σ(τ)Γσ(τ−τ0)cσ(τ0)
= S0− Z
dτ dτ0X
σ
c†σ(τ)Γσ(τ−τ0)cσ(τ0) (3.76)
where the first part (i.e.S0) is local in time, i.e. has a direct operator correspondence. The second part, the hybridization, is non-local in time since it results from the integration over the infinite bath. The idea is now, to expand the partition function in terms of the hybridization functionΓ. In the expansion,
we denotenσas the perturbation order of spinσandn=n↑+n↓as the total perturbation order. The partition function in the functional integral representation is given by the integral
Z =
Z
D[c†, c ]e−Seff
= Z
D[c†, c ]e−S0
Y
σ=↑↓
∞
X
nσ=0
1 nσ!
nσ
Y
lσ=1
Z dτc
† σ
l dτlcσ c†σ(τc
† σ
l )Γσ(τc
† σ
l −τlcσ)cσ(τlcσ)
=
∞
X
nσ=0
1 n↑!n↓!
nσ
Y
σ=↑↓,lσ=1
Z dτc
† σ
l dτlcσΓσ(τc
† σ
l −τlcσ)
× Z
D[c†, c ]e−S0
nσ
Y
σ=↑↓,lσ=1
c†σ(τc
† σ
l )cσ(τlcσ). (3.77)
The functional integral on the right side of this equation has a direct operator correspondence and we can rewrite the integral as an time-ordered operator averageh...i0with respect to the Hamiltonian
H0=−X
σ
µσnσ+U n↑n↓, (3.78)
resulting in the expression
Z =
∞
X
nσ=0
1 n↑!n↓!
nσ
Y
σ=↑↓,lσ=1
Z dτc
† σ
l dτlcσ Γσ(τc
† σ
l −τlcσ)
* T
nσ
Y
σ=↑↓,lσ=1
c†σ(τc
† σ
l )cσ(τlcσ) +
0
=
∞
X
nσ=0
1 (n↑!n↓!)2
nσ
Y
σ=↑↓,lσ=1
Z dτc
† σ
l dτlcσ det
Mσ−1({τlc†σ, τlcσ})
×
* T
nσ
Y
σ=↑↓,lσ=1
c†σ(τc
† σ
l )cσ(τlcσ) +
0
. (3.79)
In the last step, the matrixMσ−1({τlc†σ, τlcσ})has been introduced, which contains the elements
Mσ−1({τlc†σ, τlcσ})
ij
= Γσ(τc
† σ
i −τjcσ), (3.80)
which leads tonσ!products instead of a single one and enforces the additional factor1/(nσ!)in equation (3.79). Note that the sign of the determinant exactly cancels with the sign that results from the time-ordering operator and so there is no sign problem. The integrals and the two sums over the perturbation order for spin-up and spin-down operators in (3.79) are supposed to be sampled by the Monte-Carlo pro-cess, which identifies the configurationsC = (n↑, n↓,{(τlc†σ, τlcσ
σ)|lσ = 1, ..., nσ, σ =↑↓}, consisting of the perturbation ordersn↑, n↓for spin up, spin down and the2nσtimes(τlc†σ, τlcσ
σ)for the respective cre-ation and annihilcre-ation operators. In the Monte-Carlo procedure, the crecre-ation operators will be integrated in a time-ordered form, as well as the annihilation operators but the ordering of creation operators with respect to annihilation operators will not be performed. This cancels exactly the factors1/(nσ)2 from equation (3.79) above and leads to the formula for the weights
dCwC =Y
σ
(dτ)2nσdet
Mσ−1({τlc†σ, τlcσ})
* nσ Y
σ=↑↓,lσ=1
c†σ(τc
† σ
l )cσ(τlcσ) +
0
. (3.81)
The next step is then to find an analytic expression for the trace
* nσ Y
σ=↑↓,lσ=1
c†σ(τc
† σ
l )cσ(τlcσ) +
0
= X
n↑,n↓=0,1
hn↑, n↓|e−βH0
nσ
Y
σ=↑↓,lσ=1
c†σ(τc
† σ
l )cσ(τlcσ)
|n↑, n↓i, (3.82)
3.3. Continuous-Time Hybridization Expansion Quantum Monte-Carlo Algorithm 57
which is rather easy, since for any configurationC, only of the four summands in the trace will be non-zero. As mentioned above, the creation operators stay time-ordered with respect to annihilation operators and therefore in the product in (3.82) either all operators for a given spin component are ordered as cσ(τncσσ)c†σ(τc
†
nσσ), ..., cσ(τ1cσ)c†σ(τc
† σ
1 )or asc†σ(τc
†
nσσ)cσ(τncσσ), ..., c†σ(τc
† σ
1 )cσ(τ1cσ), where the latter introduces a factor of(−1)because of the changed ordering. A trace of the first product in the space of spinσ, i.e.
nσ ={0,1}, will have only one non-zero contribution, namely from the state|nσ = 1i, whereas in the second product the non-vanishing contribution results from the state|nσ = 0i, which clearly illustrates for the statement above that only a single state|n↑, n↓icontributes to the trace (3.82). The configurations Care best understood in terms of a segment picture of the impurity, which we now introduce.
The non-zero trace-factor for the productcσ(τncσσ)c†σ(τc
†
nσσ), ..., cσ(τ2cσ)c†σ(τc
† σ
2 )cσ(τ1cσ)c†σ(τc
† σ
1 )belongs to the state|nσ = 0i, i.e. at timeτ = 0the impurity is unoccupied. Then at timeτ = τc
† σ
1 a spin-σ particle is inserted and stays in the impurity until it is removed atτ = τ1cσ and the impurity is empty again until at τc
† σ
2 a particle is inserted again and so on. These time intervals when the impurity is occupied by a spin up or spin down particle are called segments and uniquely define the configurations C. When the trace factor belongs to the occupied state|nσ= 1i, we can interpret the respective product c†σ(τc
†
nσσ)cσ(τncσσ), ..., c†σ(τc
† σ
1 )cσ(τ1cσ)as starting with an occupied impurity, i.e. with an occupied interval [0, τ1cσ], and also end with an occupied impurity, i.e. with the interval[τc
†
nσσ, β]. Combining these two intervals, the result is a single interval[τc
†
nσσ, τ1cσ], which belongs to a segment that winds around and crosses the interval boundaries fromβ to zero. For such segments, an additional factor(−1)has to be introduced, as explained above, because of exchanged ordering.
In the segment picture, the trace-factor can be determined in terms of segment properties and is given by
Figure 3.7: Illustration of a configurationC in the segment picture. There are two pairs of annihilation and creation operators for spin up and three pairs of annihilation and creation operators for spin down occupying the impurity for different times. The filled squares stand for annihilation operators, whereas the empty squares denote creation operators. Colored lines depict a filled impurity. The prefactors for the trace of this configuration would be(−1)since for the down spins one segment crosses theβ,0line. The occupation timeτσoccfor spinσwould be the total length of all lines with the corresponding color and the double occupation timeτdoubleis the total width of the violet blocks, which indicate the time spans when the impurity is doubly occupied.
* nσ Y
σ=↑↓,lσ=1
c†σ(τlc†σ)cσ(τlcσ) +
0
= (−1)PσsσeµPστσocc−U τdouble, (3.83) wheresσis the number of segments for spinσ, which cross the0, βboundary (sσ = 0,1),τσoccis the total length of all segments for spinσandτdoubleis the total overlap of the occupied segments of the different spins or in other words the total time in which the impurity is doubly occupied. One should note that for the case whennσ = 0, i.e. at zero perturbation order we must also distinguish between a completely filled or a completely empty impurity in order to always have a single contribution from the trace above as for all higher perturbation orders. This can be done by decomposing the corresponding Monte-Carlo configurationCinto two distinct configuration, i.e. a “filled” impurity and an “empty” impurity. A typical configuration is illustrated in Fig. 3.7, explaining the trace-factor’s ingredients.
Up to now, the configurationsCand their corresponding weightswC have been identified. The
config-Figure 3.8: Subset of diagrams contributing to the weightwC of a configuration C = (n↑ = 2, n↓ = 3), ...). In front of every diagram, there is the corresponding prefactor(−1)s+d which comes from the determinant (d) and from the trace factor (s) and can be determined by counting the number nR of hybridization lines that are reversed in time, i.e.s+d=nR.
urationsC = (n↑, n↓,S1↑, ...,Sn↑↑,S1↓, ...,Sn↓↓)contain the perturbation ordernσ for spinσand thenσ
distinct segmentsSiσ = (τc
† σ
i , τicσ)for both spin components. The corresponding weight is then deter-mined by
dCwC = (−1)PσsσeµPστσocc−U τdoubleY
σ
(dτ)2nσdet
Mσ−1({τlc†σ, τlcσ})
. (3.84)
Note that the prefactor(−1)sσin this expression does not cause an explicit sign problem, since it cancels with the sign of the determinantdet(Mσ)−1, which is positive when no segment crossesβ,0and becomes negative otherwise. The last point results from the fact that
Γσ(τ)>0 for τ >0, and Γσ(−τ) =−Γσ(β−τ), (3.85) which is clear by definition ofΓin (3.15).
After the weights and configurations are found, the next step is to determine the observablesgC, which we will not do directly but instead in a more subtle way. An arbitrary Green’s functiong(τ)can, by using the identityg(τ) =−g(β+τ), be re-expressed as
g(τ) = Z
dτ0dτ00∆(τ0−τ00−τ)g(τ0−τ00), (3.86) where we have introduced the delta-function
β∆(τ0−τ00−τ) = δ(τ0−τ00−τ), for τ0> τ00
−δ(β+τ0−τ00−τ), for τ0 < τ00
. (3.87)
The Green’s function for spinσ¯is then determined by Gσ¯(τ) =
Z
dτ0dτ00∆(τ0−τ00−τ)G¯σ(τ0−τ00)
= 1 Z
Z
dτ0dτ00∆(τ0−τ00−τ)hTcσ¯(τ0)c†σ¯(τ00)i, (3.88) which, remembering the effective action in (3.76), can be formulated as
Gσ¯(τ) = 1 Z
Z
dτ0dτ00∆(τ0−τ00−τ) ∂Z
∂Γσ¯(τ00−τ0). (3.89)
3.3. Continuous-Time Hybridization Expansion Quantum Monte-Carlo Algorithm 59
With the definition ofgC, it is immediately clear from this expression, that g¯σC(τ) =
Z
dτ0dτ00∆(τ0−τ00−τ) 1 wC
∂wC
∂Γσ¯(τ00−τ0)
= Z
dτ0dτ00∆(τ0−τ00−τ) det(Mσ¯({τlc†¯σ, τlcσ¯}))∂det(Mσ¯−1({τc
†
¯ σ
l , τlc¯σ})
∂Γσ¯(τ00−τ0). (3.90) Combining the rules for functional differentiation, i.e.
∂Γσ(τi−τl)
∂Γσ¯(τ00−τ00)=δ(τi−τl−τ00+τ0)δσ¯σ, (3.91) and matrix inversion
Mij =det( ˜M−1)(ji)
det(M−1) = 1 det(M−1)
∂det(M−1)
∂(M−1)ji , (3.92)
where we used the cofactors( ˜M−1)(ji)for the matrix inversion, which has a possible representation as the derivative of the determinant with respect to the corresponding matrix element(M−1)ji, we finally obtain the formula for the observables:
g¯σC(τ) = ∆(τicσ¯ −τc
†
¯ σ
j −τ)(M¯σ({τlc†¯σ, τlc¯σ}))ji. (3.93) The delta-function in this formula must either be measured on a fine grid inτ-space, i.e. on a discretized time interval[0, β]or, as we will do, the observables have to be performed in another representation which is much more suitable for continuous, smooth functions (see chapter ...). The average occupation hnσifor theσ-component and the average double occupancyhn↑n↓iare other observables, which can be directly measured in the Monte-Carlo sampling, which becomes clear when taking the derivatives
βhnσi= 1 Z
∂Z
∂µσ
and βhn↑n↓i=−1 Z
∂Z
∂U. (3.94)
As above, this leads to the observables nσC = 1
βwC
∂wC
∂µσ
= τσocc
β and (n↑n↓)C =− 1 βwC
∂wC
∂U =τdouble
β , (3.95)
which can be accumulated without any effort during the Monte-Carlo sampling and are determined more accurately than the Green’s functions since they are static variables.
With all the necessary ingredients, namely the configurations, the weights and the observables, we can skip and jump to the next section and set up the Markov-Chain and determine the acceptance probabilities for the sampling process.