Premonoidal Categories Yield New Normal Forms for Fermionic Matchgate Circuits
The preprint establishes a premonoidal categorical semantics for fermionic computation and extends diagrammatic methods via pronaps. It produces new normal forms and completeness results for matchgate fragments using pfaffian encodings. The approach improves visualisation and scalability for fermionic circuit design.
The paper starts from CAR-algebra semantics and shows local fermionic modes form a symmetric premonoidal category whose centre is the even parity-preserving subcategory. It then re-organises the same processes using ordinary tensor product plus a fermionic presymmetry that is natural only on even maps. This allows introduction of pronaps, a relaxed prop where permutations need not be natural, to support scalable diagrammatic rewriting.
The resulting hierarchy covers EoW, FoW, EW and FW fragments. The FW presentation supplies a new normal form for matchgates based on pfaffians of principal submatrices, distinct from the rWGS-X form of the planar-W calculus. Matrix arrows now encode minors and determinants while graph triangles track pfaffians, giving elegant completeness proofs.
Related work on Jordan-Wigner mappings and the original ZW calculus for qubits shows the fermionic interchange failure is the key structural difference. The framework directly targets physically motivated gate sets used in superconducting and trapped-ion fermionic simulations.
Next steps include embedding these diagrams into existing quantum circuit toolkits and testing completeness on hardware with 20-40 modes within three years.
Perez: By 2028, at least one quantum simulator framework will adopt pronap-based rewriting for fermionic matchgates on systems exceeding 30 modes.
Sources (2)
- [1]Primary Source(https://arxiv.org/abs/2610.02287)
- [2]Supporting Source(https://arxiv.org/abs/2305.07061)