complex langevin simulations of a finite density matrix

74
Complex Langevin simulations of a finite density matrix model for QCD Savvas Zafeiropoulos Universit¨ at Heidelberg 14.12.2017 SM & FT 2017 In collaboration with J. Bloch (Regensburg U.), J. Glesaaen (Swansea U.), J. Verbaarschot (Stony Brook U.) Savvas Zafeiropoulos CL for Random Matrix Theory 1/35

Upload: others

Post on 12-Mar-2022

5 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Complex Langevin simulations of a finite density matrix

Complex Langevin simulations of a finite density

matrix model for QCD

Savvas Zafeiropoulos

Universitat Heidelberg

14.12.2017

SM & FT 2017

In collaboration with J. Bloch (Regensburg U.), J. Glesaaen (Swansea U.), J. Verbaarschot (Stony Brook U.)

Savvas Zafeiropoulos CL for Random Matrix Theory 1/35

Page 2: Complex Langevin simulations of a finite density matrix

Phase diagram from a theorist’s viewpoint

(Courtesy of wikipedia)Savvas Zafeiropoulos CL for Random Matrix Theory 2/35

Page 3: Complex Langevin simulations of a finite density matrix

Stochastic quantization as an alternative

consider the trivial ”QFT” given by the partition function

Z =∫e−S(x)dx

in the real Langevin formulation

x(t+ δt) = x(t)− ∂xS(x(t))δt+ δξ

stochastic variable δξ with zero mean and variance given by

2δt

generalization to complex actions Parisi (1983), Klauder (1983)

x→ z = x+ iy

z(t+ δt) = z(t)− ∂zS(z(t))δt+ δξ

one can study gauge theories with complex actions Aarts, James,

Seiler, Sexty, Stamatescu, ...

Savvas Zafeiropoulos CL for Random Matrix Theory 3/35

Page 4: Complex Langevin simulations of a finite density matrix

Stochastic quantization as an alternative

consider the trivial ”QFT” given by the partition function

Z =∫e−S(x)dx

in the real Langevin formulation

x(t+ δt) = x(t)− ∂xS(x(t))δt+ δξ

stochastic variable δξ with zero mean and variance given by

2δt

generalization to complex actions Parisi (1983), Klauder (1983)

x→ z = x+ iy

z(t+ δt) = z(t)− ∂zS(z(t))δt+ δξ

one can study gauge theories with complex actions Aarts, James,

Seiler, Sexty, Stamatescu, ...

Savvas Zafeiropoulos CL for Random Matrix Theory 3/35

Page 5: Complex Langevin simulations of a finite density matrix

Stochastic quantization as an alternative

consider the trivial ”QFT” given by the partition function

Z =∫e−S(x)dx

in the real Langevin formulation

x(t+ δt) = x(t)− ∂xS(x(t))δt+ δξ

stochastic variable δξ with zero mean and variance given by

2δt

generalization to complex actions Parisi (1983), Klauder (1983)

x→ z = x+ iy

z(t+ δt) = z(t)− ∂zS(z(t))δt+ δξ

one can study gauge theories with complex actions Aarts, James,

Seiler, Sexty, Stamatescu, ...

Savvas Zafeiropoulos CL for Random Matrix Theory 3/35

Page 6: Complex Langevin simulations of a finite density matrix

Stochastic quantization as an alternative

consider the trivial ”QFT” given by the partition function

Z =∫e−S(x)dx

in the real Langevin formulation

x(t+ δt) = x(t)− ∂xS(x(t))δt+ δξ

stochastic variable δξ with zero mean and variance given by

2δt

generalization to complex actions Parisi (1983), Klauder (1983)

x→ z = x+ iy

z(t+ δt) = z(t)− ∂zS(z(t))δt+ δξ

one can study gauge theories with complex actions Aarts, James,

Seiler, Sexty, Stamatescu, ...

Savvas Zafeiropoulos CL for Random Matrix Theory 3/35

Page 7: Complex Langevin simulations of a finite density matrix

Stochastic quantization as an alternative

consider the trivial ”QFT” given by the partition function

Z =∫e−S(x)dx

in the real Langevin formulation

x(t+ δt) = x(t)− ∂xS(x(t))δt+ δξ

stochastic variable δξ with zero mean and variance given by

2δt

generalization to complex actions Parisi (1983), Klauder (1983)

x→ z = x+ iy

z(t+ δt) = z(t)− ∂zS(z(t))δt+ δξ

one can study gauge theories with complex actions Aarts, James,

Seiler, Sexty, Stamatescu, ...

Savvas Zafeiropoulos CL for Random Matrix Theory 3/35

Page 8: Complex Langevin simulations of a finite density matrix

Is this ”the” solution to the sign problem?

proof relating Langevin dynamics to the path integral

quantization-no longer holds

simulations are not guaranteed to converge to ”the correct

solution”

criteria of convergence not fulfilled in practical simulations (at

least for some range of the parameters)

Savvas Zafeiropoulos CL for Random Matrix Theory 4/35

Page 9: Complex Langevin simulations of a finite density matrix

Is this ”the” solution to the sign problem?

proof relating Langevin dynamics to the path integral

quantization-no longer holds

simulations are not guaranteed to converge to ”the correct

solution”

criteria of convergence not fulfilled in practical simulations (at

least for some range of the parameters)

Savvas Zafeiropoulos CL for Random Matrix Theory 4/35

Page 10: Complex Langevin simulations of a finite density matrix

Is this ”the” solution to the sign problem?

proof relating Langevin dynamics to the path integral

quantization-no longer holds

simulations are not guaranteed to converge to ”the correct

solution”

criteria of convergence not fulfilled in practical simulations (at

least for some range of the parameters)

Savvas Zafeiropoulos CL for Random Matrix Theory 4/35

Page 11: Complex Langevin simulations of a finite density matrix

Validity criteria

action S and observables O should be holomorphic in the

complexified variables (up to singularities)

the probability distribution of the complexified variables z

along the CL trajectories should be suppressed close to the

singularities of the drift term and of the observable

sufficiently fast decay of the probability distribution in the

imaginary direction

Savvas Zafeiropoulos CL for Random Matrix Theory 5/35

Page 12: Complex Langevin simulations of a finite density matrix

