# Fermionic circuit message passing - ID: 1481 - Canonical URL: https://synthcore.org/idea/1481/fermionic-circuit-message-passing - API JSON: https://synthcore.org/api/idea/1481.json - API Markdown: https://synthcore.org/api/idea/1481.md - Verification status: beats_baseline - Source: [arXiv:2607.27198](https://arxiv.org/abs/2607.27198) - Category: architecture - Solves: accuracy, generalization, scalability - ML areas: graph-nn, embedding, architecture - Math tags: algebra, tensor-decomposition, combinatorics, representation-theory - Ratings: usefulness 7/10; difficulty 6/10; novelty 8/10 ## Idea description Augment every graph-neural-network edge message with an even commuting channel and a low-dimensional odd anticommuting channel. Contracting odd channels around an edge circuit gives a sign determined by the number of odd edges, while local states with odd incident degree are forced to vanish; this supplies a built-in parity and cycle constraint that ordinary GNNs must learn implicitly. ## Mathematical statement The construction uses a super vector space V=V_0\oplus V_1, where V_0 is the even sector and V_1 is the odd sector. The paper defines an involution J on \operatorname{Sym}V_0\otimes\Lambda V_1 by J=(-1)^{j(j-1)/2}\operatorname{id} on exterior degree j, and transforms a local tensor by h^{\mathrm{RS}}=h^{\mathrm{cat}}\circ J. Here j is the number of odd incident half-edges and h^{\mathrm{cat}} is the ordinary categorical contraction. Odd local degrees vanish, so only even j contribute. For an odd-edge subset F, parity transfer contributes \prod_v(-1)^{j_v/2}=(-1)^{|F|}, where j_v=\deg_F(v) and |F| is the number of selected odd edges. The explicit circuit formula uses \widehat C_1=-\sum_i\xi_i\otimes\eta_i, odd basis vectors \xi_i,\eta_i, exterior contraction \varpi_j, and c(\kappa), the number of circuits in the pairing \kappa. ## Key formulas - $$V=V_0\oplus V_1,\qquad h^{\mathrm{RS}}=h^{\mathrm{cat}}\circ J,$$ - $$J\big|_{\operatorname{Sym}V_0\otimes\Lambda^jV_1}=(-1)^{j(j-1)/2}\,\operatorname{id},$$ - $$\prod_v(-1)^{j_v/2}=(-1)^{\frac12\sum_v j_v}=(-1)^{|F|},\qquad j_v=\deg_F(v),$$ - $$\left(\bigotimes_v\varpi_{\deg_F v}\right)\circ\mathrm{Regroup}_{F,\kappa}(\widehat C_1^{\otimes |F|})=(-1)^{c(\kappa)}\sum_{\varphi:F\to[2\ell]}\bigotimes_v\bigwedge_{(a_1,a_2)\in\kappa_v}\xi_{\varphi(a_1)}\wedge\eta_{\varphi(a_2)}.$$ ## Implementation notes Integrate this into a message-passing GNN immediately after edge message construction and before aggregation. For each directed edge (u,v), produce an even vector e_uv in R^k and an odd vector o_uv in R^{2ell}; use separate linear maps, with ell=2 or 4 initially. Maintain the odd state as an exterior-algebra coefficient tensor rather than an unrestricted vector. A practical low-order implementation stores only degree-0 and degree-2 coefficients: degree-0 is a scalar and degree-2 is a skew-symmetric matrix A in R^{2ell x 2ell}, representing the exterior sum \sum_{i