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

Theory of the Matchgate Commutant

Piotr Sierant, Xhek Turkeshi, Poetri Sonya Tarabunga

quant-phcond-mat.stat-mechmath-phSubmitted Mar 12, 2026• Announced Mar 16, 2026• 0 citations
arXivHTMLPDF

Abstract

In quantum information theory and statistical physics, symmetries of multiple copies, or replicas, of a system play a pivotal role. For unitary ensembles, these symmetries are encoded in the replicated commutant: the algebra of operators commuting with the ensemble across $k$ replicas. Determining the commutant is straightforward for the full unitary group, but remains a major obstacle for structured, computationally relevant circuit families. We solve this problem for matchgate circuits, which prepare fermionic Gaussian states on $n$ qubits. Using a Majorana fermion representation, we show that operators coupling different system copies generate the orthogonal Lie algebra $\mathfrak{so}(k)$, endowing the space of invariants with rich and tractable structure. This underlying symmetry decomposes the matchgate commutant into irreducible sectors, which we completely resolve via a Gelfand--Tsetlin construction. We provide an explicit orthonormal basis of the matchgate commutant for all $k$ and $n$, together with a formula for its dimension that grows polynomially in $n$. Furthermore, we characterize the commutant of the Clifford--matchgate subgroup, showing that restricting to signed permutations of Majorana modes yields a commutant that qualitatively diverges from the matchgate case for $k \geq 4$ replicas. Ultimately, our orthonormal basis turns algebraic classification into a working toolbox. Using it, we derive closed-form expressions for matchgate twirling channels and a fermionic analogue of Weingarten calculus, the projector encoding all moments of the Gaussian state orbit, state and unitary frame potentials, the average nonstabilizerness of fermionic Gaussian states, a systematic hierarchy of non-Gaussianity measures, and a fermionic de Finetti theorem.

Comments
25+19 pages

Related papers

The commutant of fermionic Gaussian unitaries

Paolo Braccia, N. L. Diaz, Martin Larocca +2 more

In this work, we characterize the $t$-th order commutants of fermionic Gaussian unitaries and of their particle-preserving subgroup acting on $n$ fermionic modes. These commutants govern Haar averages over the corresponding groups and therefore play a central role in fermionic randomized protocols, invariant theory, and resource quantification. Using Howe dualities, we show that the particle-preserving commutant is generated by generalized copy-hopping operators, while that for general Gaussian commutant is generated by generalized quadratic Majorana bilinears together with parity. We then derive closed formulas for the dimensions of both commutants as functions of $t$ and $n$, and develop constructive Gelfand--Tsetlin procedures to obtain explicit orthonormal bases, with detailed low-$t$ examples. Our framework also clarifies the structure of replicated fermionic states and connects naturally to measures of fermionic correlations, generalized Plücker-type constraints, and the stabilizer entropy of fermionic Gaussian states. These results provide a unified algebraic description of higher-order invariants for fermionic Gaussian dynamics.

quant-pharXiv:2603.19210•Mar 20, 2026•0 citations

Geometry of Free Fermion Commutants

Marco Lastres, Sanjay Moudgalya

Understanding the structure of operators that commute with $k$ identical replicas of unitary ensembles, also known as their $k$-commutants, is an important problem in quantum many-body physics with deep implications for the late-time behavior of physical quantities such as correlation functions and entanglement entropies under unitary evolution. In this work, we study the $k$-commutants of free-fermion unitary systems, which are heuristically known to contain $SO(k)$ and $SU(k)$ groups without and with particle number conservation respectively, with formal derivations of projectors onto these commutants appearing only very recently. We establish a complementary perspective by highlighting a larger $O(2k)$ replica symmetry (or $SU(2k)$ respectively) that the $k$-commutant transforms irreducibly under, which leads to a simple geometric understanding of the commutant in terms of coherent states parametrized by a Grassmannian manifold. We derive this structure by mapping the $k$-commutant to the ground state of effective ferromagnetic Heisenberg models, analogous to the ones that appear in the noisy circuit literature, which we solve exactly using standard representation theory methods. Further, we show that the Grassmannian manifold of the $k$-commutant is exactly the manifold of fermionic Gaussian states on $2k$ sites, which reveals a duality between real space and replica space in free-fermion systems. This geometric understanding also provides a compact projection formula onto the $k$-commutant, based on the resolution of identity for coherent states, which can prove advantageous in analytical calculations of averaged non-linear functionals of Gaussian states, as we demonstrate using some examples for the entanglement entropies. In all, this work provides a geometric perspective on the $k$-commutant of free-fermions that naturally connects to problems in quantum many-body physics.

quant-pharXiv:2604.05031•Apr 8, 2026•0 citations

Exact Operator Complexity Measures from Random Matchgate Unitaries