Validity criteria

action S and observables O should be holomorphic in the

complexified variables (up to singularities)

the probability distribution of the complexified variables z

along the CL trajectories should be suppressed close to the

singularities of the drift term and of the observable

sufficiently fast decay of the probability distribution in the

imaginary direction

Savvas Zafeiropoulos CL for Random Matrix Theory 5/35

Page 13: Complex Langevin simulations of a finite density matrix

Validity criteria

action S and observables O should be holomorphic in the

complexified variables (up to singularities)

the probability distribution of the complexified variables z

along the CL trajectories should be suppressed close to the

singularities of the drift term and of the observable

sufficiently fast decay of the probability distribution in the

imaginary direction

Savvas Zafeiropoulos CL for Random Matrix Theory 5/35

Page 14: Complex Langevin simulations of a finite density matrix

RMT

focus on a much simpler theory than QCD. Random Matrix

Theory

same flavor symmetries with QCD which uniquely determine

(in the ε-regime)

mass dependence of the chiral condensate 〈ηη〉 = ∂m logZ

the baryon number density 〈η†η〉 = ∂µ logZ

Savvas Zafeiropoulos CL for Random Matrix Theory 6/35

Page 15: Complex Langevin simulations of a finite density matrix

RMT

focus on a much simpler theory than QCD. Random Matrix

Theory

same flavor symmetries with QCD which uniquely determine

(in the ε-regime)

mass dependence of the chiral condensate 〈ηη〉 = ∂m logZ

the baryon number density 〈η†η〉 = ∂µ logZ

Savvas Zafeiropoulos CL for Random Matrix Theory 6/35

Page 16: Complex Langevin simulations of a finite density matrix

The Stephanov Model

Z =∫DWe−nΣ2TrWW †detNf

(m iW + µ

iW † + µ m

)Stephanov (1996) and Halasz, Jackson, Verbaarschot(1997)

solve via bosonization

Z(m,µ) =∫dσdσ∗e−nσ

2(σσ∗ +m(σ + σ∗) +m2 − µ2)n

where σ is an Nf ×Nf matrix

ZNf=1(m,µ) =∫dσdσ∗e−nσ

2(σσ∗+m(σ+ σ∗) +m2− µ2)n

ZNf=1(m,µ) = πe−nm2 ∫∞

0 du(u− µ2)nI0(2mn√u)e−nu

Savvas Zafeiropoulos CL for Random Matrix Theory 7/35

Page 17: Complex Langevin simulations of a finite density matrix

The Stephanov Model

Z =∫DWe−nΣ2TrWW †detNf

(m iW + µ

iW † + µ m

)Stephanov (1996) and Halasz, Jackson, Verbaarschot(1997)

solve via bosonization

Z(m,µ) =∫dσdσ∗e−nσ

2(σσ∗ +m(σ + σ∗) +m2 − µ2)n

where σ is an Nf ×Nf matrix

ZNf=1(m,µ) =∫dσdσ∗e−nσ

2(σσ∗+m(σ+ σ∗) +m2− µ2)n

ZNf=1(m,µ) = πe−nm2 ∫∞

0 du(u− µ2)nI0(2mn√u)e−nu

Savvas Zafeiropoulos CL for Random Matrix Theory 7/35

Page 18: Complex Langevin simulations of a finite density matrix

The Stephanov Model

Z =∫DWe−nΣ2TrWW †detNf

(m iW + µ

iW † + µ m

)Stephanov (1996) and Halasz, Jackson, Verbaarschot(1997)

solve via bosonization

Z(m,µ) =∫dσdσ∗e−nσ

2(σσ∗ +m(σ + σ∗) +m2 − µ2)n

where σ is an Nf ×Nf matrix

ZNf=1(m,µ) =∫dσdσ∗e−nσ

2(σσ∗+m(σ+ σ∗) +m2− µ2)n

ZNf=1(m,µ) = πe−nm2 ∫∞

0 du(u− µ2)nI0(2mn√u)e−nu

Savvas Zafeiropoulos CL for Random Matrix Theory 7/35

Page 19: Complex Langevin simulations of a finite density matrix

The Stephanov Model

Z =∫DWe−nΣ2TrWW †detNf

(m iW + µ

iW † + µ m

)Stephanov (1996) and Halasz, Jackson, Verbaarschot(1997)

solve via bosonization

Z(m,µ) =∫dσdσ∗e−nσ

2(σσ∗ +m(σ + σ∗) +m2 − µ2)n

where σ is an Nf ×Nf matrix

ZNf=1(m,µ) =∫dσdσ∗e−nσ

2(σσ∗+m(σ+ σ∗) +m2− µ2)n

ZNf=1(m,µ) = πe−nm2 ∫∞

0 du(u− µ2)nI0(2mn√u)e−nu

Savvas Zafeiropoulos CL for Random Matrix Theory 7/35

Page 20: Complex Langevin simulations of a finite density matrix

The phase transition

there is a phase transition separating a phase with zero and

non-zero baryon density

in the chiral limit µc = 0.527 for µ ∈ R

we can compute Σ(m,µ) and nB(m,µ) and compare it with

the Complex Langevin simulation

first attempts in the Osborn model

Z =∫D[W,W ′]e−nΣ2Tr(WW †+W ′W ′†)detNf

(m iW + µW ′

iW † + µW ′ m

)Mollgaard and Splittorff(2013-2014), Nagata, Nishimura, Shimasaki (2015-2016)

However, Z(m,µ) = (1− µ2)nNfZ( m√1−µ2

, 0)

Savvas Zafeiropoulos CL for Random Matrix Theory 8/35

Page 21: Complex Langevin simulations of a finite density matrix

The phase transition

there is a phase transition separating a phase with zero and

non-zero baryon density

in the chiral limit µc = 0.527 for µ ∈ R

we can compute Σ(m,µ) and nB(m,µ) and compare it with

the Complex Langevin simulation

first attempts in the Osborn model

Z =∫D[W,W ′]e−nΣ2Tr(WW †+W ′W ′†)detNf

(m iW + µW ′

iW † + µW ′ m

)Mollgaard and Splittorff(2013-2014), Nagata, Nishimura, Shimasaki (2015-2016)

