Gaussianity and Simulability of Cliffords and Matchgates
Andrew M. Projansky, Jason Necaise, James D. Whitfield

TL;DR
This paper explores the combined class of Clifford and matchgate circuits, extending their known simulability and revealing their shared Gaussian structure, thus broadening understanding of their computational properties.
Contribution
It generalizes the simulability of Clifford-matchgate hybrid circuits and introduces a Gaussian framework unifying both circuit families.
Findings
Hybrid circuits are more broadly simulable than previously known.
Pauli expectation values can be efficiently computed for these hybrids.
Both Clifford and matchgate circuits can be understood as Gaussian processes.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Algebraic and Geometric Analysis · Matrix Theory and Algorithms
