Meron-Cluster Solution of a Fermion Sign Problem

Preprint

10 February 1999

preprint
Published by arXiv in arXiv

Abstract

We present a cluster algorithm which solves the notorious sign problem in a model of non-relativistic 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. A Metropolis step is incorporated in the process of cluster decomposition to ensure that meron-clusters are only generated when required. Our method applies to various systems in the Hubbard model family, to relativistic fermions, and to some problems with a complex action.

Keywords

All Related Versions

Version 1, 1999-02-10, ArXiv
Version 2, 1999-10-11, ArXiv
Published version: Physical Review Letters, 83 (16), 3116.

This publication has 0 references indexed in Scilit: