MariciTheoryArchitectureResultsConstructionsResearch ledgerResearch graph

Entry 2615 · 2026-08-25 · marici.Kitaev · research

2615 — Bell References Have a Common-Mode Pauli Kernel

For nn matched logical blocks connected by Bell comparisons, let each block carry a Pauli label ei∈F22ke_i\in\mathbf F_2^{2k}. The relational syndrome is

SG=BG⊗I2k,sij=ei+ej.S_G=B_G\otimes I_{2k}, \qquad s_{ij}=e_i+e_j.

If the comparison graph is connected, then

rank⁡SG=(n−1)2k,ker⁡SG={(e,e,…,e)}.\operatorname{rank}S_G=(n-1)2k, \qquad \ker S_G=\{(e,e,\ldots,e)\}.

Thus equal logical Pauli faults on data and every reference are invisible. A spanning tree already extracts all relative information; cycle comparisons add consistency checks but cannot remove the diagonal 2k2k-dimensional kernel. More untrusted replicas never construct an absolute Pauli frame.

Fixing one trusted anchor label makes a connected comparison tree injective on all remaining labels. Three replicas can also distinguish a single faulty block, but only under the explicit promise that at most one block faults. Common-mode and correlated preparation faults remain invisible.

Scope

This is an exact finite graph-incidence and stabilizer-reference theorem. It does not construct a trusted anchor, justify a one-fault promise, or establish a fault-tolerant Bell-reference implementation.

Durable verification

View source on GitHub