However, Z(m,µ) = (1− µ2)nNfZ( m√1−µ2

, 0)

Savvas Zafeiropoulos CL for Random Matrix Theory 8/35

Page 22: Complex Langevin simulations of a finite density matrix

The phase transition

there is a phase transition separating a phase with zero and

non-zero baryon density

in the chiral limit µc = 0.527 for µ ∈ R

we can compute Σ(m,µ) and nB(m,µ) and compare it with

the Complex Langevin simulation

first attempts in the Osborn model

Z =∫D[W,W ′]e−nΣ2Tr(WW †+W ′W ′†)detNf

(m iW + µW ′

iW † + µW ′ m

)Mollgaard and Splittorff(2013-2014), Nagata, Nishimura, Shimasaki (2015-2016)

However, Z(m,µ) = (1− µ2)nNfZ( m√1−µ2

, 0)

Savvas Zafeiropoulos CL for Random Matrix Theory 8/35

Page 23: Complex Langevin simulations of a finite density matrix

Complex Langevin for RMT

Z =∫DWe−nΣ2TrWW †detNf

(m iW + µ

iW † + µ m

)W = A+ iB

compute the drift terms ∂S/∂Aij and ∂S/∂Bij

complexify the dof A,B ∈ R→ a, b ∈ C

Aij(t+ δt) = Aij(t)− ∂AijS(x(t))δt+ δξij

Bij(t+ δt) = Bij(t)− ∂BijS(x(t))δt+ δξij

〈ξij〉 = 0 and 〈ξij(t)ξkl(t′)〉 = 2δtδ(t− t′)δikδjl

Savvas Zafeiropoulos CL for Random Matrix Theory 9/35

Page 24: Complex Langevin simulations of a finite density matrix

Complex Langevin for RMT

Z =∫DWe−nΣ2TrWW †detNf

(m iW + µ

iW † + µ m

)W = A+ iB

compute the drift terms ∂S/∂Aij and ∂S/∂Bij

complexify the dof A,B ∈ R→ a, b ∈ C

Aij(t+ δt) = Aij(t)− ∂AijS(x(t))δt+ δξij

Bij(t+ δt) = Bij(t)− ∂BijS(x(t))δt+ δξij

〈ξij〉 = 0 and 〈ξij(t)ξkl(t′)〉 = 2δtδ(t− t′)δikδjl

Savvas Zafeiropoulos CL for Random Matrix Theory 9/35

Page 25: Complex Langevin simulations of a finite density matrix

Complex Langevin for RMT

Z =∫DWe−nΣ2TrWW †detNf

(m iW + µ

iW † + µ m

)W = A+ iB

compute the drift terms ∂S/∂Aij and ∂S/∂Bij

complexify the dof A,B ∈ R→ a, b ∈ C

Aij(t+ δt) = Aij(t)− ∂AijS(x(t))δt+ δξij

Bij(t+ δt) = Bij(t)− ∂BijS(x(t))δt+ δξij

〈ξij〉 = 0 and 〈ξij(t)ξkl(t′)〉 = 2δtδ(t− t′)δikδjl

Savvas Zafeiropoulos CL for Random Matrix Theory 9/35

Page 26: Complex Langevin simulations of a finite density matrix

Complex Langevin for RMT

Z =∫DWe−nΣ2TrWW †detNf

(m iW + µ

iW † + µ m

)W = A+ iB

compute the drift terms ∂S/∂Aij and ∂S/∂Bij

complexify the dof A,B ∈ R→ a, b ∈ C

Aij(t+ δt) = Aij(t)− ∂AijS(x(t))δt+ δξij

Bij(t+ δt) = Bij(t)− ∂BijS(x(t))δt+ δξij

〈ξij〉 = 0 and 〈ξij(t)ξkl(t′)〉 = 2δtδ(t− t′)δikδjl

Savvas Zafeiropoulos CL for Random Matrix Theory 9/35

Page 27: Complex Langevin simulations of a finite density matrix

m-scan for µ = 1

0.4

0.6

0.8

1

1.2

1.4

1.6

1.8

2

2.2

0 0.5 1 1.5 2

<〈η† η〉

m

CLanalytic

phase quenched

〈η†η〉 for µ = 1

−0.4

−0.2

0

0.2

0.4

0.6

0.8

1

0 0.5 1 1.5 2

<〈ηη〉

m

CLanalytic

phase quenched

〈ηη〉 for µ = 1

analytical pq results by Glesaaen, Verbaarschot and SZ (2016)

Savvas Zafeiropoulos CL for Random Matrix Theory 10/35

Page 28: Complex Langevin simulations of a finite density matrix

µ-scan for m = 0

−0.5

0

0.5

1

1.5

2

2.5

3

0 0.5 1 1.5 2

<〈η† η〉

µ

CLanalytic

phase quenched

〈η†η〉 for m = 0

−1

−0.5

0

0.5

1

0 0.5 1 1.5 2

<〈ηη〉

µ

CLanalytic

phase quenched

〈ηη〉 for m = 0

Savvas Zafeiropoulos CL for Random Matrix Theory 11/35

Page 29: Complex Langevin simulations of a finite density matrix

µ-scan for m = 0.2

−0.5

0

0.5

1

1.5

2

2.5

3

0 0.5 1 1.5 2

<〈η† η〉

µ

CLanalytic

phase quenched

〈η†η〉 for m = 0.2

−0.2

0

0.2

0.4

0.6

0.8

1

1.2

0 0.5 1 1.5 2

<〈ηη〉

µ

CLanalytic

phase quenched

〈ηη〉 for m = 0.2

Savvas Zafeiropoulos CL for Random Matrix Theory 12/35

Page 30: Complex Langevin simulations of a finite density matrix

µ-scan for m = 1

−0.5

0

0.5

1

1.5

2

2.5

3

0 0.5 1 1.5 2

<〈η† η〉

µ

CLanalytic

phase quenched

〈η†η〉 for m = 1

−0.6

−0.4

−0.2

0

0.2

0.4

0.6

0.8

1

0 0.5 1 1.5 2

<〈ηη〉

µ

CLanalytic

phase quenched

〈ηη〉 for m = 1

Savvas Zafeiropoulos CL for Random Matrix Theory 13/35

