---
title: 'Odd Majorana Codes: Fault Tolerance and Parity'
url: https://www.emergentmind.com/topics/odd-majorana-codes
type: topic
---

# Odd Majorana Codes: Fault Tolerance and Parity

“Odd Majorana codes” is not a single standardized term in the arXiv literature. Across Majorana-code, fermionic-code, and Majorana-zero-mode papers, it refers to several nearby but distinct structures: codes with odd logical operators, codes whose dominant target noise is odd-weight Majorana error, codes defined by whether total fermion parity is or is not included in the stabilizer group, and encodings built from an odd number of Majorana zero modes. What unifies these usages is the central role of fermion-parity superselection: in most physical stabilizer frameworks, stabilizers remain parity even, while “oddness” reappears in the logical algebra, in the error model, or in the representation theory of the Majorana operator algebra [1004.3791].

## 1. Terminological scope

The phrase is best understood by separating several meanings that are often conflated.

| Meaning | Precise content | Representative source |
|---|---|---|
| **Odd logical code** | A Majorana code with at least one odd logical operator | [1004.3791] |
| **Odd code in parity language** | A code with total parity \(P\notin S\) | [2508.09928] |
| **Code for odd-weight errors** | A code designed to detect or correct parity-violating Majorana errors | [1703.00459] |
| **Odd-Majorana-mode encoding** | A physical system with an odd number of Majorana zero modes | [1109.4580] |

The first usage is the most established in the early Majorana-code literature. In “Majorana Fermion Codes,” a code has an odd logical operator exactly when the total parity operator \(C_{\rm all}=i^n c_1c_2\cdots c_{2n}\) is not contained in \(\pm{\cal S}_{\rm maj}\); the paper packages this through the parameter \(k_{\rm odd}\in\{0,1\}\) and ties the phenomenon to fermionic superselection protection [1004.3791]. A later fault-tolerance framework makes the same distinction more explicitly by definition: an even code satisfies \(P\in S\), whereas an odd code satisfies \(P\notin S\) [2508.09928].

A second usage is error-model centered rather than logical-algebra centered. In “Quantum Error Correction for Complex and Majorana Fermion Qubits,” odd Majorana operators are the parity-violating errors, especially single-Majorana quasiparticle-poisoning events \(\gamma_j\), and the code-theoretic question is how to detect or correct them with even stabilizers [1703.00459]. A third usage concerns the representation theory of Majorana zero modes themselves: for \(N\) vortices, odd \(N\) requires a parity-preserving state space of dimension \(2^{(N+1)/2}\), not the naive \(2^{(N-1)/2}\), so oddness here refers to the number of physical Majorana modes rather than to stabilizer weight or logical parity [1109.4580].

This suggests that “odd Majorana code” should be parsed locally from context rather than treated as a fixed term of art.

## 2. Stabilizer formalism and the parity-even baseline

The dominant stabilizer formalism for Majorana codes is parity even. Majorana operators satisfy the standard Clifford algebra, for example \(\{\gamma_n,\gamma_m\}=2\delta_{nm}\) or \(c_uc_v+c_vc_u=2\delta_{u,v}I\), depending on notation, and stabilizer groups are built from commuting even Majorana monomials [1703.00459]. In the binary description, this is equivalent to requiring stabilizer vectors to be self-orthogonal and therefore of even Hamming weight [2407.11319].

This restriction is not merely conventional. In the 2024 structural analysis of the Majorana Clifford group, physical observables and stabilizers must lie in the even subgroup \(\mathcal M_{2n}^+\), because odd strings anticommute with fermion parity \((-1)^F\); odd strings remain meaningful as formal operators and may serve as logical operators, but not as physical stabilizer generators [2407.11319]. The same point appears in “Majorana Fermion Codes,” where every element of \({\cal S}_{\rm maj}\) is required to have even weight [1004.3791].

