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:2505.06336 · Physical review. B./Physical review. B

Two-dimensional quon language: Unifying framework for Cliffords, matchgates, and beyond

Byungmin Kang, Chen Zhao, Zhengwei Liu, Xun Gao, Soonwon Choi

Published Apr 30, 2026• 9 citations
arXivHTMLPDF

Abstract

Simulating generic quantum states and dynamics is practically intractable using classical computers. However, certain special classes -- namely Clifford and matchgate circuits -- permit efficient computation. They provide invaluable tools for studying many-body physics, quantum chemistry, and quantum computation. While both play foundational roles across multiple disciplines, the origins of their tractability seem disparate, and their relationship remain unclear. A deeper understanding of such tractable classes could expand their scope and enable a wide range of new applications. In this work, we make progress toward the unified understanding of the Clifford and matchgate -- these two classes are, in fact, distinct special cases of a single underlying structure. Specifically, we introduce the 2D Quon language, which combines Majorana worldlines with their underlying spacetime topology to diagrammatically represent quantum processes and tensor networks. In full generality, the 2D Quon language is universal -- capable of representing arbitrary quantum states, dynamics, or tensor networks -- yet they become especially powerful in describing Clifford and matchgate classes. Each class can be efficiently characterized in a visually recognizable manner using the Quon framework. This capability naturally gives rise to several families of efficiently computable tensor networks introduced in this work: punctured matchgates, hybrid Clifford-matchgate-MPS, and ansatze generated from factories of tractable networks. All of these exhibit high non-Cliffordness, high non-matchgateness, and large bipartite entanglement entropy. We discuss a range of applications of our approach, from recovering well-known results such as the Kramers-Wannier duality and the star-triangle relation of the Ising model, to enabling variational optimization with novel ansatz states.

DOI
10.1103/5rt1-96pm

Related papers

Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement

Zixuan Feng, Zhengwei Liu, Lu, Fan +1 more

We propose a new framework of topological complexity to study the computational complexity of quantum circuits and tensor networks. Within this framework, we establish the Quon Classical Simulation (QCS) for hybrid Clifford-Matchgate circuits, which is efficient for both Clifford circuits and Matchgate circuits, therefore answering a long standing open question on unifying efficient classical simulations. This framework is built upon the Quon language, a 2+1D topological quantum field theory with space-time boundary and defects. Its exponential computation complexity is captured by Magic holes, a topological feature capturing the global long-range entanglement. Both Clifford circuits and Matchgate circuits are free of Magic holes. Efficient classical simulations of Cliffords and Matchgates are implemented by two parallel operations, generalized surgery theory of 3-manifolds and Yang-Baxter relations on the 2D boundary respectively, with additional binary arithmetic properties.

arXiv:2505.07804•May 12, 2025•10 citations

Augmenting Density Matrix Renormalization Group with Matchgates and Clifford Circuits

Jiale Huang, Xiangjian Qian, Zhendong Li +1 more

Abstract Matchgates and Clifford circuits are two types of quantum circuits which can be efficiently simulated classically, though the underlying reasons are quite different. Matchgates are essentially the single particle basis transformations in the Majorana fermion representation, which can be easily handled classically, while the Clifford circuits can be efficiently simulated using the tableau method according to the Gottesman–Knill theorem. In this work, we propose a new wave-function ansatz in which matrix product states (MPS) are augmented with the combination of Matchgates and Clifford circuits (dubbed MCA-MPS) to take advantage of the representing power of all of them. Moreover, the optimization of MCA-MPS can be efficiently implemented within the density matrix renormalization group method. Our benchmark results on one-dimensional hydrogen chain show that MCA-MPS can improve the accuracy of the ground-state calculation by several orders of magnitude over MPS with the same bond dimension. This new method provides us a useful approach to study quantum many-body systems. The MCA-MPS ansatz also expands our understanding of classically simulatable quantum many-body states.

arXiv:2505.08635•Chinese Physics Letters•Mar 3, 2026•11 citations

Theory of the Matchgate Commutant

Piotr Sierant, Xhek Turkeshi, Poetri Sonya Tarabunga

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.

quant-pharXiv:2603.12392•Mar 16, 2026•34 citations

Matchgates and classical simulation of quantum circuits

Richard Jozsa, Akimasa Miyake

