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

Solving Sign Problems with Meron Algorithms

Shailesh Chandrasekharan A, James C. Osborn

Published Jan 1, 2001• 6 citations
Publisher
DOI
10.1007/978-3-642-56577-9_4

Related papers

Can the sign problem be solved

Malvin H. Kalos

APS•Mar 1, 2001•0 citations

Multi-modification method toward solving sign problem

Takahiro M. Doi, Shoichiro Tsutsui

•Sep 18, 2017•0 citations

Sign problem in Monte Carlo simulations of frustrated quantum spin systems

Patrik Henelius, Anders W. Sandvik

We discuss the sign problem arising in Monte Carlo simulations of frustrated quantum spin systems. We show that for a class of ``semifrustrated'' systems [Heisenberg models with ferromagnetic couplings ${J}_{z}(r)<0$ along the z axis and antiferromagnetic couplings ${J}_{\mathrm{xy}}(r)=\ensuremath{-}{J}_{z}(r)$ in the $\mathrm{xy}$ plane, for arbitrary distances $r],$ the sign problem present for algorithms operating in the z basis can be solved within a recent ``operator-loop'' formulation of the stochastic series expansion method [a cluster algorithm for sampling the diagonal matrix elements of the power series expansion of $\mathrm{exp}(\ensuremath{-}\ensuremath{\beta}H)$ to all orders]. The solution relies on the identification of operator loops which change the configuration sign when updated (``merons'') and is similar to the meron-cluster algorithm recently proposed by Chandrasekharan and Wiese for solving the sign problem for a class of fermion models [Phys. Rev. Lett. 83, 3116 (1999)]. Some important expectation values, e.g., the internal energy, can be evaluated in the subspace with no merons, where the weight function is positive definite. Calculations of other expectation values require sampling of configurations with only a small number of merons (typically zero or two), with an accompanying sign problem which is not serious. We also discuss problems which arise in applying the meron concept to more general quantum spin models with frustrated interactions.

arXiv:cond-mat/0001351•Physical review. B, Condensed matter•Jul 1, 2000•154 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•248 citations

Algorithms and Computation

Masanori Ohya, Igor Vasil'evich Volovich

Theoretical and mathematical physics•Jan 1, 2011•0 citations

Reduction of the sign problem using the meron-cluster approach

Sara Bergkvist, Patrik Henelius, Anders Rosengren

The sign problem in quantum Monte Carlo calculations is analyzed using the meron-cluster solution. A meron is a loop that alters the sign of the configuration, and the concept of merons can be used to solve the sign problem for a limited class of models. Here we show that the method can be used to reduce the sign problem in a wider class of models. We investigate how the meron solution evolves between a point in parameter space where it eliminates the sign problem and a point where it does not affect the sign problem at all. In this intermediate regime, the merons can be used to reduce the sign problem. The average sign still decreases exponentially with system size and inverse temperature, but with a different prefactor. The sign exhibits the slowest decrease in the vicinity of points where the meron-cluster solution eliminates the sign problem. We have used stochastic series expansion quantum Monte Carlo combined with the concept of directed loops.

arXiv:cond-mat/0304008•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Jul 25, 2003•4 citations
We discuss the sign problem arising in Monte Carlo simulations of frustrated quantum spin systems. We show that for a class of ``semifrustrated'' systems [Heisenberg models with ferromagnetic couplings Jz(r)<0{J}_{z}(r)<0Jz​(r)<0 along the z axis and antiferromagnetic couplings ${J}_{\mathrm{xy}}(r)=\ensuremath{-}{J}_{z}(r)$ in the xy\mathrm{xy}xy plane, for arbitrary distances r],r],r], the sign problem present for algorithms operating in the z basis can be solved within a recent ``operator-loop'' formulation of the stochastic series expansion method [a cluster algorithm for sampling the diagonal matrix elements of the power series expansion of $\mathrm{exp}(\ensuremath{-}\ensuremath{\beta}H)$ to all orders]. The solution relies on the identification of operator loops which change the configuration sign when updated (``merons'') and is similar to the meron-cluster algorithm recently proposed by Chandrasekharan and Wiese for solving the sign problem for a class of fermion models [Phys. Rev. Lett. 83, 3116 (1999)]. Some important expectation values, e.g., the internal energy, can be evaluated in the subspace with no merons, where the weight function is positive definite. Calculations of other expectation values require sampling of configurations with only a small number of merons (typically zero or two), with an accompanying sign problem which is not serious. We also discuss problems which arise in applying the meron concept to more general quantum spin models with frustrated interactions.
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.
The sign problem in quantum Monte Carlo calculations is analyzed using the meron-cluster solution. A meron is a loop that alters the sign of the configuration, and the concept of merons can be used to solve the sign problem for a limited class of models. Here we show that the method can be used to reduce the sign problem in a wider class of models. We investigate how the meron solution evolves between a point in parameter space where it eliminates the sign problem and a point where it does not affect the sign problem at all. In this intermediate regime, the merons can be used to reduce the sign problem. The average sign still decreases exponentially with system size and inverse temperature, but with a different prefactor. The sign exhibits the slowest decrease in the vicinity of points where the meron-cluster solution eliminates the sign problem. We have used stochastic series expansion quantum Monte Carlo combined with the concept of directed loops.