Gregory A. L. White, Jens Eisert, Neil Dowling

Matchgate circuits describe classically tractable dynamics in a physically relevant setting while nonetheless exhibiting features characteristic of complex quantum systems, such as high amounts of magic. This invites the broader question: to what extent are typical complexity measures saturated under trivial dynamics? Here, we address this by studying the behaviour of different Heisenberg-picture complexity measures in random matchgate ensembles. Our main technical contribution is a tractable and generalisible free-fermionic unitary Weingarten calculus formulated entirely in the Majorana basis. This method is tailored to computing moments of operators, and simplifies to a combinatorics problem which depends on the boundary conditions prescribed by a given operator functional. Using this framework, we derive closed-form expressions for the typical local-operator entanglement, operator stabiliser entropy, and higher-order out-of-time-ordered correlators. For extensive initial Majorana strings, both operator entanglement and stabiliser entropy obey volume laws, even though the underlying circuits remain classically simulable. Out-of-time-ordered correlators can likewise become exponentially small, showing that their late-time saturation value alone does not witness computational hardness and constituting a classically tractable example of emergent free independence. Finally, we relate these separations to operator resource theories, showing how operator entanglement beyond the Gaussian baseline lower-bounds the number of non-Gaussian gates in doped matchgate circuits. Our results present a practical toolbox for computing exact averages over random matchgates, while clarifying the distinction between quantum resources versus simulation complexity, and their dependence on the representation being exploited.

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

Matrix Elements of Fermionic Gaussian Operators in Arbitrary Pauli Bases: A Pfaffian Formula

M. A. Rajabpour, M. A. Seifi Mirjafarlou, Reyhaneh Khasseh

Fermionic Gaussian operators are foundational tools in quantum many-body theory, numerical simulation of fermionic dynamics, and fermionic linear optics. While their structure is fully determined by two-point correlations, evaluating their matrix elements in arbitrary local spin bases remains a nontrivial task, especially in applications involving quantum measurements, tomography, and basis-rotated simulations. In this work, we derive a fully explicit and general Pfaffian formula for the matrix elements of fermionic Gaussian operators between arbitrary Pauli product states. Our approach introduces a pair of sign-encoding matrices whose classification leads to a Lie algebra isomorphic to $\mathfrak{so}(2L)$. This algebraic structure not only guarantees consistency of the Pfaffian signs but also reveals deep connections to Clifford algebras. The resulting framework enables scalable computations across diverse fields -- from quantum tomography and entanglement dynamics to algebraic structure in fermionic circuits and matchgate computation. Beyond its practical utility, our construction sheds light on the internal symmetries of Gaussian operators and offers a new lens through which to explore their role in quantum information and computational models.

arXiv:2506.02809•Jun 3, 2025•0 citations

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

The Structure of the Majorana Clifford Group

Valérie Bettaque, Brian G. Swingle

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field $\F$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

