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

1 Grassmann integrals by machine

Michael J. Creutz

Published Jan 1, 1999• 3 citations
OpenAlex

Abstract

I present a numerical algorithm for direct evaluation of multiple Grassmann integrals. The approach is exact and suffers no Fermion sign problems. Memory requirements grow exponentially with the interaction range and the transverse size of the system. Low dimensional systems of order a thousand Grassmann variables can be evaluated on a workstation. In quantum field theory fermions are usually treated via integrals over anti-commuting Grassmann variables [2], providing an elegant framework for the formal establishment of Feynman perturbation theory. With non-perturbative approaches, such as Monte Carlo studies on the lattice, these objects are more problematic. Essentially all approaches formally integrate the fermionic fields in terms of determinants depending only on bosonic fields. When a background

Related papers

Evaluating Grassmann Integrals

Michael J. Creutz

I discuss a simple numerical algorithm for direct evaluation of multiple Grassmann integrals. The approach is exact, suffers no fermion sign problems, and allows arbitrarily complicated interactions. Memory requirements grow exponentially with the interaction range and the transverse size of the system. Low dimensional systems with 1000 Grassmann variables can be evaluated on a workstation. The technique is illustrated with a spinless fermion hopping along a one dimensional chain.

arXiv:hep-lat/9806037•Physical Review Letters•Oct 26, 1998•20 citations

DIRECT SIMULATIONS OF SMALL MULTI-FERMION SYSTEMS

Michael J. Creutz

I explore computer simulations of the dynamics of small multi-fermion lattice systems. The method is more general, but I concentrate on Hubbard type models where the fermions hop between a small number of connected sites. I use the natural mapping of fermion occupation numbers onto computer bits. Signs from fermion interchange are reduced to bit counting. The technique inherently requires computer resources growing exponentially with the system volume; so, it restricted to modestly small systems. Large volume results would require combining these techniques with further approximations, perhaps in a recursive renormalization group manner.

arXiv:hep-lat/0212034•International Journal of Modern Physics C•Oct 1, 2003•1 citation

Grassmannization of classical models

Lode Pollet, Mikhail N. Kiselev, Nikolay V. Prokof'ev +1 more

Applying Feynman diagrammatics to non-fermionic strongly correlated models with local constraints might seem generically impossible for two separate reasons: (i) the necessity to have a Gaussian (non-interacting) limit on top of which the perturbative diagrammatic expansion is generated by Wick’s theorem, and (ii) Dyson’s collapse argument implying that the expansion in powers of coupling constant is divergent. We show that for arbitrary classical lattice models both problems can be solved/circumvented by reformulating the high-temperature expansion (more generally, any discrete representation of the model) in terms of Grassmann integrals. Discrete variables residing on either links, plaquettes, or sites of the lattice are associated with the Grassmann variables in such a way that the partition function (as well as all correlation functions) of the original system and its Grassmann-field counterpart are identical. The expansion of the latter around its Gaussian point generates Feynman diagrams. Our work paves the way for studying lattice gauge theories by treating bosonic and fermionic degrees of freedom on equal footing.

arXiv:1605.01953•New Journal of Physics•Nov 10, 2016•7 citations

Stable and Efficient Algorithms for the Fermion Determinant

Johann Ostmeyer

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.

arXiv:2604.02130•Apr 2, 2026•0 citations

Diagrammatic Methods for Strongly-Correlated Electrons in Realistic Systems

Jia Li

