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

Recent Developments in Fermion Simulation Algorithms

Karl Jansen, Hamburg (Germany). Projekttraeger ''Erforschung der Kondensierten Materie: Synchrotronstrahlung'' Deutsches Elektronen-Synchrotron (DESY)

Published Jan 1, 1996• 6 citations
OpenAlex

Abstract

A summary of recent developments in the field of simulation algorithms for dynamical fermions is given. (orig.)

Related papers

a New Algorithm for the Numerical Simulation of Fermions

Richard T. Scalettar

•Jan 1, 1986•0 citations

Fast classical simulation algorithms for free-fermion dynamics with magic input

Jiwon Heo, Oliver Reardon-Smith, Michał Oszmaniec +2 more

The classical cost of simulating free-fermion (matchgate) circuits depends on both the input state and the computational task. We develop classical algorithms for circuits with non-Gaussian inputs, addressing exact sampling and both additive-error and exact estimation of expectation values. For inputs consisting of $n$ copies of the four-mode magic state, we give exact sampling algorithms, generalizing the Clifford and Clifford algorithm for Boson sampling, for passive and active free-fermion dynamics with worst-case arithmetic cost $O(2^n)$ per sample, without any multiplicative polynomial prefactor. The passive algorithm enables an exact simulation of the non-interacting regime of a recent trapped-ion experiment. We also extend recently developed additive-error estimation of number correlators and related observables from passive to active dynamics with runtime polynomial in $n$ and the inverse additive-error, for input states formed by products of $n$ four-mode even parity states. Our estimator uses a Gaussian-state decomposition adapted to each sampled state to control its second moment. This includes estimation of individual output probabilities. Finally, we show that for even-parity product inputs composed of constant-size blocks, expectation values of Majorana monomials of logarithmic weight can be computed exactly in polynomial time, improving on prior Majorana propagation-style algorithms with quasi-polynomial runtime. The exact algorithm processes the input blocks by dynamic programming, sharing calculations across subsets of Majorana factors. Our suite of algorithms provide classical benchmarks for fermionic quantum simulations across a broad spectrum of computational tasks.

quant-pharXiv:2609.40187•Oct 1, 2026•0 citations

Quadratically optimized polynomials for fermion simulations

Istvan Montvay, Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

An algorithm for the computation of the coefficients and roots of quadratically optimized polynomials is described. An implementation in the algebraic manipulation language Maple is discussed. These polynomials can be used in local bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. (orig.)

•Jan 1, 1997•26 citations

Comparative Study of Numerical Techniques for the Simulation of the 1-D Spinless Fermion Model.

G. M. Buendía

•Sep 1, 1987•0 citations

FERMION SIMULATIONS OF CORRELATED SYSTEMS

Masatoshi Imada

Recently developed simulation algorithms for strongly correlated lattice fermions are reviewed. The simulation methods which we describe are based on the path-integral formalism. Basic algorithms for auxiliary-field methods as well as prescriptions for reducing the minus-sign problem are presented. As an important application, ground state properties of the Hubbard model are discussed in the light of recent simulation results. Clarified so far, important features of antiferromagnetic transitions, metal-insulator transitions and pairing mechanisms in strongly correlated systems are summarized. Recent applications of the fermion Monte Carlo method to other fermion models with degenerate orbitals such as the d - p model are also reviewed. Heavy fermion systems, exhibiting a variety of crossovers such as the temperature crossover between the intersite antiferromagnetic correlation and the local singlet formation, are also discussed. Pairing mechanisms examined numerically in a variety of extended lattice models are briefly sketched.

WORLD SCIENTIFIC eBooks•Dec 1, 1993•1 citation

ABOUT THE FEASIBILITY OF MONTE CARLO CALCULATIONS FOR FERMIONIC HAMILTONIANS

G. Puddu

Il Nuovo Cimento B•Apr 1, 1998•0 citations
The classical cost of simulating free-fermion (matchgate) circuits depends on both the input state and the computational task. We develop classical algorithms for circuits with non-Gaussian inputs, addressing exact sampling and both additive-error and exact estimation of expectation values. For inputs consisting of nnn copies of the four-mode magic state, we give exact sampling algorithms, generalizing the Clifford and Clifford algorithm for Boson sampling, for passive and active free-fermion dynamics with worst-case arithmetic cost O(2n)O(2^n)O(2n) per sample, without any multiplicative polynomial prefactor. The passive algorithm enables an exact simulation of the non-interacting regime of a recent trapped-ion experiment. We also extend recently developed additive-error estimation of number correlators and related observables from passive to active dynamics with runtime polynomial in nnn and the inverse additive-error, for input states formed by products of nnn four-mode even parity states. Our estimator uses a Gaussian-state decomposition adapted to each sampled state to control its second moment. This includes estimation of individual output probabilities. Finally, we show that for even-parity product inputs composed of constant-size blocks, expectation values of Majorana monomials of logarithmic weight can be computed exactly in polynomial time, improving on prior Majorana propagation-style algorithms with quasi-polynomial runtime. The exact algorithm processes the input blocks by dynamic programming, sharing calculations across subsets of Majorana factors. Our suite of algorithms provide classical benchmarks for fermionic quantum simulations across a broad spectrum of computational tasks.
Recently developed simulation algorithms for strongly correlated lattice fermions are reviewed. The simulation methods which we describe are based on the path-integral formalism. Basic algorithms for auxiliary-field methods as well as prescriptions for reducing the minus-sign problem are presented. As an important application, ground state properties of the Hubbard model are discussed in the light of recent simulation results. Clarified so far, important features of antiferromagnetic transitions, metal-insulator transitions and pairing mechanisms in strongly correlated systems are summarized. Recent applications of the fermion Monte Carlo method to other fermion models with degenerate orbitals such as the d - p model are also reviewed. Heavy fermion systems, exhibiting a variety of crossovers such as the temperature crossover between the intersite antiferromagnetic correlation and the local singlet formation, are also discussed. Pairing mechanisms examined numerically in a variety of extended lattice models are briefly sketched.