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

Unitary Designs from Doped Matchgate Circuits

Fabian Ballar Trigueros, Zheng-Hang Sun, Xhek Turkeshi, Piotr Sierant, Poetri Sonya Tarabunga

quant-phSubmitted Jun 22, 2026• Announced Jun 24, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
38 pages, 8 figures

Related papers

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

Emergence of Generic Entanglement Structure in Doped Matchgate Circuits

Alessio Paviglianiti, Luca Lumia, Emanuele Tirrito +4 more

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.

arXiv:2507.12526•Physical Review Letters•Dec 4, 2025•2 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

Strong matchgate designs in nearly optimal depth

Maxwell West, M. Cerezo, Martin Larocca

Understanding the resources required to generate approximately random unitaries over various groups is a natural goal of quantum information theory. With respect to one notion of approximation, that of a design, it is known that the full unitary group can be approximated in logarithmic depth by one-dimensional circuits of nearest-neighbour 2-local gates. On the other hand, remarkably, circuits with this connectivity cannot form designs over the matchgate group in sublinear depth. Here we show that this dramatic slowdown can disappear when using a general qubit connectivity graph $\mathsf{G}$ of routing number ${\rm rt}(\mathsf{G})$. Indeed, in this setting one can obtain (strong) $\varepsilon$-approximate relative error matchgate $k$-designs in depth $\mathcal{O}(k^2{\rm rt}(\mathsf{G})\log n\log(n/\varepsilon))$. For all-to-all connectivity, ${\rm rt}(\mathsf{G})=2$. Our construction is conceptually simple, involving a random walk on the matchgate group, and no ancillae. As a technical byproduct, we improve upon the state of the art for fermionic routing, obtaining an $\mathcal{O}({\rm rt}(\mathsf{G})\log n)$ depth router. Additionally, for $k=3$, we obtain an exact strong matchgate design in $\mathcal{O}({\rm rt}(\mathsf{G})\log n)$ depth, again without ancillae. Under all-to-all connectivity, our fermionic router and 3-designs are optimal. Notably, our results imply that quantum algorithms for fermionic tomography which require drawing from a matchgate 3-design may be exponentially sped up on quantum computers with all-to-all connectivity, relative to their strictly one-dimensional counterparts.

quant-pharXiv:2609.26677•Sep 23, 2026•0 citations

Matchgate synthesis via Clifford matchgates and TTT gates

Berta Casas, Paolo Braccia, Élie Gouzien +2 more

Matchgate unitaries are ubiquitous in quantum computation due to their relation to non-interacting fermions and because they can be used to benchmark quantum computers. Implementing such unitaries on fault-tolerant devices requires first compiling them into a discrete universal gate set, typically Clifford$+T$. Here, we propose a different approach for their synthesis: compile matchgate unitaries using only matchgate gates. To this end, we first show that the matchgate-Clifford group (the intersection of the matchgate and Clifford groups) plus the $\overline{T}$ gate (a $T$ unitary up to a phase) is universal for the matchgate group. Our approach leverages the connection between $n$-qubit matchgate circuits and the standard representation of $\mathbb{SO}(2n)$, which reduces the compilation from $2^n\times 2^n$ unitaries to $2n\times2n$ ones, thus reducing exponentially the size of the target matrix. Moreover, we rigorously show that this scheme is efficient, as an approximation error $\varepsilon_{\mathbb{SO}(2n)}$ incurred in this smaller-dimensional representation translates at most into an $O(n \,\varepsilon_{\mathbb{SO}(2n)})$ error in the exponentially large unitary. In addition, we study the exact version of the matchgate synthesis problem, and we prove that all matchgate unitaries $U$ such that $U\otimes U^*$ has entries in the ring $\mathbb{Z}\big[1/\sqrt 2,i\big]$ can be exactly synthesized by a finite sequence of gates from the matchgate-Clifford$+\overline{T}$ set, without ancillas. We then use this insight to map optimal exact matchgate synthesis to Boolean satisfiability, and compile the circuits that diagonalize the free-fermionic $XX$ Hamiltonian on $n=4,\,8$ qubits.

quant-pharXiv:2602.05425•Feb 6, 2026•0 citations

More global randomness from less-random local gates

Anonymous, Hosho Katsura, Yosuke Mitsuhashi +3 more

Random circuits giving rise to unitary designs are key tools in quantum information science and many-body physics. In this work, we investigate a class of random quantum circuits with a specific gate structure. Within this framework, we prove that one-dimensional structured random circuits with non-Haar-random local gates can exhibit substantially more global randomness compared to Haar-random circuits with the same underlying circuit architecture. In particular, under a solvability condition, we exactly diagonalize the second-moment operators for these structured random circuits by establishing a link to free-fermionic models, and we show that their spectral gaps can exceed those of Haar-random circuits. While solvable structured random circuits exhibit free-fermionic behavior, the underlying fixed gate need not be a matchgate. Our findings have applications in improving circuit depth bounds for randomized benchmarking, in generating approximate unitary 2-designs from shallow random circuits, and in enabling exact analyses of quantum many-body dynamics.

