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:2204.11252

Wide sampling and efficient updating Monte Carlo algorithms for dimer models

Yao Hongxu, Jiaze Li, Hou Jintao

Published Apr 24, 2022• 0 citations
arXivHTMLPDF

Abstract

Quantum dimer model is a low-energy and efficient model to study quantum spin systems and strong-correlated physics. As a foreseeing step and without loss of generality, we study the classical dimers on square lattice by means of Monte Carlo method. For efficient states updating in dimer model, we introduce a highly-efficient loop updating algorithm directed by energy criterion called energy directed loop algorithm and improve the pocket algorithm to compare them with the traditional directed loop algorithm. By comparisons, our energy directed loop algorithm increases the convergent speed of Monte Carlo and shorten the auto-correlated time in classical hard-core dimer model. Both the improved pocket algorithm and energy path algorithm can be used in varietal dimer models and succeed in traversing the topological sections rapidly.

DOI
10.48550/arxiv.2204.11252

Related papers

Generalized directed loop method for quantum Monte Carlo simulations

Fabien Alet, Stefan Weßel, Matthias Troyer

Efficient quantum Monte Carlo update schemes called directed loops have recently been proposed, which improve the efficiency of simulations of quantum lattice models. We propose to generalize the detailed balance equations at the local level during the loop construction by accounting for the matrix elements of the operators associated with open world-line segments. Using linear programming techniques to solve the generalized equations, we look for optimal construction schemes for directed loops. This also allows for an extension of the directed loop scheme to general lattice models, such as high-spin or bosonic models. The resulting algorithms are bounce free in larger regions of parameter space than the original directed loop algorithm. The generalized directed loop method is applied to the magnetization process of spin chains in order to compare its efficiency to that of previous directed loop schemes. In contrast to general expectations, we find that minimizing bounces alone does not always lead to more efficient algorithms in terms of autocorrelations of physical observables, because of the nonuniqueness of the bounce-free solutions. We therefore propose different general strategies to further minimize autocorrelations, which can be used as supplementary requirements in any directed loop scheme. We show by calculating autocorrelation times for different observables that such strategies indeed lead to improved efficiency; however, we find that the optimal strategy depends not only on the model parameters but also on the observable of interest.

arXiv:cond-mat/0308495•Physical Review E•Mar 22, 2005•244 citations

Pocket Monte Carlo algorithm for classical doped dimer models

Werner Krauth, Roderich Moessner

We study the correlations of classical hard-core dimer models doped with monomers by Monte Carlo simulation. We introduce an efficient cluster algorithm, which is applicable in any dimension, for different lattices and arbitrary doping. We use this algorithm for the dimer model on the square lattice, where a finite density of monomers destroys the critical confinement of the two-monomer problem. The monomers form a two-component plasma located in its high-temperature phase, with the Coulomb interaction screened at finite densities. On the triangular lattice, a single pair of monomers is not confined. The monomer correlations are extremely short ranged and hardly change with doping.

arXiv:cond-mat/0206177•Physical review. B, Condensed matter•Feb 24, 2003•57 citations

Improved Sweeping Cluster Algorithm for Quantum Dimer Model

Zheng Yan

Quantum dimer models~(QDMs) featured by strong geometric constraint are effective low energy descriptions of many quantum spin systems. The geometric restriction described by local gauge field, hinders the application of numerical algorithms. Before sweeping cluster method was applied in world-line quantum Monte Carlo (QMC) algorithm, there is only projector QMC which obey the constraints and could be used for calculation on QDMs. However, the projector QMC for QDMs has some drawbacks, e.g., it is not effective when the parameter interval away from Rokhsar-Kivelson (RK) point. That's because the projector method still lacks a cluster update to improve its efficiency. Although sweeping cluster algorithm improves the update for these systems, it also only works in one winding (topological) sector. In this paper, we improve the sweeping cluster method to sample in different winding sectors.

•Nov 16, 2020•3 citations

Improvement of numerical algorithm for quantum dimer models

Ruixiao Cao

