Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits to be efficiently simulatable. The approach involves analyzing the transformation of operators in the Heisenberg picture, and viewing this as a spread within a network of basis operators. The operator amplitudes are found to follow a single variable Porter-Thomas distribution for random universal quantum circuits. The number of operators with amplitude above a threshold value is shown to have a characteristic form involving an initial exponential growth, saturation, then exponential decay in the presence of decoherence. We show the number of significant operators can be used to estimate the complexity of a numerical algorithm where errors can be consistently controlled as a function of the complexity of the simulation.
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits to be efficiently simulatable. The approach involves analyzing the transformation of operators in the Heisenberg picture, and viewing this as a spread within a network of basis operators. The operator amplitudes are found to follow a single variable Porter-Thomas distribution for random universal quantum circuits. The number of operators with amplitude above a threshold value is shown to have a characteristic form involving an initial exponential growth, saturation, then exponential decay in the presence of decoherence. We show the number of significant operators can be used to estimate the complexity of a numerical algorithm where errors can be consistently controlled as a function of the complexity of the simulation.
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits (Valiant's theorem) appear as two special cases. Viewing these simulatable classes as subsets of the space of all quantum computations, we may consider minimal extensions that suffice to regain full quantum computational power, which provides an approach to exploring the efficacy of quantum over classical computation.
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.
What makes a class of quantum circuits efficiently classically simulable on average? I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. Expanding the circuits in a suitable truncated multi-path operator basis gives algorithms to evaluate the Fourier coefficients of output distributions or expectation values that are viewed as functions on the group. Under certain conditions, a truncated Fourier series can be efficiently estimated with guaranteed mean-square convergence. For classes of noisy circuits, it leads to algorithms for sampling and mean value estimation under error models with a spectral gap, where the complexity increases exponentially with the gap's inverse and polynomially with the circuit's size. This approach unifies and extends existing algorithms for noisy parametrised or random circuits using Pauli basis paths. For classes of noiseless circuits, mean values satisfying Lipschitz continuity can be on average approximated using efficient sparse Fourier decompositions. I also discuss generalisations to homogeneous spaces, qudit systems and a way to analyse random circuits via matrix coefficients of irreducible representations.
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.
Let G(A, B) denote the 2-qubit gate which acts as the 1-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 allowing 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 generalise the simulation result above to provide further classes of classically efficiently simulatable quantum circuits, which we call Gaussian quantum circuits. 1
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.