The generic Mott transition in the sine-Gordon model through an embedded worm algorithm
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: I'm Kai.
Mira: And I'm Mira, here with Lev.
Kai: We're looking at the paper: "The generic Mott transition in the sine-Gordon model through an embedded worm algorithm".
Mira: Here's the gist of the paper. The generic Mott transition in one-dimensional quantum systems can be described by the sine-Gordon model with a tilt via bosonization Because the configuration space of the sine-Gordon model separates into distinct topological sectors, standard local Monte Carlo schemes are limited to very small system sizes To overcome this limitation, we introduce the smooth worm (SmoWo) Monte Carlo algorithm which enlarges the configuration space to allow smooth transitions between topological sectors The method combines worm updates with event-chain Monte Carlo moves Thanks to the substantial acceleration achieved by the SmoWo algorithm, we are able to simulate large system sizes, providing a precise picture of the different phases and critical behaviour of the sine-Gordon model.
Kai: Model Formulation and Bosonization The study focuses on the generic Mott transition in 1D quantum systems using a tight-binding model for spinless fermions, which is mapped onto the sine-Gordon model via bosonization At low energies, this involves working with two bosonic fields and identifying particle excitations as kinks or half-kinks in the field representation.
Mira: The resulting bosonized Hamiltonian is given by a sine-Gordon action The path integral formulation of the partition function is expressed in terms of the Euclidean action S
ϕ: = ˆx,τ 1/2πK u(∂xϕ) 2 + 1/u (∂τϕ) 2 - g cos(4ϕ) + µ π/∇ϕ, (8) and the boundary conditions are crucial for recovering correct physics.
Kai: Algorithm Development The standard Metropolis–Hastings algorithm is inefficient because its acceptance rate for topological updates is exponentially small To address this, the Smooth worm algorithm (SmoWo) is introduced, which combines worm updates with local moves of the event-chain Monte Carlo (ECMC) scheme The SmoWo algorithm operates in an enlarged configuration space where topological sectors are smoothly connected.
Title and authors: Kai: Let's talk about who wrote this, the authors of "The generic Mott transition in the sine-Gordon model through an embedded worm algorithm". They are Oscar Bouverot-Dupuis, Laura Foini, and Alberto Rosso. Mira, what's your take on their focus?
Mira: They are focusing on studying the 1D generic Mott transition by mapping it to the sine-Gordon model using bosonization <ref:2510.20901#pg1>. This approach allows them to directly compare their numerical study with analytical results for that model.
Lev: It's interesting that they chose this approach rather than simulating a microscopic quantum Hamiltonian directly, which is what you often see in other quantum Monte Carlo studies.
Kai: They specifically chose the bosonized picture because it serves as a starting point for Monte Carlo simulations of more complicated bosonized systems later on.
Mira: And they work in the grand-canonical ensemble, which complements canonical-ensemble algorithms that we often use.
Lev: That means their findings are relevant to how we approach simulations in these kinds of interacting fermion systems.
Kai: So, they're not just looking at a static property; they're exploring the dynamics across different ensembles to see what happens.
The paper's summary: Kai: So, let's talk about what the paper actually summarizes regarding their findings on "The generic Mott transition in the sine-Gordon model through an embedded worm algorithm". They’re showing how they tackle the problem of sampling those separated topological sectors.
Mira: The summary explains that by using the SmoWo algorithm, which smooths out the configuration space, they can overcome that limitation of standard local Monte Carlo schemes to sample these sectors effectively.
Lev: So they are using this new algorithm to get access to parts of the phase diagram where traditional methods just couldn't go because it would take an exponential amount of time.
Kai: They're showing that the acceleration achieved by SmoWo allows them to simulate large system sizes, which gives them a much more precise picture of the different phases and critical behavior.
Mira: Furthermore, they are providing insights into the phase diagram by looking at scalar observables like doping delta rho, which vanishes in the Mott insulator and concentrates around kappa times mu over R in the Luttinger liquid.
Lev: So they're connecting microscopic excitations to macroscopic properties in a way that’s useful for understanding these transitions.
Kai: And they are also linking the phase-phase two-point function, C theta(p), which is related to the worm configuration, to its time behavior at criticality, suggesting an anomalous dimension of two point nine nine plus or minus zero point zero two <ref:2510.20901#pg2>.
The paper's improvements: Kai: Now let's discuss the specific improvements they propose in "The generic Mott transition in the sine-Gordon model through an embedded worm algorithm". They are highlighting how their SmoWo method is better than the standard Metropolis–Hastings algorithm.
Mira: The main improvement is introducing the smooth worm algorithm itself, which enlarges configuration space to allow smooth transitions between topological sectors, overcoming that limitation of standard local Monte Carlo schemes.
Lev: And they combine that with event-chain Monte Carlo moves to perform non reversible moves, which is what gives it the enhanced sampling efficiency.
Kai: The result of this combination is a substantial acceleration, allowing them to simulate large system sizes and get a precise picture of the sine-Gordon model's phases and critical behavior.
Mira: They also show that this algorithm has an algorithmic dynamical critical exponent z alg point approximately four point eight for the SmoWo algorithm, which is lower than the five point eight you see for the standard worm update algorithm.
Lev: That difference in z alg points is significant because it shows how much better the new method handles those dynamics compared to what you'd expect from a naive approach.
Conclusion: Kai: So, to wrap up on "The generic Mott transition in the sine-Gordon model through an embedded worm algorithm", they proved this SmoWo algorithm is powerful enough to clearly identify the two phases of the model.
Mira: They successfully identify the Luttinger liquid with quasi long range order and the Mott insulator with its characteristic Hubbard bands. They also found critical exponents z equals two point zero zero plus or minus zero point zero one, nu equals zero point five one plus or minus zero point zero one, and eta equals two point nine nine plus or minus zero point zero two.
Lev: Those critical exponents are comparable to analytical results, which is a strong piece of evidence for the physical picture they're describing.
Kai: They also noted that the critical point isn't a Luttinger liquid which has z equals one; instead, the crossover time defines a missing correlation length ξ equal to the particle time tau divided by z which diverges as mu approaches mu minus c.
Mira: And at that transition energy of two mu plus or minus c it increases to a finite value of two mu plus or minus c, and the roles of xi h tau and xi p tau would then be reversed, with xi h tau diverging at the transition.
Lev: It's interesting how they suggest that the Mott insulator can also be exited through negative mu plus or minus c instead of just positive mu plus or minus c.
Kai: They conclude that the sine-Gordon model has two fixed points, but their enlarged model has three, and SmoWo proved powerful enough to clearly identify those two phases.
Mira: So it's a lot of work showing how this algorithm works across different regimes in the paper "The generic Mott transition in the sine-Gordon model through an embedded worm algorithm".
Lev: For me, it just shows that for complex bosonized systems, having a clever sampling method can make the difference between getting stuck or actually seeing the physics.
Universit´e Paris Saclay · IPhT · CNRS
cond-mat.str-el
Submitted: 2025-10-23
Updated: 2026-11-05
Comments: 35 pages, 20 figures
DOI: 10.1103/4k6t-lnzp
Code: https://github.com/OscarBouverot-Dupuis/algo-phys
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 76/100
The gist: The generic Mott transition in one-dimensional quantum systems can be described by the sine-Gordon model with a tilt via bosonization Because the configuration space of the sine-Gordon model…
Key concepts
- Sine-Gordon Model
- This is a mathematical model used to describe generic Mott transitions in one-dimensional quantum systems. It arises from mapping the tight-binding model of spinless fermions onto two bosonic fields, where particle excitations are represented as kinks or half-kinks in the field representation.
- Smooth Worm (SmoWo) Algorithm
- This is an advanced Monte Carlo simulation technique designed to sample the sine-Gordon model efficiently. It combines traditional worm updates with Event-Chain Monte Carlo moves to smoothly connect different topological sectors of the configuration space, allowing simulations on large system sizes.
- Luttinger Liquid (LL) and Mott Insulator (MI)
- These are the two distinct phases identified in the model's phase diagram. The LL exhibits quasi-long-range order, while the MI is characterized by characteristic Hubbard bands. Observables like doping ($ ho$) help distinguish between these phases.
- Critical Exponents
- These are specific numbers (like z=2.00 and eta=2.99) that describe how physical quantities behave near a critical point in the system. The SmoWo algorithm successfully retrieved these values, confirming the model's critical behavior against analytical predictions.
Terminology
Summary
The generic Mott transition in one-dimensional quantum systems can be described by the sine-Gordon model with a tilt via bosonization Because the configuration space of the sine-Gordon model separates into distinct topological sectors, standard local Monte Carlo schemes are limited to very small system sizes To overcome this limitation, we introduce the smooth worm (SmoWo) Monte Carlo algorithm which enlarges the configuration space to allow smooth transitions between topological sectors The method combines worm updates with event-chain Monte Carlo moves Thanks to the substantial acceleration achieved by the SmoWo algorithm, we are able to simulate large system sizes, providing a precise picture of the different phases and critical behaviour of the sine-Gordon model. p. 0 The generic Mott transition in the sine-Gordon model through an embedded
worm algorithm
Oscar Bouverot-Dupuis,1, 2 Laura Foini,2 and Alberto Rosso1
1Universit´e Paris Saclay, CNRS, LPTMS, 91405, Orsay, France
2
IPhT, CNRS, CEA, Universit´e Paris Saclay, 91191 Gif-sur-Yvette, France
(Dated: October 27, 2025)
The generic Mott transition in one-dimensional quantum systems can be described by the sineGordon model with a tilt via bosonization. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes.Where the paper says it
Model Formulation and Bosonization
The study focuses on the generic Mott transition in 1D quantum systems using a tight-binding model for spinless fermions, which is mapped onto the sine-Gordon model via bosonization At low energies, this involves working with two bosonic fields and identifying particle excitations as kinks or half-kinks in the field representation. The resulting bosonized Hamiltonian is given by a sine-Gordon action The path integral formulation of the partition function is expressed in terms of the Euclidean action S[ϕ] = ˆx,τ 1/2πK u(∂xϕ) 2 + 1/u (∂τϕ) 2 - g cos(4ϕ) + µ π/∇ϕ, (8) and the boundary conditions are crucial for recovering correct physics. p. 2 In the path-integral
formalism, integrating out the field θ shows that
the grand-canonical equilibrium partition function
Z = Tr e
−βHˆ
at inverse temperature β = 1/T can
be expressed as
Z =
X
+∞
Nx,Nτ =−∞
ˆ
Dϕ
ϕ(0,τ)=ϕ(L,τ)+πNx
ϕ(x,0)=ϕ(x,β)+πNτ
e
−S[ϕ]
, (7)
where the Euclidean action is the sine-Gordon action
S[ϕ] = ˆ
x,τ
1
2πK
u(∂xϕ)
2 +
1
u
(∂τϕ)
2
− g cos(4ϕ) + µ
π
∂xϕ, (8)
with the notation ´
x,τ =
´ L
0
dx
´ β
0
dτ . The boundary
conditions in the path integral (7) are crucial to recover the correct physics.Where the paper says it
Algorithm Development
The standard Metropolis–Hastings algorithm is inefficient because its acceptance rate for topological updates is exponentially small To address this, the Smooth worm algorithm (SmoWo) is introduced, which combines worm updates with local moves of the event-chain Monte Carlo (ECMC) scheme The SmoWo algorithm operates in an enlarged configuration space where topological sectors are smoothly connected. The ECMC algorithm is a class of continuous-time and rejection-free algorithms that perform non-reversible moves, which are used to smooth the worm throughout its construction. p. 5 To overcome this issue, we propose a Worm algorithm (Wo) and its enhanced version, the Smooth
Worm algorithm (SmoWo), which perform two types
of updates:
• local ϕ updates at constant Nx and Nτ using
the Event-Chain Monte Carlo (ECMC) algorithm,
• Nx and Nτ updates using the worm algorithm,
enhanced with ECMC moves for the SmoWo
algorithm. In a nutshell, ECMC algorithms [27, 28] are a class of
continuous-time and rejection-free algorithms that
are non-reversible as they do not satisfy detailed balance but only the weaker global balance.Where the paper says it
Performance and Critical Exponents
The performance of the SmoWo algorithm is assessed by calculating the integrated autocorrelation time, which scales as O(L 4.8) for a system of size ∼ L × L squared This scaling is an improvement over the exponential scaling of the naive Metropolis algorithm. p. 7 Although this value of zalg. is quite high, the polynomial scaling of this algorithm is a dramatic improvement over the exponential scaling of the naive
Metropolis algorithm described in Sec. It appears that for both observables τint ∼ L
zalg. 8 the algorithmic dynamical exponent (not
to be confused with the dynamical critical exponent
z). The net result is a decrease of the algorithmic dynamical critical exponent from zalg. 8 for the Wo
algorithm to zalg.Where the paper says it
Where the paper says it
Where the paper says it
Physical Insights and Observables
The phase diagram shows two distinct phases: the Luttinger liquid (LL) with quasi-long range order and the Mott insulator (MI) with its characteristic Hubbard bands Scalar observables include the doping δρ ≡ Nx/L, which vanishes in the MI and concentrates around KRµR in the LL. The phase-phase two-point function Cθ(p) is linked to the worm configuration, and its time behavior at criticality suggests an anomalous dimension η = 2. p. 0 Scalar observables 10
C. Phase-phase two-point function 11
D.Where the paper says it
Conclusion
The SmoWo algorithm proves powerful enough to clearly identify the two phases of the model and retrieve critical exponents z = 2.00 ± 0.01, ν = 0.51 ± 0.01 and η = 2.99 ± 0.02, all of which compare favourably with analytical results The algorithm is relevant for studying any bosonized system in the grand-canonical ensemble. p. 1 This enables direct comparison with analytical results on the same model and serves as a
starting point for Monte Carlo simulations of more
complicated bosonized systems. We work in the
grand-canonical ensemble, thereby complementing
the canonical-ensemble algorithm of Ref. The net result is a decrease of the algorithmic dynamical critical exponent from zalg. 8 for the Wo
algorithm to zalg. Although this value of zalg. is quite high, the polynomial scaling of this algorithm is a dramatic improvement over the exponential scaling of the naive
Metropolis algorithm described in Sec. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes. To overcome this limitation, we introduce the smooth worm (SmoWo)
Monte Carlo algorithm which enlarges the configuration space to allow smooth transitions between
topological sectors. Analytically, apart from strongcoupling expansions of the Bose Hubbard model [9],
most results rely on the description of the transition through the sine–Gordon model via bosonization [10–14]. It was thus established that 1D Mott
transitions fall into two distinct universality classes:
varying the interaction strength at fixed commensurate densities leads to a Berezinskii–Kosterlitz–
arXiv:2510. Phase diagram of the Mott transition. As g is
increased, the lobe of the Mott insulator (MI) eats on
the Luttinger liquid (LL). This shows that the topological variables Nx, Nτ
decouple from the periodic field φ. The action for
φ is that of a Luttinger liquid (LL). This shows that the topological variables Nx, Nτ
decouple from the periodic field φ. The action for
φ is that of a Luttinger liquid (LL). The generic Mott transition in the sine-Gordon model through an embedded
worm algorithm
Oscar Bouverot-Dupuis,1, 2 Laura Foini,2 and Alberto Rosso1
1Universit´e Paris Saclay, CNRS, LPTMS, 91405, Orsay, France
2
IPhT, CNRS, CEA, Universit´e Paris Saclay, 91191 Gif-sur-Yvette, France
(Dated: October 27, 2025)
The generic Mott transition in one-dimensional quantum systems can be described by the sineGordon model with a tilt via bosonization. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes. The generic Mott transition in the sine-Gordon model through an embedded
worm algorithm
Oscar Bouverot-Dupuis,1, 2 Laura Foini,2 and Alberto Rosso1
1Universit´e Paris Saclay, CNRS, LPTMS, 91405, Orsay, France
2
IPhT, CNRS, CEA, Universit´e Paris Saclay, 91191 Gif-sur-Yvette, France
(Dated: October 27, 2025)
The generic Mott transition in one-dimensional quantum systems can be described by the sineGordon model with a tilt via bosonization. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Appendix Details
The appendix details the bosonization approach used in this work, including bosonization conventions and the path integral formulation of the partition function It also provides a proof of the validity of the algorithm and implementation details. The appendix also contains pseudocode implementations for the Wo and SmoWo algorithms. p. 8 A proof of the
validity of the algorithm and a pseudocode implementation are given respectively in Appendix B and
C 2. Performance wise, the integrated autocorrelation
time of the SmoWo algorithm is given in Fig. For the algorithm described above, there are four
types of event times to compute when moving fi
along e: the quadratic ones t
i,j
q
, the cosine one t
i
c
,
the refreshment one tr and the worm one tw. These
event times can be explicitly computed using inversion sampling (see Appendix C 1). For the algorithm described above, there are four
types of event times to compute when moving fi
along e: the quadratic ones t
i,j
q
, the cosine one t
i
c
,
the refreshment one tr and the worm one tw. These
event times can be explicitly computed using inversion sampling (see Appendix C 1). For the algorithm described above, there are four
types of event times to compute when moving fi
along e: the quadratic ones t
i,j
q
, the cosine one t
i
c
,
the refreshment one tr and the worm one tw. These
event times can be explicitly computed using inversion sampling (see Appendix C 1). To overcome this issue, we propose a Worm algorithm (Wo) and its enhanced version, the Smooth
Worm algorithm (SmoWo), which perform two types
of updates:
• local ϕ updates at constant Nx and Nτ using
the Event-Chain Monte Carlo (ECMC) algorithm,
• Nx and Nτ updates using the worm algorithm,
enhanced with ECMC moves for the SmoWo
algorithm. In a nutshell, ECMC algorithms [27, 28] are a class of
continuous-time and rejection-free algorithms that
are non-reversible as they do not satisfy detailed balance but only the weaker global balance.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Numerical Results Summary
The numerical results show that for µ 0 and δρ = κ = ρs = 0, meaning the field ϕ gets trapped in one minimum and kinks are suppressed: this the MI For µ > µc, the field ϕ is tilted since δρ > 0 and fluctuates a lot since κ, ρs > 0 and C2kF is small (and decreases with system size): this is the LL. The transition at the tip of the lobe belongs to the BKT (Berezinskii–Kosterlitz–Thouless) universality class. p. 9 In this work, we focus on the generic transition which
is crossed by varying µ as shown by the red arrow. The
transition at the tip of the lobe is different as it belongs to
the BKT (Berezinskii–Kosterlitz–Thouless) universality
class [2, 3, 49]. 12 × 10−2
)
β
(and similarly for β ↔ L). This is a ridiculously
small acceptance rate which, along with its exponential scaling, should discourage anyone from trying to attempt large system-size simulations with the
Metropolis–Hastings algorithm. (26)
We extract from it the integrated autocorrelation
time τ
O
int =
1
2
P+∞
t=−∞ CO(t) which is the time
needed to generate a new independent sample once
the Markov process has thermalized (or mixed [45]). To assess the critical slowing-down of the algorithm,
we perform this analysis at the critical point of the
generic Mott transition by scaling β ∼ L
2
since the
dynamical critical exponent is z = 2 (see Sec. Analytically, apart from strongcoupling expansions of the Bose Hubbard model [9],
most results rely on the description of the transition through the sine–Gordon model via bosonization [10–14]. It was thus established that 1D Mott
transitions fall into two distinct universality classes:
varying the interaction strength at fixed commensurate densities leads to a Berezinskii–Kosterlitz–
arXiv:2510. Phase diagram of the Mott transition. As g is
increased, the lobe of the Mott insulator (MI) eats on
the Luttinger liquid (LL). An extra hole (or spin down) creates a +π-kink. Middle:
With a background density of 1 particle every two sites,
a particle (hole) can decay into two half-particles (halfholes) corresponding to two consecutive particles (holes). (31)
This is the Mott insulator (MI). We thus expect the
existence of two critical points ±µc (see Fig.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
References
[1] N. F. Mott, Metal-Insulator Transition, Rev. p. 0 Pseudocode implementations 32
References 34
I. INTRODUCTION
Over the past decades, the Mott transition [1–
4] describing metal-insulator transitions driven by
strong electronic interactions has attracted a great
deal of interest. The generic Mott transition in the sine-Gordon model through an embedded
worm algorithm
Oscar Bouverot-Dupuis,1, 2 Laura Foini,2 and Alberto Rosso1
1Universit´e Paris Saclay, CNRS, LPTMS, 91405, Orsay, France
2
IPhT, CNRS, CEA, Universit´e Paris Saclay, 91191 Gif-sur-Yvette, France
(Dated: October 27, 2025)
The generic Mott transition in one-dimensional quantum systems can be described by the sineGordon model with a tilt via bosonization. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes. Pseudocode implementations 32
References 34
I. INTRODUCTION
Over the past decades, the Mott transition [1–
4] describing metal-insulator transitions driven by
strong electronic interactions has attracted a great
deal of interest. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes. To overcome this limitation, we introduce the smooth worm (SmoWo)
Monte Carlo algorithm which enlarges the configuration space to allow smooth transitions between
topological sectors. While in dimensions greater than
one, a comprehensive theoretical framework remains elusive despite significant numerical efforts
[5, 6], the one-dimensional (1D) case has seen major advances. Numerically, the Bose Hubbard model
has become a paradigmatic model to observe the
Mott transition with quantum Monte Carlo algorithms [7] and the density matrix renormalization
group (DMRG) [8]. Analytically, apart from strongcoupling expansions of the Bose Hubbard model [9],
most results rely on the description of the transition through the sine–Gordon model via bosonization [10–14]. It was thus established that 1D Mott
transitions fall into two distinct universality classes:
varying the interaction strength at fixed commensurate densities leads to a Berezinskii–Kosterlitz–
arXiv:2510. While in dimensions greater than
one, a comprehensive theoretical framework remains elusive despite significant numerical efforts
[5, 6], the one-dimensional (1D) case has seen major advances. Numerically, the Bose Hubbard model
has become a paradigmatic model to observe the
Mott transition with quantum Monte Carlo algorithms [7] and the density matrix renormalization
group (DMRG) [8]. In the path-integral
formalism, integrating out the field θ shows that
the grand-canonical equilibrium partition function
Z = Tr e
−βHˆ
at inverse temperature β = 1/T can
be expressed as
Z =
X
+∞
Nx,Nτ =−∞
ˆ
Dϕ
ϕ(0,τ)=ϕ(L,τ)+πNx
ϕ(x,0)=ϕ(x,β)+πNτ
e
−S[ϕ]
, (7)
where the Euclidean action is the sine-Gordon action
S[ϕ] = ˆ
x,τ
1
2πK
u(∂xϕ)
2 +
1
u
(∂τϕ)
2
− g cos(4ϕ) + µ
π
∂xϕ, (8)
with the notation ´
x,τ =
´ L
0
dx
´ β
0
dτ . The boundary
conditions in the path integral (7) are crucial to recover the correct physics. In the path-integral
formalism, integrating out the field θ shows that
the grand-canonical equilibrium partition function
Z = Tr e
−βHˆ
at inverse temperature β = 1/T can
be expressed as
Z =
X
+∞
Nx,Nτ =−∞
ˆ
Dϕ
ϕ(0,τ)=ϕ(L,τ)+πNx
ϕ(x,0)=ϕ(x,β)+πNτ
e
−S[ϕ]
, (7)
where the Euclidean action is the sine-Gordon action
S[ϕ] = ˆ
x,τ
1
2πK
u(∂xϕ)
2 +
1
u
(∂τϕ)
2
− g cos(4ϕ) + µ
π
∂xϕ, (8)
with the notation ´
x,τ =
´ L
0
dx
´ β
0
dτ . The boundary
conditions in the path integral (7) are crucial to recover the correct physics. The generic Mott transition in the sine-Gordon model through an embedded
worm algorithm
Oscar Bouverot-Dupuis,1, 2 Laura Foini,2 and Alberto Rosso1
1Universit´e Paris Saclay, CNRS, LPTMS, 91405, Orsay, France
2
IPhT, CNRS, CEA, Universit´e Paris Saclay, 91191 Gif-sur-Yvette, France
(Dated: October 27, 2025)
The generic Mott transition in one-dimensional quantum systems can be described by the sineGordon model with a tilt via bosonization. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes. by a downward kink of amplitude π (see Fig. 1, top)
since
ˆ L
0
dx(ˆρ(x) − ρ0) = ϕˆ(0) − ϕˆ(L)
π
. The generic Mott transition in the sine-Gordon model through an embedded
worm algorithm
Oscar Bouverot-Dupuis,1, 2 Laura Foini,2 and Alberto Rosso1
1Universit´e Paris Saclay, CNRS, LPTMS, 91405, Orsay, France
2
IPhT, CNRS, CEA, Universit´e Paris Saclay, 91191 Gif-sur-Yvette, France
(Dated: October 27, 2025)
The generic Mott transition in one-dimensional quantum systems can be described by the sineGordon model with a tilt via bosonization. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes. The worm algorithm [25, 26] can
be applied to any model whose configurations are
made of loops, which for the sine-Gordon model we
have identified in the current-fluctuation representation (16). By allowing intermediate configurations
to have one open path (the “worm”), the worm algorithm drastically reduces the critical slowing down
observed near phase transitions. The latter is also well-known for describing
commensurate-incommensurate transitions in uniaxial surface structures [15–17] and related systems
[18, 19]. Even within the sine-Gordon picture, however, its analysis proved non-trivial as a complete
picture of the transition only came through the combination of many integrability [17, 20, 21] and fieldtheoretical techniques [3, 16, 22, 23]. Thouless (BKT) transition, while doping the system gives rise to the generic (or Mott-δ) transition. The latter is also well-known for describing
commensurate-incommensurate transitions in uniaxial surface structures [15–17] and related systems
[18, 19]. Thouless (BKT) transition, while doping the system gives rise to the generic (or Mott-δ) transition. The latter is also well-known for describing
commensurate-incommensurate transitions in uniaxial surface structures [15–17] and related systems
[18, 19]. Indeed, cluster algorithms used for bosonized systems [24, 39, 40] cannot
change the boundary conditions, and, furthermore,
crucially rely on the particle-hole symmetry ϕ → −ϕ
which is broken by the chemical potential µ. To overcome this issue, we propose a Worm algorithm (Wo) and its enhanced version, the Smooth
Worm algorithm (SmoWo), which perform two types
of updates:
• local ϕ updates at constant Nx and Nτ using
the Event-Chain Monte Carlo (ECMC) algorithm,
• Nx and Nτ updates using the worm algorithm,
enhanced with ECMC moves for the SmoWo
algorithm. The algorithm combines updates from
the worm algorithm [25, 26] with local moves of the
event-chain Monte Carlo (ECMC) scheme [27, 28]. The worm algorithm is designed to sample loop models and has already proven effective to study Mott
transitions in coarse-grained (2 + 1)D models [29–
32]. The
difference between both scalings is traced back to the
fact that the worm algorithm can reach many configurations and therefore select a typical one, while
the rigid Metropolis–Hastings updates only propose
very atypical configurations. 20 40 60 80 100
L
104
105
106
107
τint (sweeps)
L
4. Numerically, the Bose Hubbard model
has become a paradigmatic model to observe the
Mott transition with quantum Monte Carlo algorithms [7] and the density matrix renormalization
group (DMRG) [8]. Analytically, apart from strongcoupling expansions of the Bose Hubbard model [9],
most results rely on the description of the transition through the sine–Gordon model via bosonization [10–14]. The generic Mott transition in the sine-Gordon model through an embedded
worm algorithm
Oscar Bouverot-Dupuis,1, 2 Laura Foini,2 and Alberto Rosso1
1Universit´e Paris Saclay, CNRS, LPTMS, 91405, Orsay, France
2
IPhT, CNRS, CEA, Universit´e Paris Saclay, 91191 Gif-sur-Yvette, France
(Dated: October 27, 2025)
The generic Mott transition in one-dimensional quantum systems can be described by the sineGordon model with a tilt via bosonization. Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Appendix A Details
In this appendix, we explain in greater detail the bosonization approach used in this work, including bosonization conventions and the path integral formulation of the phase-phase two-point function It also provides a proof of the algorithm's validity and implementation details.
Appendix B Details
The appendix details how to derive the infinitesimal generator of an ECMC algorithm from a simple example It also provides pseudocode implementations of the Wo and SmoWo algorithms. The appendix computes various event times associated to the quadratic interactions, cosine interaction, refreshment term, and worm events.
Appendix C Details
This section provides detailed pseudocode implementations of the Wo algorithm (Alg. 2) and SmoWo algorithm (Alg. p. 0 Because the configuration space of the sine-Gordon
model separates into distinct topological sectors, standard local Monte Carlo schemes are limited
to very small system sizes. To overcome this limitation, we introduce the smooth worm (SmoWo)
Monte Carlo algorithm which enlarges the configuration space to allow smooth transitions between
topological sectors. Section III introduces the SmoWo algorithm and evaluates its performance. Section IV defines the observables of interest and outlines their computation
within the SmoWo algorithm.Where the paper says it
Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
SmoWo algorithm implementation for generic Mott transitions: The improved system can simulate large system sizes by using an enlarged configuration space that allows smooth transitions between topological sectors, overcoming the limitation of standard local Monte Carlo schemes.
-
Enhanced sampling efficiency via ECMC integration: The AI can utilize Event-Chain Monte Carlo moves to perform persistent and non-reversible updates, which are significantly faster than classical reversible methods like Metropolis-Hastings for sampling sine-Gordon models.
-
Identification of phase behavior through observables: The system can accurately identify the two phases (Luttinger liquid and Mott insulator) by monitoring scalar observables such as the doping delta rho, the amplitude of the 2kF density modulation C2kF, and superfluid stiffness rho s.
-
Critical exponent determination: The improved system can retrieve critical exponents z = 2.00 +/- 0.01, nu = 0.51 +/- 0.01, and the anomalous dimension for the particle-particle two-point function eta = 2.99 +/- 0.02 by applying finite-size scaling collapse analysis to numerical data.
-
Renormalization group flow mapping: The AI can map the schematic renormalization group flow of the enlarged model, showing trajectories that move from the Mott insulator fixed point to a continuum of Luttinger liquid fixed points, revealing a lack of an intermediate critical fixed point.
-
Calculation of phase-phase correlations: The system can calculate the phase-phase two-point function C theta(0, tau) by utilizing the worm algorithm to sample configurations with a worm ranging from particle time pt to hole time ph, providing insights into the algebraic decay in different phases.
-
Identification of Hubbard bands: The AI can distinguish between the Mott insulator and Luttinger liquid states by analyzing the two-point function C theta(0, tau), where the presence or absence of this correlation distinguishes between excitations in the upper and lower Hubbard bands.
Abstract
The generic Mott transition in one-dimensional quantum systems can be described by the sine-Gordon model with a tilt via bosonization. Because the configuration space of the sine-Gordon model separates into distinct topological sectors, standard local Monte Carlo schemes are limited to very small system sizes. To overcome this limitation, we introduce the smooth worm (SmoWo) Monte Carlo algorithm which enlarges the configuration space to allow smooth transitions between topological sectors. The method combines worm updates with event-chain Monte Carlo moves. We explicitly prove its validity and quantify its performance. Thanks to the substantial acceleration achieved by the SmoWo algorithm, we are able to simulate large system sizes, providing a precise picture of the different phases and critical behaviour of the sine-Gordon model.
Sources
Related papers
- Coupled Magnetic and Lattice Excitations in Multiferroic Ba3HoRu2O9: Insights from Neutron Scattering, Raman Spectroscopy, and Machine-Learned Phonon Calculations
- Gossamer Superconductivity in Moir'e WSe 2 Bilayer
- Spin-density wave of ferrimagnetic building blocks masking the ferromagnetic quantum-critical point in NbFe2
- Raman Circular Dichroism and spinon Quantum Geometry of Chiral Quantum Spin Liquids
- Twin Algebras: Condensable Algebras beyond Anyons
- Spin supersolid in triangular lattice easy-axis spin-1/2 antiferromagnet: a fermionic parton perspective