This thesis is devoted to the development of numerical methods for correlated electrons in realistic systems based on perturbation theories using Feynman diagrams. Electron correlations in realistic systems give rise to a wide range of interesting physical properties. Diagrammatic expansions and its low-order approximations are key building blocks of theoretical and numerical methods for studying correlated electrons. Recent developments of the diagrammatic quantum Monte Carlo (DiagMC) methods enable efficient stochastic evaluations of diagrams and does not suffer from numerical sign problem which worsens with increasing system size. It is therefore a promising direction to apply DiagMC techniques to realistic electron systems in the pursuit of ab initio calculations of correlated materials. This thesis starts by reviewing basic concepts and definitions of realistic electron systems, the perturbation theory based on Feynman diagrams, Monte Carlo evaluations of the series, as well as self-consistent diagrammatic methods. Low-order diagrammatic methods are applied to realistic calculations and benchmarked against large collections of state-of-the-art many-body methods. The thesis then proposes a diagrammatic Monte Carlo solver for realistic molecules and impurities based on a recursive evaluation of diagrams, which is tested on realistic molecules and impurities with varying temperature, system size, and interaction strength. We observe that this method is ideal for problems with many orbitals with moderate correlations, but may suffer from series divergence at strong correlations. Next, we propose the inchworm Monte Carlo algorithm for interaction expansion, which overcomes limitations of divergent diagrammatic series by replacing the standard perturbation series with a sequence of incremental series expansions. A prototype implementation is presented for system with on-site Hubbard interactions. Finally, we discuss technical aspects of numerical representations of the Green's function, which has significant impact on the efficiency of diagrammatic methods. We review several common numerical representations, and introduce our development of the sparse sampling method, which provides compact representations of the Green's function in both imaginary time and frequency as well as fast transformation formula between the two.

•Jan 1, 2021•0 citations

Disentangling and machine learning the many-fermion problem

Peter Broecker

One of the most intriguing areas of physics is the study of strongly correlated many-body systems. In these kinds of systems, a large number of particles interacts via interactions that are strong enough to play a major role in determining the properties of the system, which is particularly interesting when multiple interaction terms compete and cannot be satisfied simultaneously. Examples of phases they realize range from simple magnetism to puzzling phenomena such as superconductivity or topological order. Of special interest in condensed matter are fermionic models which have an extra layer of complexity added by the possibly intricate sign structure of the wave function. \nHowever, exactly solvable models that exhibit the sought-after phenomena are scarce and Hamiltonians that are supposed to model experiments often elude analytical solutions precisely due to the strong interactions. Numerical methods are thus essential to gain insight into these systems and provide an important link between theoretical models and real world experiments. There are many different methods that in principle allow solving a problem numerically exact, most prominently exact diagonalization, tensor network based methods such as DMRG and (quantum) Monte Carlo. Exact diagonalization is certainly the most straightforward technique which allows measuring any observable of interest but its application to interacting models is severely limited by the exponential growth of the Hilbert space with the system size which only allows studying rather small systems. Tensor network methods excel in the study of gapped, one-dimensional systems and while they have shown some impressive results for two-dimensional systems, they need a lot of fine tuning and careful analysis to be considered reliable in this very important domain. Quantum Monte Carlo, on the other hand, is in principle neither limited by the size of the Hilbert space nor by the strength of the interactions and has thus been a tremendously important tool for studying condensed matter systems which is why it is the focus of this thesis. \nIt is necessary to continuously advance existing and develop new techniques to keep up with theoretical as well as with experimental progress. In this thesis, new methods to identify and characterize conventional and novel phases of matter within quantum Monte Carlo are developed and tested on archetypical models of condensed matter. \nIn the first part of this thesis, a method to study entanglement properties of strongly interacting fermionic models in quantum Monte Carlo is presented. Measurements of this kind are needed because some characteristics of a system remain hidden from conventional approaches based on the calculation of correlation functions. Prime examples are systems that realize so-called topological order entailing long-range entanglement that can be positively diagnosed using entanglement techniques. Realizing such measurements in a concrete algorithm is not straightforward for fermions. A large section of this part is thus devoted to developing a solution to the problem of implementing entanglement measurements and benchmarking the results against known data. \nThe second part is concerned with a truly novel and recent approach to the many-body problem, namely the symbiosis of machine learning and quantum Monte Carlo techniques. Out of the many different possibilities to combine the two, this part is concerne with exploring ways in which machine learning can help to effortlessly explore phase diagrams of hitherto unknown Hamiltonians. \nDespite the power and versatility of quantum Monte Carlo techniques, it does suffer from one significant weakness called the fermion sign problem. At its core related to the peculiar exchange statistics of fermions, it is in principle merely a technical problem of the Monte Carlo procedure but one that actually prohibits the use of Monte Carlo methods for a large number of interesting problems. The sign problem has been known for a long time but remains unsolved to this day. Thus, it is time to approach the problem from a different perspective with the hope of learning something new that can either help to better understand the problem itself or the properties of the models affected by it. Both of the two major research areas, entanglement measures and machine learning, are capable of providing such new perspectives and the sign problem will be revisited in more detail in the context of each of them.