Page 31: Complex Langevin simulations of a finite density matrix

Gauge Cooling

Originally suggested for QCD by Seiler, Sexty and Stamatescu(2012)

implemented for RMT by Nagata, Nishimura, Shimasaki (2015) in the Osborn model

complexified action invariant under an enhanced gauge trafo

steer the evolution in Langevin time towards more physical

solutions

successful application to the Osborn model

complexified action is invariant GL(N,C)

A′ = 12

(hAh−1 + (hATh−1)T + i

(hBh−1 − (hBTh−1)T

))B′ = 1

2

(hBh−1 + (hBTh−1)T − i

(hAh−1 − (hATh−1)T

))

Savvas Zafeiropoulos CL for Random Matrix Theory 14/35

Page 32: Complex Langevin simulations of a finite density matrix

Gauge Cooling

Originally suggested for QCD by Seiler, Sexty and Stamatescu(2012)

implemented for RMT by Nagata, Nishimura, Shimasaki (2015) in the Osborn model

complexified action invariant under an enhanced gauge trafo

steer the evolution in Langevin time towards more physical

solutions

successful application to the Osborn model

complexified action is invariant GL(N,C)

A′ = 12

(hAh−1 + (hATh−1)T + i

(hBh−1 − (hBTh−1)T

))B′ = 1

2

(hBh−1 + (hBTh−1)T − i

(hAh−1 − (hATh−1)T

))

Savvas Zafeiropoulos CL for Random Matrix Theory 14/35

Page 33: Complex Langevin simulations of a finite density matrix

Gauge Cooling

Originally suggested for QCD by Seiler, Sexty and Stamatescu(2012)

implemented for RMT by Nagata, Nishimura, Shimasaki (2015) in the Osborn model

complexified action invariant under an enhanced gauge trafo

steer the evolution in Langevin time towards more physical

solutions

successful application to the Osborn model

complexified action is invariant GL(N,C)

A′ = 12

(hAh−1 + (hATh−1)T + i

(hBh−1 − (hBTh−1)T

))B′ = 1

2

(hBh−1 + (hBTh−1)T − i

(hAh−1 − (hATh−1)T

))

Savvas Zafeiropoulos CL for Random Matrix Theory 14/35

Page 34: Complex Langevin simulations of a finite density matrix

Gauge Cooling

Originally suggested for QCD by Seiler, Sexty and Stamatescu(2012)

implemented for RMT by Nagata, Nishimura, Shimasaki (2015) in the Osborn model

complexified action invariant under an enhanced gauge trafo

steer the evolution in Langevin time towards more physical

solutions

successful application to the Osborn model

complexified action is invariant GL(N,C)

A′ = 12

(hAh−1 + (hATh−1)T + i

(hBh−1 − (hBTh−1)T

))B′ = 1

2

(hBh−1 + (hBTh−1)T − i

(hAh−1 − (hATh−1)T

))

Savvas Zafeiropoulos CL for Random Matrix Theory 14/35

Page 35: Complex Langevin simulations of a finite density matrix

Gauge Cooling

Originally suggested for QCD by Seiler, Sexty and Stamatescu(2012)

implemented for RMT by Nagata, Nishimura, Shimasaki (2015) in the Osborn model

complexified action invariant under an enhanced gauge trafo

steer the evolution in Langevin time towards more physical

solutions

successful application to the Osborn model

complexified action is invariant GL(N,C)

A′ = 12

(hAh−1 + (hATh−1)T + i

(hBh−1 − (hBTh−1)T

))B′ = 1

2

(hBh−1 + (hBTh−1)T − i

(hAh−1 − (hATh−1)T

))

Savvas Zafeiropoulos CL for Random Matrix Theory 14/35

Page 36: Complex Langevin simulations of a finite density matrix

The Cooling norms

NH = 1N tr

[(X − Y †

)†(X − Y †

)](N.B. X(0) = W and Y (0) = W†

X = A + iB and Y = AT − BT when A,B are complexified)

NAH = 1N tr

[((φ+ ψ†

)†(φ+ ψ†

))2]ψ and φ are the off-diagonal elements of D: ψ = iX + µ,

φ = iY + µ

Nev =∑nev

i=1 e−ξγi

Nagg = (1− s)NAH/ev + sNH , where s ∈ [0, 1]

Savvas Zafeiropoulos CL for Random Matrix Theory 15/35

Page 37: Complex Langevin simulations of a finite density matrix

The Cooling norms

NH = 1N tr

[(X − Y †

)†(X − Y †

)](N.B. X(0) = W and Y (0) = W†

X = A + iB and Y = AT − BT when A,B are complexified)

NAH = 1N tr

[((φ+ ψ†

)†(φ+ ψ†

))2]ψ and φ are the off-diagonal elements of D: ψ = iX + µ,

φ = iY + µ

Nev =∑nev

i=1 e−ξγi

Nagg = (1− s)NAH/ev + sNH , where s ∈ [0, 1]

Savvas Zafeiropoulos CL for Random Matrix Theory 15/35

Page 38: Complex Langevin simulations of a finite density matrix

The Cooling norms

NH = 1N tr

[(X − Y †

)†(X − Y †

)](N.B. X(0) = W and Y (0) = W†

X = A + iB and Y = AT − BT when A,B are complexified)

NAH = 1N tr

[((φ+ ψ†

)†(φ+ ψ†

))2]ψ and φ are the off-diagonal elements of D: ψ = iX + µ,

φ = iY + µ

Nev =∑nev

i=1 e−ξγi

Nagg = (1− s)NAH/ev + sNH , where s ∈ [0, 1]

Savvas Zafeiropoulos CL for Random Matrix Theory 15/35

Page 39: Complex Langevin simulations of a finite density matrix

Cooling and the Dirac Spectrum

-2

-1

0

1

2

-0.6 -0.4 -0.2 0 0.2 0.4 0.6 0.8 1

no coolingNAH cooling

-2

-1

0

1

2

-0.2 -0.1 0 0.1 0.2 0.3 0.4

no coolingNAH cooling

Scatter plots of the eigenvalues of the fermion matrix for a standard CL run together with the ones from a run

