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:2604.02130

Stable and Efficient Algorithms for the Fermion Determinant

Johann Ostmeyer

Published Apr 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Some algorithms for the numerically exact treatment of fermion determinants are summarised. This is not supposed to be a review, rather a concise handbook. The audience is expected to have a basic understanding of how to put fermions on a computer. We primarily discuss different ways to work with the fermion matrix in the "sausage" (Green's function) formulation for quantum Monte Carlo (QMC). We emphasise the need for varied approaches in different space-time volume regimes. In particular, for small spatial volumes we describe a numerically stable method based on dense matrix operations. It is designed specifically to deal with very low temperature regimes. On the other hand, for (relatively) large volumes we describe a highly efficient and scalable sparse matrix approach.

DOI
10.48550/arxiv.2604.02130

Related papers

Fast and stable determinant quantum Monte Carlo

Carsten Bauer

We assess numerical stabilization methods employed in fermion many-body quantum Monte Carlo simulations. In particular, we empirically compare various matrix decomposition and inversion schemes to gain control over numerical instabilities arising in the computation of equal-time and time-displaced Green's functions within the determinant quantum Monte Carlo (DQMC) framework. Based on this comparison, we identify a procedure based on pivoted QR decompositions which is both efficient and accurate to machine precision. The Julia programming language is used for the assessment and implementations of all discussed algorithms are provided in the open-source software library StableDQMC.jl.

arXiv:2003.05286•SciPost Physics Core•Jun 29, 2020•13 citations

Introduction to Quantum Monte Carlo simulations for fermionic systems

Raimundo R. dos Santos

We tutorially review the determinantal Quantum Monte Carlo method for fermionic systems, using the Hubbard model as a case study. Starting with the basic ingredients of Monte Carlo simulations for classical systems, we introduce aspects such as importance sampling, sources of errors, and finite-size scaling analyses. We then set up the preliminary steps to prepare for the simulations, showing that they are actually carried out by sampling discrete Hubbard-Stratonovich auxiliary fields. In this process the Green's function emerges as a fundamental tool, since it is used in the updating process, and, at the same time, it is directly related to the quantities probing magnetic, charge, metallic, and superconducting behaviours. We also discuss the as yet unresolved "minus-sign problem", and two ways to stabilize the algorithm at low temperatures.

arXiv:cond-mat/0303551•Mar 26, 2003•0 citations

Introduction to quantum Monte Carlo simulations for fermionic systems

Raimundo R. dos Santos

We tutorially review the determinantal Quantum Monte Carlo method for fermionic systems, using the Hubbard model as a case study. Starting with the basic ingredients of Monte Carlo simulations for classical systems, we introduce aspects such as importance sampling, sources of errors, and finite-size scaling analyses. We then set up the preliminary steps to prepare for the simulations, showing that they are actually carried out by sampling discrete Hubbard-Stratonovich auxiliary fields. In this process the Green's function emerges as a fundamental tool, since it is used in the updating process, and, at the same time, it is directly related to the quantities probing magnetic, charge, metallic, and superconducting behaviours. We also discuss the as yet unresolved ‘minus-sign problem', and two ways to stabilize the algorithm at low temperatures.

Brazilian Journal of Physics•Mar 1, 2003•167 citations

Stable determinant Monte Carlo simulations at low temperatures

Thomas Luu, Johann Ostmeyer, Petar Sinilkov +1 more

At low temperatures $T$ where $1/T=β\gg1$ the naïve implementation of determinant quantum Monte Carlo (DQMC) methods suffers from loss of precision and numerical instabilities when evaluating the fermion determinant. This instability propagates into the calculation of observables that rely on the evaluation of the inverse of the fermion matrix, or the Greens function. For DQMC methods that rely on the Hamiltonian Monte Carlo (HMC) algorithm, an additional complication comes from evaluating the force terms required for integrating Hamilton's equations of motion, since here loss of precision and numerical instabilities are also prevalent. We show how to address all these issues using various choices of matrix decompositions, allowing us to simulate at $β\gtrsim 90$, which corresponds to room temperature for graphene structures. Furthermore, our implementation has numerical costs that scale similarly to the naïve implementation, namely as $\mathcal{O}(N_x^3N_t)$, where $N_x$ ($N_t$) is the number of spatial (temporal) sites.

arXiv:2604.00815•Physical review. B./Physical review. B•Oct 27, 2026•0 citations

Sign-Problem-Free Fermionic Quantum Monte Carlo: Developments and Applications

Zi-Xiang Li, Hong Yao

Reliable simulations of correlated quantum systems, including high-temperature superconductors and frustrated magnets, are increasingly desired nowadays to further our understanding of essential features in such systems. Quantum Monte Carlo (QMC) is a unique numerically exact and intrinsically unbiased method to simulate interacting quantum many-body systems. More importantly, when QMC simulations are free from the notorious fermion sign problem, they can reliably simulate interacting quantum models with large system size and low temperature to reveal low-energy physics such as spontaneously broken symmetries and universal quantum critical behaviors. Here, we concisely review recent progress made in developing new sign-problem-free QMC algorithms, including those employing Majorana representation and those utilizing hot-spot physics. We also discuss applications of these novel sign-problem-free QMC algorithms in simulations of various interesting quantum many-body models. Finally, we discuss possible future directions of designing sign-problem-free QMC methods.

arXiv:1805.08219•Annual Review of Condensed Matter Physics•Dec 19, 2018•126 citations

Stable monte carlo algorithm for fermion lattice systems at low temperatures

J. E. Hirsch

We discuss Monte Carlo algorithms for fermion lattice systems based on exact updating of the fermion Green's function. A space and a space-time algorithm are shown to be limiting cases of a formulation that smoothly interpolates between them. This new formulation can to a large extent preserve the desirable features of both limits and suppress the undesirable ones.

Physical review. B, Condensed matter•Dec 1, 1988•76 citations
Some algorithms for the numerically exact treatment of fermion determinants are summarised. This is not supposed to be a review, rather a concise handbook. The audience is expected to have a basic understanding of how to put fermions on a computer. We primarily discuss different ways to work with the fermion matrix in the "sausage" (Green's function) formulation for quantum Monte Carlo (QMC). We emphasise the need for varied approaches in different space-time volume regimes. In particular, for small spatial volumes we describe a numerically stable method based on dense matrix operations. It is designed specifically to deal with very low temperature regimes. On the other hand, for (relatively) large volumes we describe a highly efficient and scalable sparse matrix approach.
We assess numerical stabilization methods employed in fermion many-body quantum Monte Carlo simulations. In particular, we empirically compare various matrix decomposition and inversion schemes to gain control over numerical instabilities arising in the computation of equal-time and time-displaced Green's functions within the determinant quantum Monte Carlo (DQMC) framework. Based on this comparison, we identify a procedure based on pivoted QR decompositions which is both efficient and accurate to machine precision. The Julia programming language is used for the assessment and implementations of all discussed algorithms are provided in the open-source software library StableDQMC.jl.
We tutorially review the determinantal Quantum Monte Carlo method for fermionic systems, using the Hubbard model as a case study. Starting with the basic ingredients of Monte Carlo simulations for classical systems, we introduce aspects such as importance sampling, sources of errors, and finite-size scaling analyses. We then set up the preliminary steps to prepare for the simulations, showing that they are actually carried out by sampling discrete Hubbard-Stratonovich auxiliary fields. In this process the Green's function emerges as a fundamental tool, since it is used in the updating process, and, at the same time, it is directly related to the quantities probing magnetic, charge, metallic, and superconducting behaviours. We also discuss the as yet unresolved "minus-sign problem", and two ways to stabilize the algorithm at low temperatures.
We tutorially review the determinantal Quantum Monte Carlo method for fermionic systems, using the Hubbard model as a case study. Starting with the basic ingredients of Monte Carlo simulations for classical systems, we introduce aspects such as importance sampling, sources of errors, and finite-size scaling analyses. We then set up the preliminary steps to prepare for the simulations, showing that they are actually carried out by sampling discrete Hubbard-Stratonovich auxiliary fields. In this process the Green's function emerges as a fundamental tool, since it is used in the updating process, and, at the same time, it is directly related to the quantities probing magnetic, charge, metallic, and superconducting behaviours. We also discuss the as yet unresolved ‘minus-sign problem', and two ways to stabilize the algorithm at low temperatures.
At low temperatures TTT where 1/T=β≫11/T=β\gg11/T=β≫1 the naïve implementation of determinant quantum Monte Carlo (DQMC) methods suffers from loss of precision and numerical instabilities when evaluating the fermion determinant. This instability propagates into the calculation of observables that rely on the evaluation of the inverse of the fermion matrix, or the Greens function. For DQMC methods that rely on the Hamiltonian Monte Carlo (HMC) algorithm, an additional complication comes from evaluating the force terms required for integrating Hamilton's equations of motion, since here loss of precision and numerical instabilities are also prevalent. We show how to address all these issues using various choices of matrix decompositions, allowing us to simulate at β≳90β\gtrsim 90β≳90, which corresponds to room temperature for graphene structures. Furthermore, our implementation has numerical costs that scale similarly to the naïve implementation, namely as O(Nx3Nt)\mathcal{O}(N_x^3N_t)O(Nx3​Nt​), where NxN_xNx​ (NtN_tNt​) is the number of spatial (temporal) sites.
Reliable simulations of correlated quantum systems, including high-temperature superconductors and frustrated magnets, are increasingly desired nowadays to further our understanding of essential features in such systems. Quantum Monte Carlo (QMC) is a unique numerically exact and intrinsically unbiased method to simulate interacting quantum many-body systems. More importantly, when QMC simulations are free from the notorious fermion sign problem, they can reliably simulate interacting quantum models with large system size and low temperature to reveal low-energy physics such as spontaneously broken symmetries and universal quantum critical behaviors. Here, we concisely review recent progress made in developing new sign-problem-free QMC algorithms, including those employing Majorana representation and those utilizing hot-spot physics. We also discuss applications of these novel sign-problem-free QMC algorithms in simulations of various interesting quantum many-body models. Finally, we discuss possible future directions of designing sign-problem-free QMC methods.