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/0408123 · Physical Review E

Multilevel algorithm for quantum-impurity models

Jaebeom Yoo, Shailesh Chandrasekharan A, Harold U. Baranger

Published Mar 31, 2005• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreve.71.036708

Related papers

Multilevel Blocking Approach to the Fermion Sign Problem in Path-Integral Monte Carlo Simulations

Chi H. Mak, Reinhold Egger, H. Weber-Gottschick

A general algorithm toward the solution of the fermion sign problem in finite-temperature quantum Monte Carlo simulations has been formulated for discretized fermion path integrals with nearest-neighbor interactions in the Trotter direction. This multilevel approach systematically implements a simple blocking strategy in a recursive manner to synthesize the sign cancellations among different fermionic paths throughout the whole configuration space. The practical usefulness of the method is demonstrated for interacting electrons in a quantum dot.

arXiv:cond-mat/9810002•Physical Review Letters•Nov 23, 1998•70 citations

Negative sign problem in continuous-time quantum Monte Carlo: Optimal choice of single-particle basis for impurity problems

Hiroshi Shinaoka, Yusuke Nomura, Silke Biermann +2 more

The negative sign problem in quantum Monte Carlo (QMC) simulations of cluster impurity problems is the major bottleneck in cluster dynamical mean-field calculations. In this paper, we systematically investigate the dependence of the sign problem on the single-particle basis. We explore both the hybridization-expansion and interaction-expansion variants of continuous-time QMC simulations for three-site and four-site impurity models with baths that are diagonal in the orbital degrees of freedom. We find that the sign problem in these models can be substantially reduced by using a nontrivial single-particle basis. Such bases can be generated by diagonalizing a subset of the intracluster hoppings.

arXiv:1508.06741•Physical Review B•Nov 13, 2015•39 citations

Continuous-Time Quantum Monte Carlo Method for the Coqblin–Schrieffer Model

Junya Otsuki, Hiroaki Kusunose, Philipp Werner +1 more

An impurity solver based on a continuous-time quantum Monte Carlo method is developed for the Coqblin-Schrieffer model. The Monte Carlo simulation does not encounter a sign problem for antiferromagnetic interactions, and accurately reproduces the Kondo effect. Our algorithm can deal with an arbitrary number N of local degrees of freedom, becomes more efficient for larger values of N, and is hence suitable for models with orbital degeneracy. The dynamical susceptibility and the impurity t-matrix are derived with the aid of the Padé approximation for various values of N, and good agreement is found with other methods and available exact results. We point out that the Korringa-Shiba relation needs correction for a finite value of the exchange interaction.

arXiv:0708.0718•Journal of the Physical Society of Japan•Oct 24, 2007•68 citations

Path Integral Monte Carlo Methods for Fermions

Ethan Brown

In general, Quantum Monte Carlo methods suffer from a sign problem when simulating fermionic systems. This causes the efficiency of a simulation to decrease exponentially with the number of particles and inverse temperature. To circumvent this issue, a nodal constraint is often implemented, restricting the Monte Carlo procedure from sampling paths that cause the many-body density matrix to change sign. Unfortunately, this high-dimensional nodal surface is not a priori known unless the system is exactly solvable, resulting in uncontrolled errors. We will discuss two possible routes to extend the applicability of finite-temperatue path integral Monte Carlo. First we extend the regime where signful simulations are possible through a novel permutation sampling scheme. Afterwards, we discuss a method to variationally improve the nodal surface by minimizing a free energy during simulation. Applications of these methods will include both free and interacting electron gases, concluding with discussion concerning extension to inhomogeneous systems.

•Jan 1, 2014•0 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

A multilevel blocking approach to the sign problem in real-time quantum Monte Carlo simulations

Chi H. Mak, Reinhold Egger

We propose a novel approach toward the general solution of the sign problem in real-time path–integral simulations. Using a recursive multilevel blocking strategy, this method circumvents the sign problem by synthesizing the phase cancellations arising from interfering quantum paths on multiple timescales. A number of numerical examples with one or a few explicit degrees of freedom illustrate the usefulness of the method.

arXiv:physics/9810058•The Journal of Chemical Physics•Jan 1, 1999•65 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 general algorithm toward the solution of the fermion sign problem in finite-temperature quantum Monte Carlo simulations has been formulated for discretized fermion path integrals with nearest-neighbor interactions in the Trotter direction. This multilevel approach systematically implements a simple blocking strategy in a recursive manner to synthesize the sign cancellations among different fermionic paths throughout the whole configuration space. The practical usefulness of the method is demonstrated for interacting electrons in a quantum dot.
The negative sign problem in quantum Monte Carlo (QMC) simulations of cluster impurity problems is the major bottleneck in cluster dynamical mean-field calculations. In this paper, we systematically investigate the dependence of the sign problem on the single-particle basis. We explore both the hybridization-expansion and interaction-expansion variants of continuous-time QMC simulations for three-site and four-site impurity models with baths that are diagonal in the orbital degrees of freedom. We find that the sign problem in these models can be substantially reduced by using a nontrivial single-particle basis. Such bases can be generated by diagonalizing a subset of the intracluster hoppings.
An impurity solver based on a continuous-time quantum Monte Carlo method is developed for the Coqblin-Schrieffer model. The Monte Carlo simulation does not encounter a sign problem for antiferromagnetic interactions, and accurately reproduces the Kondo effect. Our algorithm can deal with an arbitrary number N of local degrees of freedom, becomes more efficient for larger values of N, and is hence suitable for models with orbital degeneracy. The dynamical susceptibility and the impurity t-matrix are derived with the aid of the Padé approximation for various values of N, and good agreement is found with other methods and available exact results. We point out that the Korringa-Shiba relation needs correction for a finite value of the exchange interaction.
In general, Quantum Monte Carlo methods suffer from a sign problem when simulating fermionic systems. This causes the efficiency of a simulation to decrease exponentially with the number of particles and inverse temperature. To circumvent this issue, a nodal constraint is often implemented, restricting the Monte Carlo procedure from sampling paths that cause the many-body density matrix to change sign. Unfortunately, this high-dimensional nodal surface is not a priori known unless the system is exactly solvable, resulting in uncontrolled errors. We will discuss two possible routes to extend the applicability of finite-temperatue path integral Monte Carlo. First we extend the regime where signful simulations are possible through a novel permutation sampling scheme. Afterwards, we discuss a method to variationally improve the nodal surface by minimizing a free energy during simulation. Applications of these methods will include both free and interacting electron gases, concluding with discussion concerning extension to inhomogeneous systems.
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.