Quantum
Premonoidal Semantics and Scalable Diagrammatics of Fermionic Quantum Computing
Publication: quant-ph updates on arXiv.org
Author: Thomas Perez, Titouan Carette
Source published: 05/10/2026, 04:00:00 UTC
Briefing created: 05/10/2026, 04:23:54 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 05/10/2026, 04:13:24 UTC.
Briefings
This preprint establishes that local fermionic mode (LFM) quantum computation forms a symmetric premonoidal category, resolving the failure of the interchange law in standard monoidal categories. The framework introduces 'pronaps' as a relaxed prop system to handle non-natural permutations, enabling scalable diagrammatic notation for fermionic circuits. Key syntactic sugars, including matrix arrows for minors and graph triangles for pfaffians, provide normal forms for the EoW, FoW, EW, and FW fragments, with the FW presentation offering a distinct normal form for the matchgate fragment compared to existing planar-W representations.
Key points
- LFM-based quantum computation forms a symmetric premonoidal category where the centre consists of even, parity-preserving subcategories.
- Pronaps provide a relaxation of prop systems allowing non-natural permutations, enabling scalable diagrammatic notation for fermionic circuits.
Context and limitations
The framework relies on preprint data from arXiv:2610.02287v1, which may contain unverified claims or future developments. Specific numerical values, experimental results, and author affiliations are not provided in the evidence.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 05/10/2026, 04:23:54 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeidlh4c3u4sqlgvhl7hiqtfl4qyd6mz5d56tiimusf5edslznbdqyq