Let G ( A , B ) denote the two-qubit gate that acts as the one-qubit SU (2) gates A and B in the even and odd parity subspaces, respectively, of two qubits. Using a Clifford algebra formalism, we show that arbitrary uniform families of circuits of these gates, restricted to act only on nearest neighbour (n.n.) qubit lines, can be classically efficiently simulated. This reproduces a result originally proved by Valiant using his matchgate formalism, and subsequently related by others to free fermionic physics. We further show that if the n.n. condition is slightly relaxed, to allow the same gates to act only on n.n. and next n.n. qubit lines, then the resulting circuits can efficiently perform universal quantum computation. From this point of view, the gap between efficient classical and quantum computational power is bridged by a very modest use of a seemingly innocuous resource (qubit swapping). We also extend the simulation result above in various ways. In particular, by exploiting properties of Clifford operations in conjunction with the Jordan–Wigner representation of a Clifford algebra, we show how one may generalize the simulation result above to provide further classes of classically efficiently simulatable quantum circuits, which we call Gaussian quantum circuits.

arXiv:0804.4050•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jul 22, 2008•260 citations

Gaussianity and simulability of Cliffords and matchgates

Andrew M. Projansky, Jason Necaise, James Daniel Whitfield

Abstract Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman–Knill explains the simulability Cliffords, and the efficient simulability of matchgates is understood via Pfaffians of antisymmetric matrices. We take the perspective that by studying Clifford-matchgate hybrid circuits, we expand the set of known simulable circuits and reach a better understanding of what unifies these two circuit families. While the simulability of Clifford conjugated matchgate circuits for single qubit outputs has been briefly considered, the simulability of Clifford and matchgate hybrid circuits has not been generalized up to this point. In this paper we extend that work, studying simulability of marginals as well as Pauli expectation values of Clifford and matchgate hybrid circuits. We describe a hierarchy of Clifford circuits, and find that as we consider more general Cliffords, we lose some amount of simulability of bitstring outputs. We then show that the known simulability of Pauli expectation values of Clifford circuits acting on product states can be generalized to Clifford circuits acting after any matchgate circuit. We conclude with general discussion about the relationship between Cliffords and matchgates, and show that both circuit families can be understood as being Gaussian.

arXiv:2410.10068•Journal of Physics A Mathematical and Theoretical•Apr 15, 2025•11 citations

Limits of Clifford Disentangling in Tensor Network States

Sergi Masot-Llima, Piotr Sierant, Paolo Stornati +1 more

Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic and are thus also classically tractable. Clifford tensor networks combine the benefits of both approaches, exploiting Clifford circuits to reduce the classical complexity of the tensor network description of states, with promising effects on simulation approaches. We study the disentangling power of Clifford transformations acting on tensor networks, with a particular emphasis on entanglement cooling strategies. We identify regimes where exact or heuristic Clifford disentanglers are effective, explain the link between the two approaches, and characterize their breakdown as non-Clifford resources accumulate. Additionally, we prove that, beyond stabilizer settings, no Clifford operation can universally disentangle even a single qubit from an arbitrary non-Clifford rotation. Our results clarify both the capabilities and fundamental limitations of Clifford-based simulation methods.

