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

Springer proceedings in physics

Superconductivity with a Meron-Cluster Algorithm

James C. Osborn

Published Jan 1, 2002• 1 citation
Publisher
DOI
10.1007/978-3-642-59406-9_24

Related papers

Superconductivity with the meron-cluster algorithm

James C. Osborn

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

Recent progress on cluster and meron algorithms for strongly correlated systems

Debasish Banerjee

arXiv:2101.03161•Indian Journal of Physics•Jun 26, 2021•12 citations

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

1 Superconductivity with the Meron-Cluster Algorithm a ∗

James C. Osborn

The meron-cluster algorithm was previously used to extensively study the physics associated with the spontaneous breaking of a discrete symmetry. We recently discovered that a larger class of models with spontaneous breaking of continuous symmetries can also be simulated using the meron-cluster algorithm. Here we study one of these new models which belongs to the attractive Hubbard model family. In particular we study the spontaneous breaking of the U(1) fermion number symmetry in two dimensions and find clear evidence for a Kosterlitz-Thouless transition to a superconducting phase. 1.

•Jan 1, 2000•2 citations

Superconductivity

David S. Simon

Undergraduate texts in physics•Jan 1, 2025•0 citations

Meron-Cluster Solution of Fermion Sign Problems

Shailesh Chandrasekharan A, U.‐J. Wiese

We present a general strategy to solve the notorious fermion sign problem using cluster algorithms. The method applies to various systems in the Hubbard model family as well as to relativistic fermions. Here it is illustrated for nonrelativistic lattice fermions. A configuration of fermion world lines is decomposed into clusters that contribute independently to the fermion permutation sign. A cluster whose flip changes the sign is referred to as a meron. Configurations containing meron clusters contribute $0$ to the path integral, while all other configurations contribute $1$. The cluster representation describes the partition function as a gas of clusters in the zero-meron sector.

arXiv:cond-mat/9902128•Physical Review Letters•Oct 18, 1999•223 citations
The meron-cluster algorithm was previously used to extensively study the physics associated with the spontaneous breaking of a discrete symmetry. We recently discovered that a larger class of models with spontaneous breaking of continuous symmetries can also be simulated using the meron-cluster algorithm. Here we study one of these new models which belongs to the attractive Hubbard model family. In particular we study the spontaneous breaking of the U(1) fermion number symmetry in two dimensions and find clear evidence for a Kosterlitz-Thouless transition to a superconducting phase. 1.
We present a general strategy to solve the notorious fermion sign problem using cluster algorithms. The method applies to various systems in the Hubbard model family as well as to relativistic fermions. Here it is illustrated for nonrelativistic lattice fermions. A configuration of fermion world lines is decomposed into clusters that contribute independently to the fermion permutation sign. A cluster whose flip changes the sign is referred to as a meron. Configurations containing meron clusters contribute 000 to the path integral, while all other configurations contribute 111. The cluster representation describes the partition function as a gas of clusters in the zero-meron sector.