A particularly clear parity-even regime is the one imposed in “Small Majorana Fermion Codes.” There the fermion-parity operator
\[
P_f=\gamma_1\gamma_2\cdots\gamma_{N_{\rm maj}}
\]
is assumed to be in the stabilizer group, and the consequence is immediate: every logical operator must commute with \(P_f\), hence every logical operator has even Majorana weight, and the code distance is even and at least \(2\) [1703.00612]. The paper’s distance-\(4\) and distance-\(6\) constructions, including the Hamming-like family
\[
(N_{\rm maj},K,d)=\bigl(2^m,\ 2^{m-1}-m-1,\ 4\bigr),
\]
are therefore not odd codes in the logical-parity sense, even though some of them outperform qubit-derived Majorana codes [1703.00612].

The same parity-even baseline persists in the surface-code and color-code framework for Majorana fermion codes. There, only even-number products of Majoranas are physically measurable, face stabilizers contain even numbers of Majoranas, and the Majorana code distance \(d_m\) is always even [1801.08143]. A common misconception is therefore that odd Majorana structure should show up as odd stabilizer generators; in the main stabilizer literature, it usually does not.

## 3. Odd logical operators and superselection protection

Once the stabilizer group is fixed to be parity even, oddness reappears most naturally in the logical operator algebra. The decisive criterion from “Majorana Fermion Codes” is:

\[
\exists\ \text{odd logical operator}
\quad\Longleftrightarrow\quad
C_{\rm all}\notin \pm{\cal S}_{\rm maj}.
\]

When this occurs, the code may be viewed as having \(k_{\rm odd}=1\), and one may choose logical Pauli representatives so that one of them is odd, for example \(\bar Z_1=C_{\rm all}\) and \(\bar X_1=P\) with \(P\) an odd logical operator [1004.3791]. The physical significance is that odd logical operators are inaccessible to parity-preserving environments. The paper therefore introduces
\[
l_{\rm even} =
\min_{\substack{
C\in {\cal C}({\cal S}_{\rm maj})\setminus {\cal S}_{\rm maj}\\
|C|=0\!\!\!\pmod 2
}}
\operatorname{diam}(\operatorname{Supp}(C)),
\]
which measures the smallest support diameter of an even logical operator and hence the lowest-order parity-preserving process capable of splitting the degeneracy [1004.3791].

Kitaev’s chain is the canonical example. Its stabilizer group
\[
{\cal S}_{\rm maj}=\langle ic_2c_3,\ ic_4c_5,\ \ldots,\ ic_{2n-2}c_{2n-1}\rangle
\]
has odd logical operators \(\bar X=c_1\) and \(\bar Z=c_{2n}\), so \(d=1\) as an abstract code but \(l_{\rm even}=2n\), because the lowest even logical operator \(ic_1c_{2n}\) spans the chain [1004.3791]. In two dimensions, the Majorana color code on a cylinder has odd boundary logical operators
\[
\bar C_\alpha=\prod_{u\in\gamma_\alpha}c_u,\qquad \alpha=0,1,
\]
together with an even logical string joining the boundaries, and the paper proves
\[
d=\Omega(\min(R,L)),\qquad l_{\rm even}=\Omega(L),
\]
while also showing that 2D still admits string-like even logical processes and therefore does not evade the usual no-go intuition against self-correction [1004.3791].

The operator-algebraic side of the same phenomenon appears in random interacting Majorana systems with only parity \(P\) and time reversal \(T\). There one can construct exact odd normalized zero modes \(\Gamma^{\rm odd}\) satisfying
\[
[H,\Gamma^{\rm odd}]=0,\qquad (\Gamma^{\rm odd})^\dagger=\Gamma^{\rm odd},\qquad (\Gamma^{\rm odd})^2=\mathbf 1,\qquad \{P,\Gamma^{\rm odd}\}=0,
\]
so the odd operator algebra survives at finite size as an exact conserved structure [1803.01348]. This does not by itself define a stabilizer code, but it furnishes a natural algebraic precursor for odd logical sectors.

