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:cond-mat/0412771 · Journal of Physics A Mathematical and General

On the sign problem in the Hirsch–Fye algorithm for impurity problems

Jaebeom Yoo, Shailesh Chandrasekharan A, Ribhu K. Kaul, Denis Ullmo, Harold U. Baranger

Published Nov 16, 2005• 24 citations
arXivHTMLPDF

Abstract

We show that there is no fermion sign problem in the Hirsch and Fye algorithm for the single-impurity Anderson model. Beyond the particle-hole symmetric case for which a simple proof exists, this has been known only empirically. Here we prove the nonexistence of a sign problem for the general case by showing that each spin trace for a given Ising configuration is separately positive. We further use this insight to analyze under what conditions orbitally degenerate Anderson models or the two-impurity Anderson model develop a sign.

DOI
10.1088/0305-4470/38/48/004

Related papers

No Sign Problem in the Hirsch-Fye Algorithm for an Anderson Impurity

Jaebeom Yoo, Shailesh Chandrasekharan A, Ribhu K. Kaul +2 more

We show the non-existence of any sign problem in the Hirsch and Fye algorithm for the single-impurity Anderson model. Beyond the particle-hole symmetric case for which a simple proof exists, it is known only empirically that there is no sign problem. Here we prove the nonexistence of a sign problem for the general case by showing that each spin trace for a given Ising configuration is separately positive.

•Dec 31, 2004•1 citation

Multilevel algorithm for quantum-impurity models

Jaebeom Yoo, Shailesh Chandrasekharan A, Harold U. Baranger

A continuous-time path integral quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low temperatures, the new algorithm has many advantages over conventional algorithms. For example, the model can be easily simulated in the Kondo limit without time discretization errors. Furthermore, many observables including the impurity susceptibility and a variety of fermionic observables can be calculated efficiently. Finally the new approach allows us to explore a general technique, called the multilevel algorithm, to solve the sign problem. We find that the multilevel algorithm is able to generate an exponentially large number of configurations with an effort that grows as a polynomial in inverse temperature such that configurations with a positive sign dominate over those with negative signs. Our algorithm can be easily generalized to other multi-impurity problems.

arXiv:cond-mat/0408123•Physical Review E•Mar 31, 2005•3 citations

Majorana Positivity and the Fermion Sign Problem of Quantum Monte Carlo Simulations

Z. C. Wei, Congjun Wu, Yi Li +2 more

The sign problem is a major obstacle in quantum Monte Carlo simulations for many-body fermion systems. We examine this problem with a new perspective based on the Majorana reflection positivity and Majorana Kramers positivity. Two sufficient conditions are proven for the absence of the fermion sign problem. Our proof provides a unified description for all the interacting lattice fermion models previously known to be free of the sign problem based on the auxiliary field quantum Monte Carlo method. It also allows us to identify a number of new sign-problem-free interacting fermion models including, but not limited to, lattice fermion models with repulsive interactions but without particle-hole symmetry, and interacting topological insulators with spin-flip terms.

arXiv:1601.01994•Physical Review Letters•Jun 23, 2016•119 citations

Solution to sign problems in half-filled spin-polarized electronic systems

Emilie Huffman, Shailesh Chandrasekharan A

We solve the sign problem in a particle-hole symmetric spin-polarized fermion model on bipartite lattices using the idea of fermion bags. The solution can be extended to a class of models at half filling but without particle-hole symmetry. Attractive Hubbard models with an odd number of fermion species can also be solved. Our solutions should allow us to study quantum phase transitions that have remained unexplored so far due to sign problems.

arXiv:1311.0034•Physical Review B•Mar 12, 2014•84 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•134 citations

Fermion sign problem: Decoupling transformation and simulation algorithm

G. G. Batrouni, Ph. de Forcrand

We discuss the fermion sign problem and, by examining a very general Hubbard-Stratonovich transformation, argue that the sign problem cannot be solved with such methods. We propose a different kind of transformation which, while not solving the sign problem, shows more detailed information about the system. With our transformation it is trivial to tell which auxiliary field configurations give a positive sign and which give a negative sign. We then discuss briefly various properties of this transformation and construct an algorithm which with one simulation gives results for a whole range of particle densities and Hubbard U values, positive and negative. Our approach is in excellent agreement with exact calculations.

arXiv:cond-mat/9211009•Physical review. B, Condensed matter•Jul 1, 1993•30 citations
We show that there is no fermion sign problem in the Hirsch and Fye algorithm for the single-impurity Anderson model. Beyond the particle-hole symmetric case for which a simple proof exists, this has been known only empirically. Here we prove the nonexistence of a sign problem for the general case by showing that each spin trace for a given Ising configuration is separately positive. We further use this insight to analyze under what conditions orbitally degenerate Anderson models or the two-impurity Anderson model develop a sign.
A continuous-time path integral quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low temperatures, the new algorithm has many advantages over conventional algorithms. For example, the model can be easily simulated in the Kondo limit without time discretization errors. Furthermore, many observables including the impurity susceptibility and a variety of fermionic observables can be calculated efficiently. Finally the new approach allows us to explore a general technique, called the multilevel algorithm, to solve the sign problem. We find that the multilevel algorithm is able to generate an exponentially large number of configurations with an effort that grows as a polynomial in inverse temperature such that configurations with a positive sign dominate over those with negative signs. Our algorithm can be easily generalized to other multi-impurity problems.
The sign problem is a major obstacle in quantum Monte Carlo simulations for many-body fermion systems. We examine this problem with a new perspective based on the Majorana reflection positivity and Majorana Kramers positivity. Two sufficient conditions are proven for the absence of the fermion sign problem. Our proof provides a unified description for all the interacting lattice fermion models previously known to be free of the sign problem based on the auxiliary field quantum Monte Carlo method. It also allows us to identify a number of new sign-problem-free interacting fermion models including, but not limited to, lattice fermion models with repulsive interactions but without particle-hole symmetry, and interacting topological insulators with spin-flip terms.
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 discuss the fermion sign problem and, by examining a very general Hubbard-Stratonovich transformation, argue that the sign problem cannot be solved with such methods. We propose a different kind of transformation which, while not solving the sign problem, shows more detailed information about the system. With our transformation it is trivial to tell which auxiliary field configurations give a positive sign and which give a negative sign. We then discuss briefly various properties of this transformation and construct an algorithm which with one simulation gives results for a whole range of particle densities and Hubbard U values, positive and negative. Our approach is in excellent agreement with exact calculations.