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

Multi-modification method toward solving sign problem

Takahiro M. Doi, Shoichiro Tsutsui

Published Sep 18, 2017• 0 citations
OpenAlex

Related papers

Can the sign problem be solved

Malvin H. Kalos

APS•Mar 1, 2001•0 citations

Solving Sign Problems with Meron Algorithms

Shailesh Chandrasekharan A, James C. Osborn

Springer proceedings in physics•Jan 1, 2001•6 citations

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

Steady-state properties of multi-orbital systems using quantum Monte Carlo

André Erpenbeck, Thomas Blommel, Lei Zhang +3 more

A precise dynamical characterization of quantum impurity models with multiple interacting orbitals is challenging. In quantum Monte Carlo methods, this is embodied by sign problems. A dynamical sign problem makes it exponentially difficult to simulate long times. A multi-orbital sign problem generally results in a prohibitive computational cost for systems with multiple impurity degrees of freedom even in static equilibrium calculations. Here, we present a numerically exact inchworm method that simultaneously alleviates both sign problems, enabling simulation of multi-orbital systems directly in the equilibrium or nonequilibrium steady-state. The method combines ideas from the recently developed steady-state inchworm Monte Carlo framework [Erpenbeck et al., Phys. Rev. Lett. 130, 186301 (2023)] with other ideas from the equilibrium multi-orbital inchworm algorithm [Eidelstein et al., Phys. Rev. Lett. 124, 206405 (2020)]. We verify our method by comparison with analytical limits and numerical results from previous methods.

arXiv:2407.00771•The Journal of Chemical Physics•Sep 4, 2024•12 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•33 citations

Approximations beyond the initiator approach for ameliorating the sign problem

Adam A. Holmes, Cyrus J. Umrigar, Bryan K. Clark

Bulletin of the American Physical Society•Mar 6, 2014•0 citations
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.
A precise dynamical characterization of quantum impurity models with multiple interacting orbitals is challenging. In quantum Monte Carlo methods, this is embodied by sign problems. A dynamical sign problem makes it exponentially difficult to simulate long times. A multi-orbital sign problem generally results in a prohibitive computational cost for systems with multiple impurity degrees of freedom even in static equilibrium calculations. Here, we present a numerically exact inchworm method that simultaneously alleviates both sign problems, enabling simulation of multi-orbital systems directly in the equilibrium or nonequilibrium steady-state. The method combines ideas from the recently developed steady-state inchworm Monte Carlo framework [Erpenbeck et al., Phys. Rev. Lett. 130, 186301 (2023)] with other ideas from the equilibrium multi-orbital inchworm algorithm [Eidelstein et al., Phys. Rev. Lett. 124, 206405 (2020)]. We verify our method by comparison with analytical limits and numerical results from previous methods.
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.