Typical fermion algorithms require the computation (or sampling) of the fermion determinant. We focus instead on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration space. We develop new cluster algorithms and design classes of models for fermions coupled to
Z2 and
U(1) gauge fields that are amenable to being simulated by these cluster algorithms in a sign-problem free way. Such simulations should contain rich phase diagrams and are particularly relevant for quantum simulator experiments.
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.