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:2101.03161 · Indian Journal of Physics

Recent progress on cluster and meron algorithms for strongly correlated systems

Debasish Banerjee

Published Jun 26, 2021• 12 citations
arXivHTMLPDF
DOI
10.1007/s12648-021-02155-5

Related papers

Meron-cluster approach to systems of strongly correlated electrons

Shailesh Chandrasekharan A, J. Cox, James C. Osborn +1 more

arXiv:cond-mat/0201360•Nuclear Physics B•Oct 11, 2003•19 citations

Superconductivity with the meron-cluster algorithm

James C. Osborn

arXiv:hep-lat/0010097•Nuclear Physics B - Proceedings Supplements•Mar 1, 2001•4 citations

Superconductivity with a Meron-Cluster Algorithm

James C. Osborn

Springer proceedings in physics•Jan 1, 2002•1 citation

SPIN CHAIN SIMULATIONS WITH A MERON CLUSTER ALGORITHM

Thomas Boyer‐Kassem, Wolfgang Bietenholz A, J. Wuilloud

We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.

•Jan 1, 2007•6 citations

SPIN CHAIN SIMULATIONS WITH A MERON CLUSTER ALGORITHM

Thomas Boyer‐Kassem, Wolfgang Bietenholz A, JAIR WUILLOUD

We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.

arXiv:cond-mat/0701331•International Journal of Modern Physics C•Sep 1, 2007•6 citations

New Theoretical Approaches to Strongly Correlated Systems

Springer eBooks•Jan 1, 2001•61 citations
We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.
We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.