arXiv:2407.11319•Jul 16, 2024•0 citations
In quantum information theory and statistical physics, symmetries of multiple copies, or replicas, of a system play a pivotal role. For unitary ensembles, these symmetries are encoded in the replicated commutant: the algebra of operators commuting with the ensemble across kkk replicas. Determining the commutant is straightforward for the full unitary group, but remains a major obstacle for structured, computationally relevant circuit families. We solve this problem for matchgate circuits, which prepare fermionic Gaussian states on nnn qubits. Using a Majorana fermion representation, we show that operators coupling different system copies generate the orthogonal Lie algebra so(k)\mathfrak{so}(k)so(k), endowing the space of invariants with rich and tractable structure. This underlying symmetry decomposes the matchgate commutant into irreducible sectors, which we completely resolve via a Gelfand--Tsetlin construction. We provide an explicit orthonormal basis of the matchgate commutant for all kkk and nnn, together with a formula for its dimension that grows polynomially in nnn. Furthermore, we characterize the commutant of the Clifford--matchgate subgroup, showing that restricting to signed permutations of Majorana modes yields a commutant that qualitatively diverges from the matchgate case for k≥4k \geq 4k≥4 replicas. Ultimately, our orthonormal basis turns algebraic classification into a working toolbox. Using it, we derive closed-form expressions for matchgate twirling channels and a fermionic analogue of Weingarten calculus, the projector encoding all moments of the Gaussian state orbit, state and unitary frame potentials, the average nonstabilizerness of fermionic Gaussian states, a systematic hierarchy of non-Gaussianity measures, and a fermionic de Finetti theorem.
In this work, we characterize the ttt-th order commutants of fermionic Gaussian unitaries and of their particle-preserving subgroup acting on nnn fermionic modes. These commutants govern Haar averages over the corresponding groups and therefore play a central role in fermionic randomized protocols, invariant theory, and resource quantification. Using Howe dualities, we show that the particle-preserving commutant is generated by generalized copy-hopping operators, while that for general Gaussian commutant is generated by generalized quadratic Majorana bilinears together with parity. We then derive closed formulas for the dimensions of both commutants as functions of ttt and nnn, and develop constructive Gelfand--Tsetlin procedures to obtain explicit orthonormal bases, with detailed low-ttt examples. Our framework also clarifies the structure of replicated fermionic states and connects naturally to measures of fermionic correlations, generalized Plücker-type constraints, and the stabilizer entropy of fermionic Gaussian states. These results provide a unified algebraic description of higher-order invariants for fermionic Gaussian dynamics.
Understanding the structure of operators that commute with kkk identical replicas of unitary ensembles, also known as their kkk-commutants, is an important problem in quantum many-body physics with deep implications for the late-time behavior of physical quantities such as correlation functions and entanglement entropies under unitary evolution. In this work, we study the kkk-commutants of free-fermion unitary systems, which are heuristically known to contain SO(k)SO(k)SO(k) and SU(k)SU(k)SU(k) groups without and with particle number conservation respectively, with formal derivations of projectors onto these commutants appearing only very recently. We establish a complementary perspective by highlighting a larger O(2k)O(2k)O(2k) replica symmetry (or SU(2k)SU(2k)SU(2k) respectively) that the kkk-commutant transforms irreducibly under, which leads to a simple geometric understanding of the commutant in terms of coherent states parametrized by a Grassmannian manifold. We derive this structure by mapping the kkk-commutant to the ground state of effective ferromagnetic Heisenberg models, analogous to the ones that appear in the noisy circuit literature, which we solve exactly using standard representation theory methods. Further, we show that the Grassmannian manifold of the kkk-commutant is exactly the manifold of fermionic Gaussian states on 2k2k2k sites, which reveals a duality between real space and replica space in free-fermion systems. This geometric understanding also provides a compact projection formula onto the kkk-commutant, based on the resolution of identity for coherent states, which can prove advantageous in analytical calculations of averaged non-linear functionals of Gaussian states, as we demonstrate using some examples for the entanglement entropies. In all, this work provides a geometric perspective on the kkk-commutant of free-fermions that naturally connects to problems in quantum many-body physics.
Matchgate circuits describe classically tractable dynamics in a physically relevant setting while nonetheless exhibiting features characteristic of complex quantum systems, such as high amounts of magic. This invites the broader question: to what extent are typical complexity measures saturated under trivial dynamics? Here, we address this by studying the behaviour of different Heisenberg-picture complexity measures in random matchgate ensembles. Our main technical contribution is a tractable and generalisible free-fermionic unitary Weingarten calculus formulated entirely in the Majorana basis. This method is tailored to computing moments of operators, and simplifies to a combinatorics problem which depends on the boundary conditions prescribed by a given operator functional. Using this framework, we derive closed-form expressions for the typical local-operator entanglement, operator stabiliser entropy, and higher-order out-of-time-ordered correlators. For extensive initial Majorana strings, both operator entanglement and stabiliser entropy obey volume laws, even though the underlying circuits remain classically simulable. Out-of-time-ordered correlators can likewise become exponentially small, showing that their late-time saturation value alone does not witness computational hardness and constituting a classically tractable example of emergent free independence. Finally, we relate these separations to operator resource theories, showing how operator entanglement beyond the Gaussian baseline lower-bounds the number of non-Gaussian gates in doped matchgate circuits. Our results present a practical toolbox for computing exact averages over random matchgates, while clarifying the distinction between quantum resources versus simulation complexity, and their dependence on the representation being exploited.
Fermionic Gaussian operators are foundational tools in quantum many-body theory, numerical simulation of fermionic dynamics, and fermionic linear optics. While their structure is fully determined by two-point correlations, evaluating their matrix elements in arbitrary local spin bases remains a nontrivial task, especially in applications involving quantum measurements, tomography, and basis-rotated simulations. In this work, we derive a fully explicit and general Pfaffian formula for the matrix elements of fermionic Gaussian operators between arbitrary Pauli product states. Our approach introduces a pair of sign-encoding matrices whose classification leads to a Lie algebra isomorphic to so(2L)\mathfrak{so}(2L)so(2L). This algebraic structure not only guarantees consistency of the Pfaffian signs but also reveals deep connections to Clifford algebras. The resulting framework enables scalable computations across diverse fields -- from quantum tomography and entanglement dynamics to algebraic structure in fermionic circuits and matchgate computation. Beyond its practical utility, our construction sheds light on the internal symmetries of Gaussian operators and offers a new lens through which to explore their role in quantum information and computational models.
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.
In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this paper, we study their analogues for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field $\F$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.