Tetron subsystem code[1]
Description
Member of a family of Majorana subsystem stabilizer codes on \(n\) tetrons obtained from an \([[n,k_b,d_b]]\) qubit stabilizer code and an \([n,k,d_c]\) classical binary code. The qubit code’s Pauli operators become weight-two Majorana operators on the tetrons, and the classical code’s parity checks become stabilizers that are products of four-Majorana tetron parities. A tetron parity flips only under an odd-weight (fermionic) error, so these checks detect such errors, while tetron parities not fixed by them are gauge operators rather than further stabilizer generators [1].
A tetron is a superconducting island hosting four Majorana zero modes \(\gamma_a,\gamma_b,\gamma_c,\gamma_d\), on which only parities of two modes are measured, and it stores a qubit in the form of operator parity. Its six weight-two Majorana operators split into two sets, \begin{align} \mathcal{R} &= \{\gamma_b\gamma_c,~\gamma_a\gamma_c,~\gamma_a\gamma_b\}\tag*{(1)}\\ \mathcal{R}^{\prime} &= \{\gamma_a\gamma_d,~\gamma_d\gamma_b,~\gamma_c\gamma_d\}~, \tag*{(2)}\end{align} identified with the Pauli operators \(X,Y,Z\) and their primed counterparts, respectively [1; Fig. 1]. Corresponding operators of the two sets return the same parity under an even-weight error and opposite parities under an odd-weight error. Comparing them therefore reveals whether an error has odd weight using only two-mode parity measurements [1].
The Pauli operators of the qubit code are mapped onto the Majorana operators of the set \(\mathcal{R}\), one tetron per qubit. Each row of the classical parity-check matrix \(H\) contributes a stabilizer equal to the product of the tetron parities on its support. A tetron parity cannot be measured directly. Such a stabilizer is instead realized as the product of an existing stabilizer supported on those tetrons and a copy of it with the operators on those tetrons switched from \(\mathcal{R}\) to \(\mathcal{R}^{\prime}\). The two codes must therefore be compatible: every row of \(H\) has to admit a stabilizer of the qubit code supported on at least the tetrons in that row [1]. Each row of the systematic generator matrix \(G=[I_k|P]\) contributes two gauge operators, the tetron parity at the row’s first nonzero entry and the \(\gamma_d\)-string supported on all of its nonzero entries. These \(2k\) operators generate a gauge group of order \(2^{2k}\), yielding \(k\) gauge qubits. The output is a \([[2n,k_b,k,d_f]]\) Majorana subsystem code on \(n\) tetrons, i.e., \(2n\) fermionic modes, with \(n-k_b\) stabilizers inherited from the qubit code and \(n-k\) from the classical code [1]. Taking the classical code to have no logical bits places every tetron parity in the stabilizer group and leaves no gauge qubits. This recovers concatenation with the tetron code [2][3; Lemma 1][4; Sec. IV]. Relative to that earlier non-subsystem construction, the subsystem code corrects both odd- and even-weight errors with fewer stabilizer generators [1].
The \([[10,1,2,3]]\) code is obtained from the five-qubit perfect code and the \([5,2,3]\) classical code [1; Sec. 3.5]. See Ref. [1; Table 1] for the instances obtained from the \([[6,1,3]]\) code with the \([6,1,6]\) and \([6,3,3]\) codes and from the Steane code.
Protection
Protects against both errors affecting an even number of Majorana modes and fermionic errors affecting an odd number. Conventional tetron encodings rely on high charging energy to suppress odd-weight errors rather than correcting them [5]. The fermionic distance \(d_f\) is the least Majorana weight of a nontrivial dressed logical operator. It satisfies \(d_b\leq d_f\leq 2d_b\), where \(d_b\) is the distance of the bosonic input code [1].
The \([[10,1,2,3]]\), \([[12,1,3,3]]\), and \([[14,1,4,3]]\) codes have \(d_f=d_b=3\), while the \([[12,1,1,6]]\) code built from the \([6,1,6]\) repetition code retains \(d_f=2d_b=6\) [1; Table 1]. The least Majorana weight of the fermionic gauge operators equals the distance \(d_c\) of the classical input code [1].
Decoding
BP-OSD decoder [6], run with belief propagation in the product-sum mode, ordered-statistics post-processing in combination-sweep mode, at most five iterations, and search depth \(2n+1\) for \(n\) tetrons [1].Fault Tolerance
A suitable ordering of the stabilizer measurements, with redundant measurements added where required, yields syndrome-extraction sequences tolerating one even or one odd error [1; Appx. A]. The error can occur either at the input or at an intermediate stage. The \([[10,1,2,3]]\) code admits the shortest such sequence, of length eight and using a single redundant measurement. It attains the highest fault-tolerant pseudothreshold of the four instances.Cousins
- Tetron code— Tetron subsystem codes are defined on \(n\) tetrons, whose parity operators serve as gauge generators. Placing these operators in the gauge group rather than fixing them by high charging energy is what exposes odd-weight errors to correction [1].
- Qubit stabilizer code— The tetron subsystem construction converts an \([[n,k_b,d_b]]\) qubit stabilizer code, together with a compatible classical code, into a \([[2n,k_b,k,d_f]]\) Majorana subsystem code. The Pauli operators of the qubit code are mapped to weight-two Majorana operators on tetrons [1].
- Linear binary code— The classical input code determines the gauge sector of a tetron subsystem code. Rows of its parity-check matrix become tetron stabilizers. Rows of its systematic generator matrix become gauge operators, one gauge qubit per row [1].
- \([[5,1,3]]\) Five-qubit perfect code— The \([[10,1,2,3]]\) tetron subsystem code is obtained from the five-qubit perfect code together with the \([5,2,3]\) classical code [1; Sec. 3.5].
- \([[7,1,3]]\) Steane code— The \([[14,1,4,3]]\) tetron subsystem code is obtained from the Steane code together with the \([7,4,3]\) Hamming code [1; Sec. 3.7].
- \([2^r-1,2^r-r-1,3]\) Hamming code— The \([[14,1,4,3]]\) tetron subsystem code is obtained from the Steane code together with the \([7,4,3]\) Hamming code [1; Sec. 3.7].
Primary Hierarchy
References
- [1]
- S. Kundu and B. Reichardt, “Majorana subsystem qubit codes that also correct odd-weight errors”, New Journal of Physics 26, 073029 (2024) DOI
- [2]
- A. Kitaev, “Anyons in an exactly solved model and beyond”, Annals of Physics 321, 2 (2006) arXiv:cond-mat/0506438 DOI
- [3]
- S. Bravyi, B. M. Terhal, and B. Leemhuis, “Majorana fermion codes”, New Journal of Physics 12, 083039 (2010) arXiv:1004.3791 DOI
- [4]
- S. Kundu and B. W. Reichardt, “Majorana qubit codes that also correct odd-weight errors”, (2023) arXiv:2311.01779
- [5]
- O. Viyuela, S. Vijay, and L. Fu, “Scalable fermionic error correction in Majorana surface codes”, Physical Review B 99, (2019) arXiv:1812.08477 DOI
- [6]
- J. Roffe, D. R. White, S. Burton, and E. Campbell, “Decoding across the quantum low-density parity-check code landscape”, Physical Review Research 2, (2020) arXiv:2005.07016 DOI
Page edit log
- Victor V. Albert (2026-09-26) — most recent
- Victor V. Albert (2026-08-25)
- Victor V. Albert (2026-08-24)
Cite as:
“Tetron subsystem code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/tetron_subsystem, arXiv:2606.11484