cooled with the NAH cooling norm. The plots show the eigenvalues from the last 60 trajectories, separated by

100 updates. The left hand plot shows the Stephanov model, while the Osborn model is shown to the right.

Savvas Zafeiropoulos CL for Random Matrix Theory 16/35

Page 40: Complex Langevin simulations of a finite density matrix

Cooling and the Dirac Spectrum

-4

-3

-2

-1

0

1

2

3

4

-2 -1.5 -1 -0.5 0 0.5 1 1.5 2

no coolingNev cooling

-2

-1

0

1

2

-0.2 -0.1 0 0.1 0.2 0.3 0.4

no coolingNev cooling

Scatter plots of the eigenvalues of the fermion matrix for a standard CL run together with the ones from a gauge

cooled run. We chose the parameters {ξ = 100, nev = 2} for Nev . The plots show the eigenvalues from the

last 60 trajectories, separated by 100 updates. The left hand plot shows the Stephanov model, while the Osborn

model is shown to the right

Savvas Zafeiropoulos CL for Random Matrix Theory 17/35

Page 41: Complex Langevin simulations of a finite density matrix

The anti-hermiticity norm

0.6

0.8

1

1.2

1.4

1.6

1.8

0 20000 40000 60000 80000 100000

NAH

Quartic (anti hermiticity) norm, Stephanov model

no coolingquartic norm cooling

0

0.2

0.4

0.6

0.8

1

1.2

1.4

0 20000 40000 60000 80000 100000

NAH

Anti hermiticity norm, Osborn model

no coolingah cooling

Savvas Zafeiropoulos CL for Random Matrix Theory 18/35

Page 42: Complex Langevin simulations of a finite density matrix

The eigenvalue norm

0

0.2

0.4

0.6

0.8

1

1.2

1.4

1.6

1.8

2

0 1000 2000 3000 4000 5000 6000 7000 8000 9000 10000

Nev

step

no coolingNev cooling

0

0.5

1

1.5

2

0 1000 2000 3000 4000 5000 6000 7000 8000 9000 10000

Nev

step

no coolingNev cooling

Value of Nev as a function of Langevin time. Stephanov model to the left, Osborn model to the right

Savvas Zafeiropoulos CL for Random Matrix Theory 19/35

Page 43: Complex Langevin simulations of a finite density matrix

The shifted representation

shift µ away from the fermionic term by a COV

initially D =

(m iA−B + µ

iAT +BT + µ m

)Absorb µ into A with a COV A′ = A− iµ. The action in

terms of A′ and B is

S = Ntr(A′TA′−2iµA′+µ2 +BTB

)−Nf tr log

(m2 +X ′Y ′

)X ′ = A′ + iB and Y ′ = A′T − iBT . Now, the µ dependence

has shifted from the fermionic to the bosonic term.

Computing again the CL force term ...

Advantage of the shifted representation is that it starts in an

anti-Hermitian state, and since CL in non-deterministic, the

configurations could evolve to a different minimum.

Savvas Zafeiropoulos CL for Random Matrix Theory 20/35

Page 44: Complex Langevin simulations of a finite density matrix

The shifted representation

shift µ away from the fermionic term by a COV

initially D =

(m iA−B + µ

iAT +BT + µ m

)Absorb µ into A with a COV A′ = A− iµ. The action in

terms of A′ and B is

S = Ntr(A′TA′−2iµA′+µ2 +BTB

)−Nf tr log

(m2 +X ′Y ′

)X ′ = A′ + iB and Y ′ = A′T − iBT . Now, the µ dependence

has shifted from the fermionic to the bosonic term.

Computing again the CL force term ...

Advantage of the shifted representation is that it starts in an

anti-Hermitian state, and since CL in non-deterministic, the

configurations could evolve to a different minimum.

Savvas Zafeiropoulos CL for Random Matrix Theory 20/35

Page 45: Complex Langevin simulations of a finite density matrix

The shifted representation

shift µ away from the fermionic term by a COV

initially D =

(m iA−B + µ

iAT +BT + µ m

)Absorb µ into A with a COV A′ = A− iµ. The action in

terms of A′ and B is

S = Ntr(A′TA′−2iµA′+µ2 +BTB

)−Nf tr log

(m2 +X ′Y ′

)X ′ = A′ + iB and Y ′ = A′T − iBT . Now, the µ dependence

has shifted from the fermionic to the bosonic term.

Computing again the CL force term ...

Advantage of the shifted representation is that it starts in an

anti-Hermitian state, and since CL in non-deterministic, the

configurations could evolve to a different minimum.

Savvas Zafeiropoulos CL for Random Matrix Theory 20/35

Page 46: Complex Langevin simulations of a finite density matrix

The shifted representation

shift µ away from the fermionic term by a COV

initially D =

(m iA−B + µ

iAT +BT + µ m

)Absorb µ into A with a COV A′ = A− iµ. The action in

terms of A′ and B is

S = Ntr(A′TA′−2iµA′+µ2 +BTB

)−Nf tr log

(m2 +X ′Y ′

)X ′ = A′ + iB and Y ′ = A′T − iBT . Now, the µ dependence

has shifted from the fermionic to the bosonic term.

Computing again the CL force term ...

Advantage of the shifted representation is that it starts in an

anti-Hermitian state, and since CL in non-deterministic, the

configurations could evolve to a different minimum.

Savvas Zafeiropoulos CL for Random Matrix Theory 20/35

Page 47: Complex Langevin simulations of a finite density matrix

The shifted representation

shift µ away from the fermionic term by a COV

initially D =

(m iA−B + µ

iAT +BT + µ m

)Absorb µ into A with a COV A′ = A− iµ. The action in

terms of A′ and B is

S = Ntr(A′TA′−2iµA′+µ2 +BTB

)−Nf tr log

(m2 +X ′Y ′

)X ′ = A′ + iB and Y ′ = A′T − iBT . Now, the µ dependence

has shifted from the fermionic to the bosonic term.

Computing again the CL force term ...

Advantage of the shifted representation is that it starts in an

anti-Hermitian state, and since CL in non-deterministic, the

configurations could evolve to a different minimum.

Savvas Zafeiropoulos CL for Random Matrix Theory 20/35

Page 48: Complex Langevin simulations of a finite density matrix