## 4. Odd-weight errors and fermionic-error-correcting constructions

A second major line of work uses “odd Majorana” to mean odd-weight, parity-violating noise rather than odd logical operators. In “Quantum Error Correction for Complex and Majorana Fermion Qubits,” the total parity operator is
\[
\Gamma=i^N\gamma_1\gamma_2\cdots\gamma_{2N},
\]
and any odd-weight Majorana operator anticommutes with \(\Gamma\); single-Majorana poisoning \(\gamma_j\) is the basic local error channel [1703.00459]. Stabilizers remain even, but the code is designed so that odd errors produce distinct syndromes. For a non-degenerate \( [[N,k,d]]_{\boldsymbol f}\) code correcting all errors up to weight \(t\),
\[
d\ge 2t+1,
\]
and the fermionic Hamming bound reads
\[
2^{N-k}\ge \sum_{m=0}^{t}\binom{2N}{m}.
\]
The same paper argues that any nontrivial code must be non-degenerate with respect to weight-1 odd errors, because single-Majorana poisoning events cannot share a syndrome unless they act only on removable ancilla degrees of freedom [1703.00459].

Its shortest explicit example is the \( [[6,1,3]]_{\boldsymbol f}\) code on \(12\) Majoranas, with five even stabilizers and odd logical Majoranas
\[
\Gamma_1=\gamma_1\gamma_3\gamma_5,\qquad
\Gamma_2=\gamma_2\gamma_4\gamma_6\gamma_7\gamma_8\gamma_9\gamma_{10}\gamma_{11}\gamma_{12}.
\]
This is a useful illustration of both meanings of oddness at once: the stabilizers are even, the targeted physical errors are odd, and the logical Majoranas can also be odd [1703.00459].

The tetron-based construction “Majorana qubit codes that also correct odd-weight errors” makes the same distinction operational. A tetron hosts four Majorana zero modes \(\gamma_a,\gamma_b,\gamma_c,\gamma_d\), with qubit Pauli representatives
\[
X=\gamma_b\gamma_c,\qquad Y=\gamma_a\gamma_c,\qquad Z=\gamma_a\gamma_b,
\]
and complementary representatives
\[
X'=\gamma_a\gamma_d,\qquad Y'=\gamma_d\gamma_b,\qquad Z'=\gamma_c\gamma_d.
\]
The main result is that measurements spanning zero or two Majoranas per tetron are already sufficient to correct fermionic odd-weight errors; direct four-Majorana tetron-parity measurements are not required [2311.01779]. Starting from a bosonic code \(\llbracket n,k,d_b\rrbracket\), the paper’s \(B\mapsto F\) construction produces a fermionic code
\[
\llbracket 2n,k,d_f\rrbracket,\qquad d_f=2d_b,
\]
by enlarging the stabilizer group so that each tetron parity operator \(T_i\) is generated from measurable stabilizers. In that sense, odd-error correction emerges from even-measurement hardware [2311.01779].

## 5. Odd numbers of Majorana modes and parity-sensitive encodings

A third strand concerns systems with an odd number of Majorana zero modes. “State Space for Planar Majorana Zero Modes” shows that the minimal parity-preserving state-space dimension is
\[
\mathcal N=2^{N/2}\quad (N\ \text{even}),\qquad
\mathcal N=2^{(N+1)/2}\quad (N\ \text{odd}),
\]
so an odd number of physical Majoranas does not lead to an ill-defined Hilbert space; rather, it is naturally realized as an embedding into the next even Clifford representation, heuristically described as a “phantom vortex at infinity” [1109.4580]. For \(N=1\), the physically accepted parity-preserving representation is two dimensional,
\[
a=\frac{\sigma_1}{\sqrt2},
\]
whereas a one-dimensional diagonal realization is rejected as parity violating [1109.4580]. This matters for odd Majorana encodings because it separates the operator-algebra representation space from any later code subspace obtained by parity restriction.

