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

Matchgate circuit representation of fermionic Gaussian states: optimal preparation, approximation, and classical simulation

Marc Langer, Raúl Morral-Yepes, Gammon-Smith, Adam, Frank Pollmann, Barbara Kraus

Published Mar 5, 2026• 0 citations
Publisher

Abstract

This repository contains numerical code used to create data for the corresponding publication.
DOI
10.5281/zenodo.18875163

Related papers

Tunable transport in the mass-imbalanced Fermi Hubbard model

Philip Zechmann, Alvise Bastianello, Michael Knap

This repository contains code files used to create data and figures for the corresponding publication.

•May 24, 2022•1 citation

Matchgate circuit representation of fermionic Gaussian states: optimal preparation, approximation, and classical simulation

Marc Langer, Raúl Morral-Yepes, Adam Gammon-Smith +2 more

Fermionic Gaussian states (FGSs) and the associated matchgate circuits play a central role in quantum information theory and condensed matter physics. Despite being possibly highly entangled, they can still be efficiently simulated on classical computers. We address the question of how to optimally create such states when using matchgate circuits acting on product states. To this end, we derive lower bounds on the number of gates required to prepare an arbitrary pure FGS: We establish both an asymptotic bound on the minimal gate count over general nearest-neighbor gate sets and an exact bound for circuits composed solely of matchgates. We present explicit algorithms whose constructions saturate these bounds, thereby proving their optimality. We furthermore determine when an FGS can be prepared with a circuit of any given depth, and derive an algorithm that constructs such a circuit whenever this condition is satisfied, either exactly or approximately. Our results have direct applications to (approximate) state preparation and to disentangling procedures. Moreover, we introduce a new classical simulation algorithm for matchgate circuits, based entirely on manipulating the generating circuits of the FGSs. Finally, we briefly study an extension of our framework for $t$-doped Gaussian states and circuits.

quant-pharXiv:2603.05675•Mar 9, 2026•0 citations

Entanglement Pattern Transition of Quantum States from Directed Percolation

Julian Boesl, Frank Pollmann, Michael Knap

This repository contains numerical code used to create data for the corresponding publication.

•May 24, 2026•0 citations

Code and Data for "Exact fermionic matrix elements from the Bethe-ansatz solution of the Richardson-Gaudin Model"

Peter Johannsen, Valerii K. Kozin, Jelena Klinovaja +1 more

•Oct 14, 2026•0 citations

Fermionic Gaussian states: an introduction to numerical approaches

Jacopo Surace, Luca Tagliacozzo

This document is meant to be a practical introduction to the analytical and numerical manipulation of fermionic Gaussian systems. Starting from the basics, we move to relevant modern results and techniques, presenting numerical examples and studying relevant Hamiltonians, such as the transverse field Ising Hamiltonian, in detail. We finish introducing novel algorithms connecting fermionic Guassian states with matrix product states techniques. All the numerical examples make use of the free Julia package F_utilities.

arXiv:2111.08343•SciPost Physics Lecture Notes•May 16, 2022•84 citations

Disentangling strategies and entanglement transitions in unitary circuit games with matchgates

Raúl Morral-Yepes, Marc Langer, Adam Gammon-Smith +2 more

In unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system. The transition occurs at a certain rate at which the disentangler acts. We analyze such games within the context of matchgate dynamics, which equivalently corresponds to evolutions of non-interacting fermions. We first investigate general entanglement properties of fermionic Gaussian states (FGS). We introduce a representation of FGS using a minimal matchgate circuit capable of preparing the state and derive an algorithm based on a generalized Yang-Baxter relation for updating this representation as unitary operations are applied. This representation enables us to define a natural disentangling procedure that reduces the number of gates in the circuit, thereby decreasing the entanglement contained in the system. We then explore different strategies to disentangle the systems and study the unitary circuit game in two different scenarios: with braiding gates, i.e., the intersection of Clifford gates and matchgates, and with generic matchgates. For each model, we observe qualitatively different entanglement transitions, which we characterize both numerically and analytically.

arXiv:2507.05055•Quantum•Apr 28, 2026•0 citations
Fermionic Gaussian states (FGSs) and the associated matchgate circuits play a central role in quantum information theory and condensed matter physics. Despite being possibly highly entangled, they can still be efficiently simulated on classical computers. We address the question of how to optimally create such states when using matchgate circuits acting on product states. To this end, we derive lower bounds on the number of gates required to prepare an arbitrary pure FGS: We establish both an asymptotic bound on the minimal gate count over general nearest-neighbor gate sets and an exact bound for circuits composed solely of matchgates. We present explicit algorithms whose constructions saturate these bounds, thereby proving their optimality. We furthermore determine when an FGS can be prepared with a circuit of any given depth, and derive an algorithm that constructs such a circuit whenever this condition is satisfied, either exactly or approximately. Our results have direct applications to (approximate) state preparation and to disentangling procedures. Moreover, we introduce a new classical simulation algorithm for matchgate circuits, based entirely on manipulating the generating circuits of the FGSs. Finally, we briefly study an extension of our framework for ttt-doped Gaussian states and circuits.
This document is meant to be a practical introduction to the analytical and numerical manipulation of fermionic Gaussian systems. Starting from the basics, we move to relevant modern results and techniques, presenting numerical examples and studying relevant Hamiltonians, such as the transverse field Ising Hamiltonian, in detail. We finish introducing novel algorithms connecting fermionic Guassian states with matrix product states techniques. All the numerical examples make use of the free Julia package F_utilities.
In unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system. The transition occurs at a certain rate at which the disentangler acts. We analyze such games within the context of matchgate dynamics, which equivalently corresponds to evolutions of non-interacting fermions. We first investigate general entanglement properties of fermionic Gaussian states (FGS). We introduce a representation of FGS using a minimal matchgate circuit capable of preparing the state and derive an algorithm based on a generalized Yang-Baxter relation for updating this representation as unitary operations are applied. This representation enables us to define a natural disentangling procedure that reduces the number of gates in the circuit, thereby decreasing the entanglement contained in the system. We then explore different strategies to disentangle the systems and study the unitary circuit game in two different scenarios: with braiding gates, i.e., the intersection of Clifford gates and matchgates, and with generic matchgates. For each model, we observe qualitatively different entanglement transitions, which we characterize both numerically and analytically.