•Jan 1, 2018•0 citations
I present a numerical algorithm for direct evaluation of multiple Grassmann integrals. The approach is exact and suffers no Fermion sign problems. Memory requirements grow exponentially with the interaction range and the transverse size of the system. Low dimensional systems of order a thousand Grassmann variables can be evaluated on a workstation. In quantum field theory fermions are usually treated via integrals over anti-commuting Grassmann variables [2], providing an elegant framework for the formal establishment of Feynman perturbation theory. With non-perturbative approaches, such as Monte Carlo studies on the lattice, these objects are more problematic. Essentially all approaches formally integrate the fermionic fields in terms of determinants depending only on bosonic fields. When a background
I explore computer simulations of the dynamics of small multi-fermion lattice systems. The method is more general, but I concentrate on Hubbard type models where the fermions hop between a small number of connected sites. I use the natural mapping of fermion occupation numbers onto computer bits. Signs from fermion interchange are reduced to bit counting. The technique inherently requires computer resources growing exponentially with the system volume; so, it restricted to modestly small systems. Large volume results would require combining these techniques with further approximations, perhaps in a recursive renormalization group manner.
Applying Feynman diagrammatics to non-fermionic strongly correlated models with local constraints might seem generically impossible for two separate reasons: (i) the necessity to have a Gaussian (non-interacting) limit on top of which the perturbative diagrammatic expansion is generated by Wick’s theorem, and (ii) Dyson’s collapse argument implying that the expansion in powers of coupling constant is divergent. We show that for arbitrary classical lattice models both problems can be solved/circumvented by reformulating the high-temperature expansion (more generally, any discrete representation of the model) in terms of Grassmann integrals. Discrete variables residing on either links, plaquettes, or sites of the lattice are associated with the Grassmann variables in such a way that the partition function (as well as all correlation functions) of the original system and its Grassmann-field counterpart are identical. The expansion of the latter around its Gaussian point generates Feynman diagrams. Our work paves the way for studying lattice gauge theories by treating bosonic and fermionic degrees of freedom on equal footing.
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.
This thesis is devoted to the development of numerical methods for correlated electrons in realistic systems based on perturbation theories using Feynman diagrams. Electron correlations in realistic systems give rise to a wide range of interesting physical properties. Diagrammatic expansions and its low-order approximations are key building blocks of theoretical and numerical methods for studying correlated electrons. Recent developments of the diagrammatic quantum Monte Carlo (DiagMC) methods enable efficient stochastic evaluations of diagrams and does not suffer from numerical sign problem which worsens with increasing system size. It is therefore a promising direction to apply DiagMC techniques to realistic electron systems in the pursuit of ab initio calculations of correlated materials. This thesis starts by reviewing basic concepts and definitions of realistic electron systems, the perturbation theory based on Feynman diagrams, Monte Carlo evaluations of the series, as well as self-consistent diagrammatic methods. Low-order diagrammatic methods are applied to realistic calculations and benchmarked against large collections of state-of-the-art many-body methods. The thesis then proposes a diagrammatic Monte Carlo solver for realistic molecules and impurities based on a recursive evaluation of diagrams, which is tested on realistic molecules and impurities with varying temperature, system size, and interaction strength. We observe that this method is ideal for problems with many orbitals with moderate correlations, but may suffer from series divergence at strong correlations. Next, we propose the inchworm Monte Carlo algorithm for interaction expansion, which overcomes limitations of divergent diagrammatic series by replacing the standard perturbation series with a sequence of incremental series expansions. A prototype implementation is presented for system with on-site Hubbard interactions. Finally, we discuss technical aspects of numerical representations of the Green's function, which has significant impact on the efficiency of diagrammatic methods. We review several common numerical representations, and introduce our development of the sparse sampling method, which provides compact representations of the Green's function in both imaginary time and frequency as well as fast transformation formula between the two.
One of the most intriguing areas of physics is the study of strongly correlated many-body systems. In these kinds of systems, a large number of particles interacts via interactions that are strong enough to play a major role in determining the properties of the system, which is particularly interesting when multiple interaction terms compete and cannot be satisfied simultaneously. Examples of phases they realize range from simple magnetism to puzzling phenomena such as superconductivity or topological order. Of special interest in condensed matter are fermionic models which have an extra layer of complexity added by the possibly intricate sign structure of the wave function. \nHowever, exactly solvable models that exhibit the sought-after phenomena are scarce and Hamiltonians that are supposed to model experiments often elude analytical solutions precisely due to the strong interactions. Numerical methods are thus essential to gain insight into these systems and provide an important link between theoretical models and real world experiments. There are many different methods that in principle allow solving a problem numerically exact, most prominently exact diagonalization, tensor network based methods such as DMRG and (quantum) Monte Carlo. Exact diagonalization is certainly the most straightforward technique which allows measuring any observable of interest but its application to interacting models is severely limited by the exponential growth of the Hilbert space with the system size which only allows studying rather small systems. Tensor network methods excel in the study of gapped, one-dimensional systems and while they have shown some impressive results for two-dimensional systems, they need a lot of fine tuning and careful analysis to be considered reliable in this very important domain. Quantum Monte Carlo, on the other hand, is in principle neither limited by the size of the Hilbert space nor by the strength of the interactions and has thus been a tremendously important tool for studying condensed matter systems which is why it is the focus of this thesis. \nIt is necessary to continuously advance existing and develop new techniques to keep up with theoretical as well as with experimental progress. In this thesis, new methods to identify and characterize conventional and novel phases of matter within quantum Monte Carlo are developed and tested on archetypical models of condensed matter. \nIn the first part of this thesis, a method to study entanglement properties of strongly interacting fermionic models in quantum Monte Carlo is presented. Measurements of this kind are needed because some characteristics of a system remain hidden from conventional approaches based on the calculation of correlation functions. Prime examples are systems that realize so-called topological order entailing long-range entanglement that can be positively diagnosed using entanglement techniques. Realizing such measurements in a concrete algorithm is not straightforward for fermions. A large section of this part is thus devoted to developing a solution to the problem of implementing entanglement measurements and benchmarking the results against known data. \nThe second part is concerned with a truly novel and recent approach to the many-body problem, namely the symbiosis of machine learning and quantum Monte Carlo techniques. Out of the many different possibilities to combine the two, this part is concerne with exploring ways in which machine learning can help to effortlessly explore phase diagrams of hitherto unknown Hamiltonians. \nDespite the power and versatility of quantum Monte Carlo techniques, it does suffer from one significant weakness called the fermion sign problem. At its core related to the peculiar exchange statistics of fermions, it is in principle merely a technical problem of the Monte Carlo procedure but one that actually prohibits the use of Monte Carlo methods for a large number of interesting problems. The sign problem has been known for a long time but remains unsolved to this day. Thus, it is time to approach the problem from a different perspective with the hope of learning something new that can either help to better understand the problem itself or the properties of the models affected by it. Both of the two major research areas, entanglement measures and machine learning, are capable of providing such new perspectives and the sign problem will be revisited in more detail in the context of each of them.