A concrete parity-sensitive encoding appears in the Kitaev-chain qubit realized with superconducting circuits. There the nonlocal end fermion
\[
d_{\rm end}=\frac{1}{2}(\gamma_1^A+i\gamma_N^B)
\]
defines two degenerate ground states \(|0\rangle\) and \(|1\rangle\) that lie in opposite parity sectors, and the assignment depends on whether the chain length \(N\) is even or odd. In the charge-qubit realization,
\[
P_c|0\rangle=|0\rangle,\qquad P_c|1\rangle=-|1\rangle \quad (N\ \text{even}),
\]
while
\[
P_c|0\rangle=-|0\rangle,\qquad P_c|1\rangle=|1\rangle \quad (N\ \text{odd}) .
\]
This is not a full error-correcting code, but it is an explicit encoded Majorana qubit whose logical basis is parity resolved and whose parity labeling is itself odd/even sensitive [1108.3712].

These results imply that “odd Majorana code” can also refer, more loosely, to an encoding architecture in which odd cardinality or odd global parity materially affects the representation of the logical degrees of freedom, even before stabilizer coding enters.

## 6. Even versus odd codes in fault tolerance

The sharpest modern formulation of the distinction is the one used in the 2025 fault-tolerance framework for Majorana stabilizer codes. There an even code is defined by
\[
P\in S,
\]
and an odd code by
\[
P\notin S.
\]
The odd case immediately implies the existence of odd-weight logical operators, and the paper states that there must be at least two such odd logicals [2508.09928]. If one insists on keeping logicals local to individual code blocks, the natural elementary degree of freedom in an odd code is then a logical fermion, not a logical qubit. This is the same obstruction already visible in Kitaev-chain blocks: multi-block qubit encodings require Jordan–Wigner-type nonlocality, which is ill suited to transversal fault tolerance [2508.09928].

Parity superselection is the basic obstruction. Physical unitaries must preserve total fermion parity, so a standalone odd logical operator or an odd-code Hadamard is not directly physical. The paper resolves this with quantum reference frames. A parity-preserving version of an odd logical \(X\) is written as
\[
\bar X_{pp}=\gamma_R\gamma_A,
\]
and a reference-assisted Hadamard-like operation is
\[
\bar H_{pp}=\exp\!\left(-\frac{\pi}{4}\bar\gamma_A\gamma_R\right),
\]
which conjugates parity-preserving dressed logicals into one another [2508.09928]. More elaborate ancilla-and-reference gadgets then realize odd-code analogues of CNOT-like transformations while keeping the global operation parity even.

The same paper also gives a Steane-inspired syndrome-extraction formula for Majorana codes,
\[
s_d=s_2\wedge s_3+s_2\wedge s_4+s_3\wedge s_4+s_2\wedge s_3\wedge s_4 \pmod 2,
\]
and points out a specifically odd-code issue: recovery on the data block may itself correspond to an odd-weight operation, so the correction must be implemented jointly with an ancilla that absorbs the parity change [2508.09928]. It further exhibits an odd Majorana Reed–Muller construction \( [[15,1,3]]_f \) with a transversal fermionic \(T\)-type gate, while emphasizing that the corresponding logical states can only be described coherently relative to a reference frame [2508.09928].

This places the present state of the subject in a clear hierarchy. Mainstream physical stabilizer frameworks remain parity even at the stabilizer level [2407.11319]. Odd logical operators are nevertheless well defined and can yield superselection-enhanced protection [1004.3791]. Odd-weight noise can be corrected with even stabilizers [1703.00459]. Odd code blocks, in the sense \(P\notin S\), require genuinely fermionic fault-tolerance gadgets rather than a direct import of qubit constructions [2508.09928]. The resulting picture is not that odd Majorana codes violate the parity-even stabilizer paradigm, but that they relocate oddness from stabilizers to logical structure, error models, and parity-relative control.

Source: https://www.emergentmind.com/topics/odd-majorana-codes