The quantum dimer model has been continuously discussed both theoretically and numerically.Numerical methods have been developed on the quantum dimer model, but efficiency has been an essential problem due to the strong geometry constraint of the model.Recently, sweeping cluster update based on stochastic series expansion has shown power on quantum Monte Carlo on quantum dimer model.In this thesis, we propose improvements to the sweeping cluster update algorithm, which can reduce the time complexity by smartly choosing the next operator to update on.We also show a general framework to extend the current method to a broader range of models, including dimermonomer and monomer-monomer operators.As a benchmark of our algorithm, we simulate the quantum dimer model at finite temperatures in a wide region of parameters.By measuring several order parameters by the quantum Monte Carlo and using the finitescaling analysis, the phase boundary of the quantum dimer model on the square lattice can be estimated numerically, and the phase diagram in V /J < 1 region is determined accurately.We find evidence to support the expectation of previous research that the phase transition at finite temperature of quantum dimer model shows similar behavior to the Kosterlitz-Thouless transition in the classical dimer model.The intermediate plaquette phase may not exist, and the columnar phase in the classical model extends up to the Rokhsar-Kivelson point.iii This thesis is supported by Prof. Synge Todo and Prof. Hidemaro Suwa.I greatly appreciate the discussions we had during my doctoral years with them.Many ideas have been discussed in the meetings and then applied to the model for interesting numerical results.I also appreciated

•Sep 22, 2023•0 citations

The Breaking of Geometric Constraint of Classical Dimers on the Square Lattice

Hongxu Yao, Jiaze Li, Jintao Hou

We study a model of two-dimensional classical dimers on the square lattice with strong geometric constraints (there is exactly one bond with the nearest point for every point in the lattice). This model corresponds to the quantum dimer model suggested by D.S. Rokhsar and S.A. Kivelson (1988). We use the directed-loop algorithm to show the system undergoes a Berezinskii-Kostelitz Thousless transition (BKT transition) in finite temperatures. After that, if we destroy the geometric constraint of dimers, the topological transition will transfer to a quasi one-order transition. For the dimer updates, we also introduce a new cluster updating algorithm called the edged cluster algorithm. By this method, we succeed in rapidly traversing the winding (topological) sections uniformly and widening the effective matrical ensemble to include more topological sections.

arXiv:2106.09674•Jun 17, 2021•0 citations

Directed loop updates for quantum lattice models

Olav F. Syljuåsen

This article outlines how the quantum Monte Carlo directed loop update recently introduced can be applied to a wide class of quantum lattice models. Several models are considered: spin-s XXZ models with longitudinal and transverse magnetic fields, boson models with two-body interactions, and one-dimensional spinful fermion models. Expressions are given for the parameter regimes where very efficient "no-bounce" quantum Monte Carlo algorithms can be found.