arXiv:2410.24127•Physical Review A•Jun 30, 2026•0 citations
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 222-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 222-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 222-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.
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.
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.
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.
Understanding the resources required to generate approximately random unitaries over various groups is a natural goal of quantum information theory. With respect to one notion of approximation, that of a design, it is known that the full unitary group can be approximated in logarithmic depth by one-dimensional circuits of nearest-neighbour 2-local gates. On the other hand, remarkably, circuits with this connectivity cannot form designs over the matchgate group in sublinear depth. Here we show that this dramatic slowdown can disappear when using a general qubit connectivity graph G\mathsf{G}G of routing number rt(G){\rm rt}(\mathsf{G})rt(G). Indeed, in this setting one can obtain (strong) ε\varepsilonε-approximate relative error matchgate kkk-designs in depth O(k2rt(G)log⁡nlog⁡(n/ε))\mathcal{O}(k^2{\rm rt}(\mathsf{G})\log n\log(n/\varepsilon))O(k2rt(G)lognlog(n/ε)). For all-to-all connectivity, rt(G)=2{\rm rt}(\mathsf{G})=2rt(G)=2. Our construction is conceptually simple, involving a random walk on the matchgate group, and no ancillae. As a technical byproduct, we improve upon the state of the art for fermionic routing, obtaining an O(rt(G)log⁡n)\mathcal{O}({\rm rt}(\mathsf{G})\log n)O(rt(G)logn) depth router. Additionally, for k=3k=3k=3, we obtain an exact strong matchgate design in O(rt(G)log⁡n)\mathcal{O}({\rm rt}(\mathsf{G})\log n)O(rt(G)logn) depth, again without ancillae. Under all-to-all connectivity, our fermionic router and 3-designs are optimal. Notably, our results imply that quantum algorithms for fermionic tomography which require drawing from a matchgate 3-design may be exponentially sped up on quantum computers with all-to-all connectivity, relative to their strictly one-dimensional counterparts.
Matchgate unitaries are ubiquitous in quantum computation due to their relation to non-interacting fermions and because they can be used to benchmark quantum computers. Implementing such unitaries on fault-tolerant devices requires first compiling them into a discrete universal gate set, typically Clifford+T+T+T. Here, we propose a different approach for their synthesis: compile matchgate unitaries using only matchgate gates. To this end, we first show that the matchgate-Clifford group (the intersection of the matchgate and Clifford groups) plus the T‾\overline{T}T gate (a TTT unitary up to a phase) is universal for the matchgate group. Our approach leverages the connection between nnn-qubit matchgate circuits and the standard representation of SO(2n)\mathbb{SO}(2n)SO(2n), which reduces the compilation from 2n×2n2^n\times 2^n2n×2n unitaries to 2n×2n2n\times2n2n×2n ones, thus reducing exponentially the size of the target matrix. Moreover, we rigorously show that this scheme is efficient, as an approximation error εSO(2n)\varepsilon_{\mathbb{SO}(2n)}εSO(2n)​ incurred in this smaller-dimensional representation translates at most into an O(n εSO(2n))O(n \,\varepsilon_{\mathbb{SO}(2n)})O(nεSO(2n)​) error in the exponentially large unitary. In addition, we study the exact version of the matchgate synthesis problem, and we prove that all matchgate unitaries UUU such that U⊗U∗U\otimes U^*U⊗U∗ has entries in the ring Z[1/2,i]\mathbb{Z}\big[1/\sqrt 2,i\big]Z[1/2​,i] can be exactly synthesized by a finite sequence of gates from the matchgate-Clifford+T‾+\overline{T}+T set, without ancillas. We then use this insight to map optimal exact matchgate synthesis to Boolean satisfiability, and compile the circuits that diagonalize the free-fermionic XXXXXX Hamiltonian on n=4, 8n=4,\,8n=4,8 qubits.
Random circuits giving rise to unitary designs are key tools in quantum information science and many-body physics. In this work, we investigate a class of random quantum circuits with a specific gate structure. Within this framework, we prove that one-dimensional structured random circuits with non-Haar-random local gates can exhibit substantially more global randomness compared to Haar-random circuits with the same underlying circuit architecture. In particular, under a solvability condition, we exactly diagonalize the second-moment operators for these structured random circuits by establishing a link to free-fermionic models, and we show that their spectral gaps can exceed those of Haar-random circuits. While solvable structured random circuits exhibit free-fermionic behavior, the underlying fixed gate need not be a matchgate. Our findings have applications in improving circuit depth bounds for randomized benchmarking, in generating approximate unitary 2-designs from shallow random circuits, and in enabling exact analyses of quantum many-body dynamics.