Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2510.20901 · Physical review. B./Physical review. B

Generic Mott transition in the sine-Gordon model through an embedded worm algorithm

Oscar Bouverot-Dupuis, Laura Foini, Alberto Rosso

Published Jan 27, 2026• 1 citation
arXivHTMLPDF

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.

DOI
10.1103/4k6t-lnzp

Related papers

Properties of bosons in a one-dimensional bichromatic optical lattice in the regime of the pinning transition: A worm-algorithm Monte Carlo study

Asaad R. Sakhel

The sensitivity of the pinning transition (PT) as described by the sine-Gordon model of strongly interacting bosons confined in a shallow, one-dimensional, periodic optical lattice (OL), is examined against perturbations of the OL. The PT has been recently realized experimentally by Haller et al. [Nature (London) 466, 597 (2010)] and is the exact opposite of the superfluid-to-Mott-insulator transition in a deep OL with weakly interacting bosons. The continuous-space worm-algorithm (WA) Monte Carlo method [Boninsegni et al., Phys. Rev. E 74, 036701 (2006)] is applied for the present examination. It is found that the WA is able to reproduce the PT, which is another manifestation of the power of continuous-space WA methods in capturing the physics of phase transitions. In order to examine the sensitivity of the PT, it is tweaked by the addition of the secondary OL. The resulting bichromatic optical lattice (BCOL) is considered with a rational ratio of the constituting wavelengths ${\ensuremath{\lambda}}_{1}$ and ${\ensuremath{\lambda}}_{2}$ in contrast to the commonly used irrational ratio. For a weak BCOL, it is chiefly demonstrated that this PT is robust against the introduction of a weaker, secondary OL. The system is explored numerically by scanning its properties in a range of the Lieb-Liniger interaction parameter $\ensuremath{\gamma}$ in the regime of the PT. It is argued that there should not be much difference in the results between those due to an irrational ratio ${\ensuremath{\lambda}}_{1}/{\ensuremath{\lambda}}_{2}$ and those due to a rational approximation of the latter, bringing this in line with a recent statement by Boers et al. [Phys. Rev. A 75, 063404 (2007)]. The correlation function, Matsubara Green's function (MGF), and the single-particle density matrix do not respond to changes in the depth of the secondary OL ${V}_{1}$. For a stronger BCOL, however, a response is observed because of changes in ${V}_{1}$. In the regime where the bosons are fermionized, the MGF reveals that hole excitations are favored over particle excitations manifesting that holes in the PT regime play an important role in the response of properties to changes in $\ensuremath{\gamma}$.

arXiv:1511.00745•Physical Review A•Sep 19, 2016•1 citation

Worm Algorithms for Classical Statistical Models

Nikolay V. Prokof'ev, Boris V. Svistunov

We show that high-temperature expansions provide a basis for the novel approach to efficient Monte Carlo simulations. "Worm" algorithms utilize the idea of updating closed-path configurations (produced by high-temperature expansions) through the motion of end points of a disconnected path. An amazing result is that local, Metropolis-type schemes using this approach appear to have dynamical critical exponents close to zero (i.e., their efficiency is comparable to the best cluster methods) as proved by finite-size scaling of the autocorrelation time for various universality classes.

arXiv:cond-mat/0103146•Physical Review Letters•Sep 27, 2001•387 citations

Worm Algorithm for Continuous-Space Path Integral Monte Carlo Simulations

Massimo Boninsegni, Nikolay V. Prokof'ev, Boris V. Svistunov

We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient computation of thermodynamic properties, including winding numbers and off-diagonal correlations, for systems of much greater size than that accessible to conventional PIMC simulations. As an illustrative application of the method, we simulate the superfluid transition of 4He in two dimensions.

arXiv:cond-mat/0510214•Physical Review Letters•Feb 23, 2006•409 citations

Worm Algorithm for Problems of Quantum and Classical Statistics

Nikolay V. Prokof'ev

Theoretical studies often involve mappings of the original system onto an equivalent description in terms of abstract mathematical/graphical objects, where ‘equivalent’ means one obtains the same final answer for some particular property. Path integrals, high-temperature expansions, and Feynman diagrams are the well-known examples considered in this chapter. Under such mappings, one has to deal with the infinite-dimensional configuration space having complex topology and non-local constraints which severely reduce efficiency of Monte Carlo simulations based on standard local updates. This sometimes leads to ergodicity problems in large systems when the entire configuration space can not be sampled in a reasonable computation time. A somewhat related difficulty facing conventional Monte Carlo schemes is the computation of off-diagonal correlation functions since they have no direct relation to the configuration space of the partition function. In what follows we consider path integrals for lattice and continuous systems, high-temperature expansions, and Feynman diagrams, explain the general idea of how Worm Algorithms (WAs) deal with the topological constraints by going to the enlarged configuration space, and present illustrative results for several physics problems.

arXiv:0910.1393•CRC Press eBooks•Nov 2, 2010•27 citations

Berezinskii-Kosterlitz-Thouless phase transition from lattice sine-Gordon model

Joel Giedt, James Flamino

\nWe obtain nonperturbative results on the sine-Gordon model using the lattice field technique. In particular, we employ the Fourier accelerated hybrid Monte Carlo algorithm for our studies. We find the critical temperature of the theory based autocorrelation time, as well as the finite size scaling of the “thickness” observable used in an earlier lattice study by Hasenbusch et al.\n

•Mar 26, 2018•1 citation

Bosonized one-dimensional quantum systems through enhanced event-chain Monte Carlo