Shifted representation and cooling

0.7

0.75

0.8

0.85

0.9

0.95

1

1.05

1.1

0 1000 2000 3000 4000 5000 6000 7000 8000 9000 10000

NAH

step

no coolingNAH cooling

no cooling (shifted)NAH cooling (shifted)

0

0.05

0.1

0.15

0.2

0.25

0.3

0 1000 2000 3000 4000 5000 6000 7000 8000 9000 10000

NAH

step

no coolingNAH cooling

NAH as a function of Langevin time. Stephanov model (RHS), Osborn model (LHS). The Stephanov plot also

includes the values from the shifted representation. These start at 0 for t = 0, but quickly shoot up to meet the

unshifted curves. Although A and A′ start out very different, they coincide after thermalization. This means that⟨A′⟩

CL,shifted=

⟨A⟩CL,standard

− iµ, and thus they converge to the same solution. The advantage of the

shifted representation is that it starts in an anti-Hermitian state, and due to the fact that CL in non-deterministic,

the configurations could evolve to a different minimum.

Savvas Zafeiropoulos CL for Random Matrix Theory 21/35

Page 49: Complex Langevin simulations of a finite density matrix

Shifted representation and cooling

0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0 2000 4000 6000 8000 10000

NAH

step

1005 1006 10071005 1006 1007

0

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0 2000 4000 6000 8000 10000

NAH

step

4279 4280 4281 42824279 4280 4281 4282

NAH for the shifted representation of the Stephanov model as a function of Langevin time for 8× 8 block

matrices. The zoomed in plots show the evolution of NAH with the application of the cooling step. There are 50

gauge cooling transformations between each Langevin step.

Savvas Zafeiropoulos CL for Random Matrix Theory 22/35

Page 50: Complex Langevin simulations of a finite density matrix

The deformation technique

another idea Ito and Nishimura (2017) is to deform the Dirac operator,

to ”move” its smallest eigenvalues and then extrapolate to

zero deformation parameter at the end of the calculation.

deformation is achieved by a finite temperature term given by

the two lowest Matsubara frequencies ±πT

Z(m,µ;α) =

∫D[X,Y ] det

(m X + µ+ iΘ(α)

Y + µ+ iΘ(α) m

)

where D[X,Y ] = d[X,Y ]P (X,Y ) and Θ(α) is itself a

block-matrix

Θ(α) =

(α 0

0 −α

)where α can be thought as the lowest Matsubara frequency.

Savvas Zafeiropoulos CL for Random Matrix Theory 23/35

Page 51: Complex Langevin simulations of a finite density matrix

The deformation technique

another idea Ito and Nishimura (2017) is to deform the Dirac operator,

to ”move” its smallest eigenvalues and then extrapolate to

zero deformation parameter at the end of the calculation.

deformation is achieved by a finite temperature term given by

the two lowest Matsubara frequencies ±πT

Z(m,µ;α) =

∫D[X,Y ] det

(m X + µ+ iΘ(α)

Y + µ+ iΘ(α) m

)

where D[X,Y ] = d[X,Y ]P (X,Y ) and Θ(α) is itself a

block-matrix

Θ(α) =

(α 0

0 −α

)where α can be thought as the lowest Matsubara frequency.

Savvas Zafeiropoulos CL for Random Matrix Theory 23/35

Page 52: Complex Langevin simulations of a finite density matrix

The deformation technique

Beyond a critical value of α the eigenvalue spectrum opens up

and at this point chiral symmetry is restored. We can thus

extrapolate from higher values in α for which there are no

eigenvalues at the origin. In our studies we will see a gap

opening at α ≈ 1.0

But let’s see this in practice...

Savvas Zafeiropoulos CL for Random Matrix Theory 24/35

Page 53: Complex Langevin simulations of a finite density matrix

The deformation technique

Beyond a critical value of α the eigenvalue spectrum opens up

and at this point chiral symmetry is restored. We can thus

extrapolate from higher values in α for which there are no

eigenvalues at the origin. In our studies we will see a gap

opening at α ≈ 1.0

But let’s see this in practice...

Savvas Zafeiropoulos CL for Random Matrix Theory 24/35

Page 54: Complex Langevin simulations of a finite density matrix

The deformation technique

-2

-1

0

1

2

-0.6 -0.4 -0.2 0 0.2 0.4 0.6 0.8 1

α = 0.0α = 0.5

-2

-1

0

1

2

-0.6 -0.4 -0.2 0 0.2 0.4 0.6 0.8 1

α = 1.0α = 1.5

Scatter plots of eigenvalues from simulating with N = 24,dt = 5× 10−5, tend = 5.0, measured every 400 steps afterthermalization. Both plots show m = 0.2 and µ = 0.5 for varyingvalues of the ”temperature” α.

Savvas Zafeiropoulos CL for Random Matrix Theory 25/35

Page 55: Complex Langevin simulations of a finite density matrix

The deformation technique

1e-07

1e-06

1e-05

1e-04

1e-03

1e-02

1e-01

1800 2000 2200 2400 2600 2800 3000

(m,µ) = (0.2, 0.5)

P(|F

|)

|F |

α = 0.0α = 0.2α = 0.4α = 0.6α = 0.8α = 1.0α = 1.2

1e-07

1e-06

1e-05

1e-04

1e-03

1e-02

1e-01

1800 2000 2200 2400 2600 2800 3000

(m,µ) = (0.2, 0.35)

P(|F

|)

|F |

α = 0.0α = 0.2α = 0.4α = 0.6α = 0.8α = 1.0α = 1.2

The density of the CL forces for µ = 0.5 (LHS) and µ = 0.35 (RHS).

Data gathered with a tfinal = 100 run using dt = 5× 10−5. If the decay

fall is exponential (or faster) the CL will give the correct result but not if

it decays as power law (or slower). Define αc as the first α value that

gives power law decay.

Savvas Zafeiropoulos CL for Random Matrix Theory 26/35

Page 56: Complex Langevin simulations of a finite density matrix

The deformation technique

0

0.5

1

1.5

2

2.5

0 0.5 1 1.5 2

Analyticµ = 0.5

ℜ⟨ηη⟩

α

m = 0.1m = 0.2