quant-pharXiv:2602.15942•Physical review. B./Physical review. B•Feb 19, 2026•4 citations
Simulating generic quantum states and dynamics is practically intractable using classical computers. However, certain special classes -- namely Clifford and matchgate circuits -- permit efficient computation. They provide invaluable tools for studying many-body physics, quantum chemistry, and quantum computation. While both play foundational roles across multiple disciplines, the origins of their tractability seem disparate, and their relationship remain unclear. A deeper understanding of such tractable classes could expand their scope and enable a wide range of new applications. In this work, we make progress toward the unified understanding of the Clifford and matchgate -- these two classes are, in fact, distinct special cases of a single underlying structure. Specifically, we introduce the 2D Quon language, which combines Majorana worldlines with their underlying spacetime topology to diagrammatically represent quantum processes and tensor networks. In full generality, the 2D Quon language is universal -- capable of representing arbitrary quantum states, dynamics, or tensor networks -- yet they become especially powerful in describing Clifford and matchgate classes. Each class can be efficiently characterized in a visually recognizable manner using the Quon framework. This capability naturally gives rise to several families of efficiently computable tensor networks introduced in this work: punctured matchgates, hybrid Clifford-matchgate-MPS, and ansatze generated from factories of tractable networks. All of these exhibit high non-Cliffordness, high non-matchgateness, and large bipartite entanglement entropy. We discuss a range of applications of our approach, from recovering well-known results such as the Kramers-Wannier duality and the star-triangle relation of the Ising model, to enabling variational optimization with novel ansatz states.
We propose a new framework of topological complexity to study the computational complexity of quantum circuits and tensor networks. Within this framework, we establish the Quon Classical Simulation (QCS) for hybrid Clifford-Matchgate circuits, which is efficient for both Clifford circuits and Matchgate circuits, therefore answering a long standing open question on unifying efficient classical simulations. This framework is built upon the Quon language, a 2+1D topological quantum field theory with space-time boundary and defects. Its exponential computation complexity is captured by Magic holes, a topological feature capturing the global long-range entanglement. Both Clifford circuits and Matchgate circuits are free of Magic holes. Efficient classical simulations of Cliffords and Matchgates are implemented by two parallel operations, generalized surgery theory of 3-manifolds and Yang-Baxter relations on the 2D boundary respectively, with additional binary arithmetic properties.
Abstract Matchgates and Clifford circuits are two types of quantum circuits which can be efficiently simulated classically, though the underlying reasons are quite different. Matchgates are essentially the single particle basis transformations in the Majorana fermion representation, which can be easily handled classically, while the Clifford circuits can be efficiently simulated using the tableau method according to the Gottesman–Knill theorem. In this work, we propose a new wave-function ansatz in which matrix product states (MPS) are augmented with the combination of Matchgates and Clifford circuits (dubbed MCA-MPS) to take advantage of the representing power of all of them. Moreover, the optimization of MCA-MPS can be efficiently implemented within the density matrix renormalization group method. Our benchmark results on one-dimensional hydrogen chain show that MCA-MPS can improve the accuracy of the ground-state calculation by several orders of magnitude over MPS with the same bond dimension. This new method provides us a useful approach to study quantum many-body systems. The MCA-MPS ansatz also expands our understanding of classically simulatable quantum many-body states.
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.
Let G ( A , B ) denote the two-qubit gate that acts as the one-qubit SU (2) gates A and B in the even and odd parity subspaces, respectively, of two qubits. Using a Clifford algebra formalism, we show that arbitrary uniform families of circuits of these gates, restricted to act only on nearest neighbour (n.n.) qubit lines, can be classically efficiently simulated. This reproduces a result originally proved by Valiant using his matchgate formalism, and subsequently related by others to free fermionic physics. We further show that if the n.n. condition is slightly relaxed, to allow the same gates to act only on n.n. and next n.n. qubit lines, then the resulting circuits can efficiently perform universal quantum computation. From this point of view, the gap between efficient classical and quantum computational power is bridged by a very modest use of a seemingly innocuous resource (qubit swapping). We also extend the simulation result above in various ways. In particular, by exploiting properties of Clifford operations in conjunction with the Jordan–Wigner representation of a Clifford algebra, we show how one may generalize the simulation result above to provide further classes of classically efficiently simulatable quantum circuits, which we call Gaussian quantum circuits.
Abstract Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman–Knill explains the simulability Cliffords, and the efficient simulability of matchgates is understood via Pfaffians of antisymmetric matrices. We take the perspective that by studying Clifford-matchgate hybrid circuits, we expand the set of known simulable circuits and reach a better understanding of what unifies these two circuit families. While the simulability of Clifford conjugated matchgate circuits for single qubit outputs has been briefly considered, the simulability of Clifford and matchgate hybrid circuits has not been generalized up to this point. In this paper we extend that work, studying simulability of marginals as well as Pauli expectation values of Clifford and matchgate hybrid circuits. We describe a hierarchy of Clifford circuits, and find that as we consider more general Cliffords, we lose some amount of simulability of bitstring outputs. We then show that the known simulability of Pauli expectation values of Clifford circuits acting on product states can be generalized to Clifford circuits acting after any matchgate circuit. We conclude with general discussion about the relationship between Cliffords and matchgates, and show that both circuit families can be understood as being Gaussian.
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic and are thus also classically tractable. Clifford tensor networks combine the benefits of both approaches, exploiting Clifford circuits to reduce the classical complexity of the tensor network description of states, with promising effects on simulation approaches. We study the disentangling power of Clifford transformations acting on tensor networks, with a particular emphasis on entanglement cooling strategies. We identify regimes where exact or heuristic Clifford disentanglers are effective, explain the link between the two approaches, and characterize their breakdown as non-Clifford resources accumulate. Additionally, we prove that, beyond stabilizer settings, no Clifford operation can universally disentangle even a single qubit from an arbitrary non-Clifford rotation. Our results clarify both the capabilities and fundamental limitations of Clifford-based simulation methods.