Oscar Bouverot-Dupuis, Alberto Rosso, Manon Michel

We design an enhanced Event-Chain Monte Carlo algorithm to study 1D quantum dissipative systems, using their bosonized representation. Expressing the bosonized Hamiltonian as a path integral over a scalar field enables the application of Monte Carlo algorithms developed for classical systems. Specifically, we focus on a dissipative XXZ spin chain, exhibiting critical slowing down, minima degeneracy and long-range interactions. Addressing all three bottlenecks, we design an algorithm that combines local persistent Event-Chain Monte Carlo moves with global cluster moves, in a O(1)-complexity implementation. Through systematic performance analysis, we show that such an algorithm outperforms traditional Metropolis algorithms by more than a magnitude factor and is competitive with current state-of-the-art Quantum Monte Carlo algorithms. We then use this approach to determine the dissipative spin chain's phase diagram, thereby reinforcing prior analytical predictions.

arXiv:2503.11577•Physical review. B./Physical review. B•Jun 24, 2025•3 citations
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.
The sensitivity of the pinning transition (PT) as described by the sine-Gordon model of strongly interacting bosons confined in a shallow, one-dimensional, periodic optical lattice (OL), is examined against perturbations of the OL. The PT has been recently realized experimentally by Haller et al. [Nature (London) 466, 597 (2010)] and is the exact opposite of the superfluid-to-Mott-insulator transition in a deep OL with weakly interacting bosons. The continuous-space worm-algorithm (WA) Monte Carlo method [Boninsegni et al., Phys. Rev. E 74, 036701 (2006)] is applied for the present examination. It is found that the WA is able to reproduce the PT, which is another manifestation of the power of continuous-space WA methods in capturing the physics of phase transitions. In order to examine the sensitivity of the PT, it is tweaked by the addition of the secondary OL. The resulting bichromatic optical lattice (BCOL) is considered with a rational ratio of the constituting wavelengths ${\ensuremath{\lambda}}_{1}$ and ${\ensuremath{\lambda}}_{2}$ in contrast to the commonly used irrational ratio. For a weak BCOL, it is chiefly demonstrated that this PT is robust against the introduction of a weaker, secondary OL. The system is explored numerically by scanning its properties in a range of the Lieb-Liniger interaction parameter $\ensuremath{\gamma}$ in the regime of the PT. It is argued that there should not be much difference in the results between those due to an irrational ratio ${\ensuremath{\lambda}}_{1}/{\ensuremath{\lambda}}_{2}$ and those due to a rational approximation of the latter, bringing this in line with a recent statement by Boers et al. [Phys. Rev. A 75, 063404 (2007)]. The correlation function, Matsubara Green's function (MGF), and the single-particle density matrix do not respond to changes in the depth of the secondary OL V1{V}_{1}V1​. For a stronger BCOL, however, a response is observed because of changes in V1{V}_{1}V1​. In the regime where the bosons are fermionized, the MGF reveals that hole excitations are favored over particle excitations manifesting that holes in the PT regime play an important role in the response of properties to changes in $\ensuremath{\gamma}$.
We show that high-temperature expansions provide a basis for the novel approach to efficient Monte Carlo simulations. "Worm" algorithms utilize the idea of updating closed-path configurations (produced by high-temperature expansions) through the motion of end points of a disconnected path. An amazing result is that local, Metropolis-type schemes using this approach appear to have dynamical critical exponents close to zero (i.e., their efficiency is comparable to the best cluster methods) as proved by finite-size scaling of the autocorrelation time for various universality classes.
We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient computation of thermodynamic properties, including winding numbers and off-diagonal correlations, for systems of much greater size than that accessible to conventional PIMC simulations. As an illustrative application of the method, we simulate the superfluid transition of 4He in two dimensions.
Theoretical studies often involve mappings of the original system onto an equivalent description in terms of abstract mathematical/graphical objects, where ‘equivalent’ means one obtains the same final answer for some particular property. Path integrals, high-temperature expansions, and Feynman diagrams are the well-known examples considered in this chapter. Under such mappings, one has to deal with the infinite-dimensional configuration space having complex topology and non-local constraints which severely reduce efficiency of Monte Carlo simulations based on standard local updates. This sometimes leads to ergodicity problems in large systems when the entire configuration space can not be sampled in a reasonable computation time. A somewhat related difficulty facing conventional Monte Carlo schemes is the computation of off-diagonal correlation functions since they have no direct relation to the configuration space of the partition function. In what follows we consider path integrals for lattice and continuous systems, high-temperature expansions, and Feynman diagrams, explain the general idea of how Worm Algorithms (WAs) deal with the topological constraints by going to the enlarged configuration space, and present illustrative results for several physics problems.
We design an enhanced Event-Chain Monte Carlo algorithm to study 1D quantum dissipative systems, using their bosonized representation. Expressing the bosonized Hamiltonian as a path integral over a scalar field enables the application of Monte Carlo algorithms developed for classical systems. Specifically, we focus on a dissipative XXZ spin chain, exhibiting critical slowing down, minima degeneracy and long-range interactions. Addressing all three bottlenecks, we design an algorithm that combines local persistent Event-Chain Monte Carlo moves with global cluster moves, in a O(1)-complexity implementation. Through systematic performance analysis, we show that such an algorithm outperforms traditional Metropolis algorithms by more than a magnitude factor and is competitive with current state-of-the-art Quantum Monte Carlo algorithms. We then use this approach to determine the dissipative spin chain's phase diagram, thereby reinforcing prior analytical predictions.