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

arXiv:hep-lat/9909007 · Nuclear Physics B - Proceedings Supplements

Fermion cluster algorithms

Shailesh Chandrasekharan A

Published Apr 1, 2000• 6 citations
arXivHTMLPDF
DOI
10.1016/s0920-5632(00)91803-6

Related papers

Fermion Cluster Algorithms

Shailesh Chandrasekharan A

Nuclear Physics B - Proceedings Supplements•Mar 1, 2000•11 citations

Cluster-Algorithm-Amenable Models of Gauge Fields and Matter

Emilie Huffman, Debasish Banerjee

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 $\mathbb{Z}_2$ 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.

arXiv:2312.16865•International Symposium on Lattice Field Theory (LATTICE)•May 3, 2024•1 citation

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•248 citations

WORKSHOP ON FERMION ALGORITHMS

Hans Jürgen Herrmann, F. Karsch

•Jan 1, 1992•18 citations

An algorithm for solving fermion problems

Jean‐Pierre Eckmann, M. Guenin

Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B•Jul 1, 1973•5 citations

Meron-Cluster Algorithms for Quantum Link Models

João C. Pinto Barros, Thea Budde, Marina Krstić Marinković

State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered by the sign problem. We discuss the simulation of lattice gauge theories in the Hamiltonian formalism and present a generalized meron-cluster algorithm for the simulation of the $U\left(1\right)$ Quantum Link Model for spin $1/2$. This enables the study of models directly relevant to current quantum simulators and is a promising first step toward constructing new efficient algorithms for more complicated gauge theories.

arXiv:2402.01039•International Symposium on Lattice Field Theory (LATTICE)•May 4, 2024•5 citations
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\mathbb{Z}_2Z2​ and U(1)U(1)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 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.
State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered by the sign problem. We discuss the simulation of lattice gauge theories in the Hamiltonian formalism and present a generalized meron-cluster algorithm for the simulation of the U(1)U\left(1\right)U(1) Quantum Link Model for spin 1/21/21/2. This enables the study of models directly relevant to current quantum simulators and is a promising first step toward constructing new efficient algorithms for more complicated gauge theories.