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.
Matchgate circuits realize free-fermion dynamics: they are efficiently classically simulable, yet cannot on their own generate the generic randomness required for universal computation or unitary design formation. We study a controlled route beyond this integrable limit by doping matchgate circuits with non-Gaussian gates-physically, the injection of fermionic interactions into an otherwise free system. Using the matchgate commutant framework, we obtain analytic control over unitary
2-design formation. For globally scrambled dynamics, the design problem maps exactly onto a classical birth-death Markov chain with an Ornstein-Uhlenbeck continuum limit, recasting the emergence of quantum randomness in terms of spectral gaps and mixing times and yielding rigorous bounds on the number of non-Gaussian gates needed for approximate
2-designs. These bounds hold for a broad class of parity-preserving non-Gaussian gates, independently of microscopic details, with numerics indicating that the same mechanism governs higher-order designs. Used as local building blocks in a glued-circuit architecture, they yield approximate parity-preserving
2-designs in polylogarithmic depth with a sparse non-Gaussian gate count, with implications for Page-like entanglement growth and fermionic classical-shadow protocols. Finally, locality reshapes this picture: in local brickwork dynamics, design formation is diffusion-limited and far slower. Our results establish doped matchgate circuits as a controlled, analytically tractable route from free fermions to interaction-generated quantum designs.
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
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≥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.
The local-operator entanglement (LOE) measures the classical simulability of a Heisenberg operator and is conjectured to witness many-body chaos in locally interacting systems. Using tools from free probability, we analytically compute its asymptotic value for Haar random dynamics for all Rényi indices. We find that to the first two orders in large dimension, for traceless operators it exactly reproduces the Page curve for random states. In contrast to higher-order out-of-time-ordered correlators (OTOCs), which depend on more complex operator correlations via free cumulants, the leading-order LOE is independent of the initial operator. \add{We detail exactly how these higher-order correlations are encoded in the coefficients of the finite-size corrections. Therefore, guided by our Haar result, we argue that the long-time value of the LOE entropies in chaotic systems is robust: they depend only on a simple sub-sector of the hierarchy of correlations encoded by the full Eigenstate Thermalization Hypothesis. Our results therefore provide a conceptual boundary between operator simulability and higher-order scrambling diagnostics.
Free fermionic Gaussian, also known as matchgate, random circuits exhibit atypical behavior compared to generic interacting systems. They produce anomalously slow entanglement growth, characterized by diffusive scaling S(t)∼sqrt[t], and evolve into volume-law entangled states at late times, S∼N, which are highly unstable under measurements. Here, we investigate how doping such circuits with non-Gaussian resources (gates) restores entanglement structures of typical dynamics. We demonstrate that ballistic entanglement growth S(t)∼t is recovered after injecting an extensive total amount of non-Gaussian gates, which also restores Kardar-Parisi-Zhang fluctuations. When the evolution is perturbed with measurements, we uncover a measurement-induced phase transition between an area-law and a power-law entangled phase, S∼N^{α}, with α controlled by the doping. A genuine volume-law entangled phase is recovered only when non-Gaussian gates are injected at an extensive rate. Our findings bridge the dynamics of free and interacting fermionic systems, identifying non-Gaussianity as a key resource driving the emergence of nonintegrable behavior.
We study the von Neumann operator-space entanglement entropy (OSEE) of initial product operators evolved under random gaussian dynamics, as modeled by a Brownian SYK
2 model. By exploiting a mapping to a domain-wall melting problem, we derive an exact expression for the time-dependent bipartite OSEE in the thermodynamic limit, and obtain an analytic characterization of the corresponding gaussian Page curve emerging at late times. Our results build on recent work on the entanglement dynamics in the all-to-all quantum simple exclusion process, leveraging tools from RMT, including the Coulomb-gas approach and a mapping to the free Jacobi process. Finally, based on our results, we discuss the possibility of relating the OSEE with non-gaussianity measures in the Heisenberg picture.
Claims of quantum advantage rest on the classical hardness of simulating quantum circuits. Magic, operator scrambling, anticoncentration, and non-Gaussianity for fermionic circuits are standard diagnostics of complex quantum dynamics. For pure states, some of these have been rigorously connected to classical simulability. Whether these diagnostics reliably track the limits of efficient classical simulation under noise remains unclear. Here, we show that in noisy Clifford+
T and nearest-neighbour matchgate+SWAP circuits, dynamical diagnostics and classical simulability can separate in both directions. In particular, the diagnostics can remain nontrivial after classical simulation becomes efficient, or become trivial before known efficient classical algorithms apply. We trace this mismatch to the different statistical properties they probe: magic and scrambling depend on fourth-order statistics of the Pauli spectrum, whereas the simulation algorithms depend primarily on second-order moments, which local noise suppresses at different rates. Thus, dynamical diagnostics measured on a noisy quantum device do not by themselves constitute evidence for classical hardness.