Complex Langevinm = 0.1m = 0.2

−1

−0.5

0

0.5

1

1.5

2

2.5

0 0.5 1 1.5 2

Analyticµ = 0.5

ℜ⟨η

† η⟩

α

m = 0.1m = 0.2

Complex Langevinm = 0.1m = 0.2

Physical observables as a function of the parameter α. Analytic solutions(lines) for various values of the mass in addition to values from asimulation at N = 48 and (m,µ) = (0.2, 0.5). The parameters of thesimulation correspond to the solid analytic line. Chiral condensate (LHS),baryon number density (RHS).

Natural questions to ask: Which points do you include in your

extrapolation and which fitting ansatz do you use and what about the

phase transition for small masses?

Savvas Zafeiropoulos CL for Random Matrix Theory 27/35

Page 57: Complex Langevin simulations of a finite density matrix

Savvas Zafeiropoulos CL for Random Matrix Theory 28/35

Page 58: Complex Langevin simulations of a finite density matrix

Reweighted Complex Langevin

generate a CL trajectory for parameter values where complex

Langevin is correct

perform a reweighting of the trajectory to compute

observables in an extended range of the parameters where CL

used to fail

Savvas Zafeiropoulos CL for Random Matrix Theory 29/35

Page 59: Complex Langevin simulations of a finite density matrix

Reweighting

target ensemble with parameters ξ = (m,µ, β) (for the

general QCD case-drop β for RMT)

auxiliary ensemble with parameters ξ0 = (m0, µ0, β0)

Reweighting from auxiliary to target

〈O〉ξ =

∫dxw(x; ξ)O(x; ξ)∫

dxw(x; ξ)=

∫dxw(x; ξ0)

[w(x;ξ)w(x;ξ0)O(x; ξ)

]∫dxw(x; ξ0)

[w(x;ξ)w(x;ξ0)

]=〈 w(x;ξ)w(x;ξ0)O(x; ξ)〉ξ0〈 w(x;ξ)w(x;ξ0)〉ξ0

but now we have a complex weight w(x; ξ0) = e−S(x;ξ0) so we

need CL for this too!

Savvas Zafeiropoulos CL for Random Matrix Theory 30/35

Page 60: Complex Langevin simulations of a finite density matrix

Reweighting

target ensemble with parameters ξ = (m,µ, β) (for the

general QCD case-drop β for RMT)

auxiliary ensemble with parameters ξ0 = (m0, µ0, β0)

Reweighting from auxiliary to target

〈O〉ξ =

∫dxw(x; ξ)O(x; ξ)∫

dxw(x; ξ)=

∫dxw(x; ξ0)

[w(x;ξ)w(x;ξ0)O(x; ξ)

]∫dxw(x; ξ0)

[w(x;ξ)w(x;ξ0)

]=〈 w(x;ξ)w(x;ξ0)O(x; ξ)〉ξ0〈 w(x;ξ)w(x;ξ0)〉ξ0

but now we have a complex weight w(x; ξ0) = e−S(x;ξ0) so we

need CL for this too!

Savvas Zafeiropoulos CL for Random Matrix Theory 30/35

Page 61: Complex Langevin simulations of a finite density matrix

m-scan for µ = 1

reweighted from an auxiliary ensemble with m0 = 4 and µ0 = 1

using O(15000) confs

0.5

1

1.5

2

2.5

0 0.5 1 1.5 2

ℜ⟨η

† η⟩

m

CLRCL

analytic

〈η†η〉 for µ = 1 and n = 6

−0.4

−0.2

0

0.2

0.4

0.6

0.8

1

0 0.5 1 1.5 2

ℜ⟨ηη⟩

m

CLRCL

analytic

〈ηη〉 for µ = 1 and n = 6

Savvas Zafeiropoulos CL for Random Matrix Theory 31/35

Page 62: Complex Langevin simulations of a finite density matrix

m-scan for µ = 1

Auxiliary ensemble m0 = 1.3, µ0 = µ = 1.0 using O(560000) confs

0.5

1

1.5

2

2.5

0 0.2 0.4 0.6 0.8 1 1.2

ℜ⟨η

† η⟩

m

CLRCLx100analytic

〈η†η〉 for µ = 1 and n = 24

−0.4

−0.2

0

0.2

0.4

0.6

0.8

1

0 0.2 0.4 0.6 0.8 1 1.2

ℜ⟨ηη⟩

m

CLRCLx100analytic

〈ηη〉 for µ = 1 and n = 24

The number of confs needed, builds up very rapidly. So one has to

”just” to generate an auxiliary trajectory long enough to overcome the

sign problem.

Savvas Zafeiropoulos CL for Random Matrix Theory 32/35

Page 63: Complex Langevin simulations of a finite density matrix

m-scan for µ = 1

Auxiliary ensemble m0 = 1.3, µ0 = µ = 1.0 using O(122000000)

confs

0.5

1

1.5

2

2.5

0 0.2 0.4 0.6 0.8 1 1.2

µ = 1.0

N = 48

ℜ⟨η

† η⟩

m

CLRCL

analytic

〈η†η〉 for µ = 1 and n = 48

−0.4

−0.2

0

0.2

0.4

0.6

0.8

1

0 0.2 0.4 0.6 0.8 1 1.2

µ = 1.0

N = 48

ℜ⟨ηη⟩

m

RCLCL

analytic

〈ηη〉 for µ = 1 and n = 48

if you (or the computer) work(s) hard enough you can also deal with the

matrices of the original size that we were dealing with n = 48

Savvas Zafeiropoulos CL for Random Matrix Theory 33/35

Page 64: Complex Langevin simulations of a finite density matrix

Conclusions and outlook

studied the CL algorithm for an RMT model for QCD/

comparing numerical with exact analytical results for all the

range of parameters (m, µ)

compared to previous similar studies this model possesses a

phase transition to a phase with non-zero baryon density

fails to converge to QCD and it converges to |QCD|partial attempt to fix the issues via RCL procedure → correct

results, even when CL does not work for the target ensemble

gauge cooling or the deformation technique seem unable to

overcome the pathologies of this model

Thanks a lot for your attention and many thanks to the organizers

for their warm hospitality!!!Savvas Zafeiropoulos CL for Random Matrix Theory 34/35

