Meron-Cluster Solution of Fermion Sign Problems
- 18 October 1999
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 83 (16) , 3116-3119
- https://doi.org/10.1103/physrevlett.83.3116
Abstract
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 to the path integral, while all other configurations contribute . The cluster representation describes the partition function as a gas of clusters in the zero-meron sector.
Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Imaginary chemical potential and finite fermion density on the latticePhysical Review D, 1999
- Results on finite density QCDNuclear Physics B - Proceedings Supplements, 1998
- Simulations of Discrete Quantum Systems in Continuous Euclidean TimePhysical Review Letters, 1996
- Loop algorithms for quantum simulations of fermion models on latticesPhysical Review B, 1994
- A determination of the low energy parameters of the 2-d Heisenberg antiferromagnetZeitschrift für Physik B Condensed Matter, 1994
- Bosonization and cluster updating of lattice fermionsPhysics Letters B, 1993
- Cluster algorithm for vertex modelsPhysical Review Letters, 1993
- Blockspin cluster algorithms for quantum spin systemsPhysics Letters A, 1992
- Binding of holes in the Hubbard modelPhysical Review B, 1990
- Numerical study of the two-dimensional Hubbard modelPhysical Review B, 1989