Recent progress on cluster and meron algorithms for strongly correlated systems

Ab initio studies of strongly interacting bosonic and fermionic systems are greatly facilitated by efficient Monte Carlo algorithms. This article emphasizes this requirement and outlines the ideas behind the construction of the cluster algorithms and illustrates them via specific examples. Numerical...

Full description

Saved in:
Bibliographic Details
Published in:Indian journal of physics 2021-08, Vol.95 (8), p.1669-1680
Main Author: Banerjee, Debasish
Format: Article
Language:English
Subjects:
Algorithms
Astrophysics and Astroparticles
Clusters
Gauge theory
Physics
Physics and Astronomy
Review Paper
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Ab initio studies of strongly interacting bosonic and fermionic systems are greatly facilitated by efficient Monte Carlo algorithms. This article emphasizes this requirement and outlines the ideas behind the construction of the cluster algorithms and illustrates them via specific examples. Numerical studies of fermionic systems at finite densities and at real-times are sometimes hindered by the infamous sign problem, which is also discussed. The construction of meron cluster algorithms, which can solve certain sign problems, is discussed. Cluster algorithms which can simulate certain pure Abelian gauge theories (realized as quantum link models) are also discussed.
ISSN:0973-1458
0974-9845
DOI:10.1007/s12648-021-02155-5