arXiv:cond-mat/0211513•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Apr 3, 2003•82 citations
Quantum dimer model is a low-energy and efficient model to study quantum spin systems and strong-correlated physics. As a foreseeing step and without loss of generality, we study the classical dimers on square lattice by means of Monte Carlo method. For efficient states updating in dimer model, we introduce a highly-efficient loop updating algorithm directed by energy criterion called energy directed loop algorithm and improve the pocket algorithm to compare them with the traditional directed loop algorithm. By comparisons, our energy directed loop algorithm increases the convergent speed of Monte Carlo and shorten the auto-correlated time in classical hard-core dimer model. Both the improved pocket algorithm and energy path algorithm can be used in varietal dimer models and succeed in traversing the topological sections rapidly.
Efficient quantum Monte Carlo update schemes called directed loops have recently been proposed, which improve the efficiency of simulations of quantum lattice models. We propose to generalize the detailed balance equations at the local level during the loop construction by accounting for the matrix elements of the operators associated with open world-line segments. Using linear programming techniques to solve the generalized equations, we look for optimal construction schemes for directed loops. This also allows for an extension of the directed loop scheme to general lattice models, such as high-spin or bosonic models. The resulting algorithms are bounce free in larger regions of parameter space than the original directed loop algorithm. The generalized directed loop method is applied to the magnetization process of spin chains in order to compare its efficiency to that of previous directed loop schemes. In contrast to general expectations, we find that minimizing bounces alone does not always lead to more efficient algorithms in terms of autocorrelations of physical observables, because of the nonuniqueness of the bounce-free solutions. We therefore propose different general strategies to further minimize autocorrelations, which can be used as supplementary requirements in any directed loop scheme. We show by calculating autocorrelation times for different observables that such strategies indeed lead to improved efficiency; however, we find that the optimal strategy depends not only on the model parameters but also on the observable of interest.
We study the correlations of classical hard-core dimer models doped with monomers by Monte Carlo simulation. We introduce an efficient cluster algorithm, which is applicable in any dimension, for different lattices and arbitrary doping. We use this algorithm for the dimer model on the square lattice, where a finite density of monomers destroys the critical confinement of the two-monomer problem. The monomers form a two-component plasma located in its high-temperature phase, with the Coulomb interaction screened at finite densities. On the triangular lattice, a single pair of monomers is not confined. The monomer correlations are extremely short ranged and hardly change with doping.
Quantum dimer models~(QDMs) featured by strong geometric constraint are effective low energy descriptions of many quantum spin systems. The geometric restriction described by local gauge field, hinders the application of numerical algorithms. Before sweeping cluster method was applied in world-line quantum Monte Carlo (QMC) algorithm, there is only projector QMC which obey the constraints and could be used for calculation on QDMs. However, the projector QMC for QDMs has some drawbacks, e.g., it is not effective when the parameter interval away from Rokhsar-Kivelson (RK) point. That's because the projector method still lacks a cluster update to improve its efficiency. Although sweeping cluster algorithm improves the update for these systems, it also only works in one winding (topological) sector. In this paper, we improve the sweeping cluster method to sample in different winding sectors.
The quantum dimer model has been continuously discussed both theoretically and numerically.Numerical methods have been developed on the quantum dimer model, but efficiency has been an essential problem due to the strong geometry constraint of the model.Recently, sweeping cluster update based on stochastic series expansion has shown power on quantum Monte Carlo on quantum dimer model.In this thesis, we propose improvements to the sweeping cluster update algorithm, which can reduce the time complexity by smartly choosing the next operator to update on.We also show a general framework to extend the current method to a broader range of models, including dimermonomer and monomer-monomer operators.As a benchmark of our algorithm, we simulate the quantum dimer model at finite temperatures in a wide region of parameters.By measuring several order parameters by the quantum Monte Carlo and using the finitescaling analysis, the phase boundary of the quantum dimer model on the square lattice can be estimated numerically, and the phase diagram in V /J < 1 region is determined accurately.We find evidence to support the expectation of previous research that the phase transition at finite temperature of quantum dimer model shows similar behavior to the Kosterlitz-Thouless transition in the classical dimer model.The intermediate plaquette phase may not exist, and the columnar phase in the classical model extends up to the Rokhsar-Kivelson point.iii This thesis is supported by Prof. Synge Todo and Prof. Hidemaro Suwa.I greatly appreciate the discussions we had during my doctoral years with them.Many ideas have been discussed in the meetings and then applied to the model for interesting numerical results.I also appreciated
We study a model of two-dimensional classical dimers on the square lattice with strong geometric constraints (there is exactly one bond with the nearest point for every point in the lattice). This model corresponds to the quantum dimer model suggested by D.S. Rokhsar and S.A. Kivelson (1988). We use the directed-loop algorithm to show the system undergoes a Berezinskii-Kostelitz Thousless transition (BKT transition) in finite temperatures. After that, if we destroy the geometric constraint of dimers, the topological transition will transfer to a quasi one-order transition. For the dimer updates, we also introduce a new cluster updating algorithm called the edged cluster algorithm. By this method, we succeed in rapidly traversing the winding (topological) sections uniformly and widening the effective matrical ensemble to include more topological sections.