arXiv:2610.02287
Premonoidal Semantics and Scalable Diagrammatics of Fermionic Quantum Computing
Thomas Perez, Titouan Carette
Abstract
Local fermionic mode (LFM) based quantum computation has pure state spaces that are isomorphic, via the Jordan-Wigner representation, to qubit state spaces, but its compositional structure is subtly different. Indeed, the algebraic formalism specifying how to embed fermionic systems underlies a notion of parallel composition, for which, in general, the usual interchange law of monoidal categories fails. We give a categorical account of this phenomenon. Starting from the CAR-algebraic semantics of fermionic gate application, we show that LFM processes form a symmetric premonoidal category whose centre is precisely the even, parity-preserving subcategory. The same processes can alternatively be organized with the ordinary tensor product and a fermionic presymmetry that is natural exactly on even maps. To reason diagrammatically in this latter presentation, we introduce pronaps, a relaxation of the notion of prop, in which permutations are not-necessarily-natural, and use them to organize a hierarchy of fragments of the fermionic ZW calculus relevant to the study of fermionic circuits on physically motivated gate-sets. We then extend scalable diagrammatic notation to pronaps. In this setting, syntactic sugars inspired by SZX and GSA are defined, with the specificity that matrix arrows encode minors and determinants, while graph triangles encode pfaffians of principal submatrices. These constructions yield elegant normal forms and completeness proofs for our presentations of the EoW, FoW, EW, and FW fragments. In particular, the FW presentation gives a new normal form for the matchgate fragment, distinct from the rWGS-X normal form of the planar-W (pW) presentation of the same category. The resulting framework connects fermionic circuit semantics, diagrammatic rewriting with scalable notations, and the algebra of determinants and pfaffians.
AI Summary
The paper studies how fermionic gate application composes, and how to build complete graphical calculi for fermionic circuit fragments. Although Jordan–Wigner identifies occupation-state spaces with qubit spaces, CAR-algebra embeddings make odd operations on disjoint modes anticommute rather than satisfy ordinary monoidal interchange. It formulates this semantics as a symmetric premonoidal category whose centre is exactly the even, parity-preserving subcategory, and extends it to homogeneous maps between registers of different sizes. Alternatively, ordinary tensor composition is monoidal, but the fermionic swap is natural exactly for even maps. These statements follow from CAR embeddings, graded interchange, and explicit Jordan–Wigner formulas. For the latter presentation, the paper introduces “pronaps”: prop-like structures with permutations not required to be natural. It extends scalable diagrammatic notation to these structures and gives normal forms and completeness proofs for four fermionic ZW fragments: EoW, FoW, EW, and FW. Matrix-arrow diagrams encode matrix minors, while antisymmetric-matrix graph triangles encode principal Pfaffians. Rewriting identities support reductions to canonical forms using reduced column-echelon matrices and, where needed, antisymmetric matrices. FW describes the previously axiomatized matchgate category but receives a different normal form. The scope is pure, homogeneous linear processes, including preparations and postselection, rather than general mixed dynamics. The nonmonoidal obstruction requires odd operations; standard even Bravyi–Kitaev circuits remain monoidal. Odd mode flips are not identified as native operations on current platforms and require additional physical resources under parity or particle-number conservation. Compilation, optimization, and simulation applications are left for further investigation.
Error found: The inverse equations in the formal definition of a scaled pronap theory equate composites of dividers and gatherers to identities on the wrong objects. The formal equation set for scaled pronap theories omits the previously displayed coherence equations, without which the claimed equivalence and completeness transfer are not justified.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.