Page 65: Complex Langevin simulations of a finite density matrix

for upcoming results . . .

Savvas Zafeiropoulos CL for Random Matrix Theory 35/35

Page 66: Complex Langevin simulations of a finite density matrix

The analytical solution

Halasz, Jackson, Verbaarschot(1997)∫D[. . .] exp

[−i∑Nf

k=1 ψk ∗

(m iW + µ

iW † + µ m

)ψk

]e−nΣ2TrWW †

perform the W integration

∫D[. . .]e

[− 1nΣ2 ψ

f ∗Lkψ

fR iψ

g ∗R iψ

gL k+m

(ψf ∗R iψ

fR i+ψ

f ∗Lkψ

gL k

)+µ(ψf ∗R iψ

fL i+ψ

f ∗Lkψ

fR k

)]write the four-fermion term as a difference of two squares and

linearize via a Hubbard-Stratonovich trafo

exp(−AQ2) ∼∫dσ exp(− σ2

4A − iQσ)

Savvas Zafeiropoulos CL for Random Matrix Theory 1/5

Page 67: Complex Langevin simulations of a finite density matrix

The analytical solution

then one carries out the Grassmann integrals

Z(m,µ) =∫Dσ exp[−nΣ2Trσσ†]detn

(σ +m µ

µ σ† +m

)which for one-flavor and Σ = 1 becomes

ZNf=1(m,µ) =∫dσdσ∗e−nσ

2(σσ∗ +m(σ + σ∗) +m2 − µ2)n

Savvas Zafeiropoulos CL for Random Matrix Theory 2/5

Page 68: Complex Langevin simulations of a finite density matrix

The analytical solution

in polar coordinates after the angular integration

ZNf=1(m,µ) = πe−nm2 ∫∞

0 du(u− µ2)nI0(2mn√u)e−nu in the

thermodynamic limit one can perform a saddle point analysis

I0(z) ∼ ez/√

2πz

and the saddle point equation takes the form1

u−µ2 = 1− m√u

Savvas Zafeiropoulos CL for Random Matrix Theory 3/5

Page 69: Complex Langevin simulations of a finite density matrix

The analytical solution

A 1st order phase transition takes place at the points where

|Zu=ub | = |Zu=ur |, with ub and ur two different solutions of the

saddle-point equation give the same free-energy. This condition

can be rewritten as |(ub − µ2)e2m√ub−ub | = |(µ2 − ur)e2m

√ur−ur |.

A general solution is quite cumbersome, but for m→ 0 we find

that ur = 0 and ub = 1 + µ2. This leads to the critical curve

Re[1 + µ2 + log µ2

]= 0

which for real µ, µc = 0.527 . . .

Savvas Zafeiropoulos CL for Random Matrix Theory 4/5

Page 70: Complex Langevin simulations of a finite density matrix

Phase Quenched QCD

ignore the complex phase of the fermion determinant

Zpq = Ziso =∫dA| det(D(µ))|2e−Sg

|det(D(µ))|2 = detD(µ)(det(D(µ)))∗ =

detD(µ) detD(−µ)

since γ5(γµDµ +m− µγ0)γ5 = (γµD

µ +m+ µγ0)†

〈O〉pq = 1Zpq∫dAO|detD(µ)|2e−Sg

this theory has a different phase diagram and different

properties than QCD

for T << and µ >> → Bose condensation of charged pions

Savvas Zafeiropoulos CL for Random Matrix Theory 5/5

Page 71: Complex Langevin simulations of a finite density matrix

Phase Quenched QCD

ignore the complex phase of the fermion determinant

Zpq = Ziso =∫dA| det(D(µ))|2e−Sg

|det(D(µ))|2 = detD(µ)(det(D(µ)))∗ =

detD(µ) detD(−µ)

since γ5(γµDµ +m− µγ0)γ5 = (γµD

µ +m+ µγ0)†

〈O〉pq = 1Zpq∫dAO|detD(µ)|2e−Sg

this theory has a different phase diagram and different

properties than QCD

for T << and µ >> → Bose condensation of charged pions

Savvas Zafeiropoulos CL for Random Matrix Theory 5/5

Page 72: Complex Langevin simulations of a finite density matrix

Phase Quenched QCD

ignore the complex phase of the fermion determinant

Zpq = Ziso =∫dA| det(D(µ))|2e−Sg

|det(D(µ))|2 = detD(µ)(det(D(µ)))∗ =

detD(µ) detD(−µ)

since γ5(γµDµ +m− µγ0)γ5 = (γµD

µ +m+ µγ0)†

〈O〉pq = 1Zpq∫dAO|detD(µ)|2e−Sg

this theory has a different phase diagram and different

properties than QCD

for T << and µ >> → Bose condensation of charged pions

Savvas Zafeiropoulos CL for Random Matrix Theory 5/5

Page 73: Complex Langevin simulations of a finite density matrix

Phase Quenched QCD

ignore the complex phase of the fermion determinant

Zpq = Ziso =∫dA| det(D(µ))|2e−Sg

|det(D(µ))|2 = detD(µ)(det(D(µ)))∗ =

detD(µ) detD(−µ)

since γ5(γµDµ +m− µγ0)γ5 = (γµD

µ +m+ µγ0)†

〈O〉pq = 1Zpq∫dAO|detD(µ)|2e−Sg

this theory has a different phase diagram and different

properties than QCD

for T << and µ >> → Bose condensation of charged pions

Savvas Zafeiropoulos CL for Random Matrix Theory 5/5

Page 74: Complex Langevin simulations of a finite density matrix

Phase Quenched QCD

ignore the complex phase of the fermion determinant

Zpq = Ziso =∫dA| det(D(µ))|2e−Sg

|det(D(µ))|2 = detD(µ)(det(D(µ)))∗ =

detD(µ) detD(−µ)

since γ5(γµDµ +m− µγ0)γ5 = (γµD

µ +m+ µγ0)†

〈O〉pq = 1Zpq∫dAO|detD(µ)|2e−Sg

this theory has a different phase diagram and different

properties than QCD

for T << and µ >> → Bose condensation of charged pions

Savvas Zafeiropoulos CL for Random Matrix Theory 5/5