The Three Forms of the Maslov-Gibbs Einsum: H⁰ Tropical, H¹ Clifford, H² Metaplectic
Ian Richard C Buckley
Abstract
The Maslov-Gibbs Einsum (MGE) is not a single algorithm but a family of tensor contraction schemes indexed by the cohomological level $H^k$ of the physical system. This paper identifies three distinct forms: $H^0$ MGE (classical/tropical): contraction over the min-plus tropical semiring, corresponding to Maslov dequantisation ($\hbar \to 0$). Finds the dominant classical path; computational class P. $H^1$ MGE (Clifford/stabiliser): contraction over the stabiliser calculus of the Clifford group $\mathsf{C}_2$. Captures quantum interference within the stabiliser sector. Classically simulable in polynomial time by the Gottesman-Knill theorem, but exponentially more expressive than $H^0$: captures non-local correlations, entanglement, and quantum error correction. $H^2$ MGE (metaplectic/magic): contraction with Maslov index phase corrections. Each gate composition $g \circ h$ acquires a $\mathbb{Z}_2$ phase factor $(-1)^{\tau(L, gL, ghL)}$ from the Maslov index of three Lagrangian subspaces. The TWIST opcode in the Origami ISA counts how many times this correction fires; TWIST $> 0$ is necessary and sufficient for $H^2$ MGE. Computational class BQP-hard. The central observation is that Viktor Maslov named both ends of this ladder: Maslov dequantisation ($H^0$, 1990s) and the Maslov index ($H^2$, 1965) are not coincidentally related — they are the two limits of the same quantisation programme, with the Clifford/Berry-phase level $H^1$ interpolating between them. The name "Maslov-Gibbs Einsum" was more prophetic than intended: Maslov's index governs the $H^2$ correction as well as the $H^0$ tropical limit. The Origami ISA compiler selects the MGE form automatically: TWIST $= 0$ implies $H^1$ MGE suffices; TWIST $> 0$ requires $H^2$ MGE. This makes the Schur multiplier $\mathbb{Z}_2$ a compile-time certificate for quantum advantage. The paper also introduces the Penrose empire problem as a non-quantum illustration of why $H^0$ local consistency checking cannot detect $H^1$ and $H^2$ obstructions, and discusses the $H^3$ frontier (Dijkgraaf-Witten state sums, Fibonacci anyon braiding) as the next level beyond current qubit hardware. Keywords Maslov-Gibbs Einsum, tropical semiring, Maslov dequantisation, Maslov index, Clifford group, stabiliser calculus, metaplectic group, cohomological filtration, $H^k$ tower, TWIST opcode, Origami ISA, Gottesman-Knill theorem, quantum advantage, BQP, magic states, tensor contraction, Penrose tiling, Dijkgraaf-Witten, topological quantum computation