Description
An \(((n,K,d))_q\) modular-qudit stabilizer code admitting a set of stabilizer generators that are either \(Z\)-type or \(X\)-type Pauli strings. Codes can be defined from two classical codes and/or chain complexes over the ring \(\mathbb{Z}_q\) via an extension of the qubit CSS-to-homology correspondence to modular qudits [5]. The homology group of the logical operators can have a torsion component because the chain complexes are defined over a ring, which can yield codes whose logical dimension is not a power of \(q\).
The stabilizer generator matrix, taking values from \(\mathbb{Z}_q\), is of the form \begin{align}
For composite \(q\), such codes need not encode an integer number of qudits, but there are general structure theorems [6; Thm. 3.3][7; Thm. 8.1.1], with the latter relating to homology. An \((n,K_X,d_X)_{\mathbb{Z}_q}\) linear code \(C_X\) and an \((n,K_Z,d_Z)_{\mathbb{Z}_q}\) linear code \(C_Z\), satisfying \(C_X^\perp \subseteq C_Z\), yield an \(((n,K_X K_Z / q^n))_{\mathbb{Z}_q}\) modular-qudit CSS code with distance \(d\geq\min\{d_X,d_Z\}\). Specializing to the case when \(C_Z=(n,K,d)_{\mathbb{Z}_q}\) is dual-containing yields an \(((n,K^2 / q^n))_{\mathbb{Z}_q}\) self-dual modular-qudit CSS code with \(C_X = C_Z\) [6; Corr. 3.4].
For prime \(q=p\), the logical dimension returns to being a power of \(q\): encoding is based on two related \(p\)-ary linear codes, an \([n,k_X,d_X]_p \) code \(C_X\) and \([n,k_Z,d_Z]_p \) code \(C_Z\), satisfying \(C_X^\perp \subseteq C_Z\). The resulting CSS code has \(k=k_X+k_Z-n\) logical qudits and distance \(d\geq\min\{d_X,d_Z\}\). Specializing to the case when \(C_Z=[n,k,d]_p\) is dual-containing yields an \([[n,2k-n,\geq d]]_p\) self-dual prime-qudit CSS code with \(C_X = C_Z\). The \(H_X\) (\(H_Z\)) block of \(H\) (1) is the parity-check matrix of the code \(C_Z\) (\(C_X\)). The requirement \(C_X^\perp \subseteq C_Z\) guarantees (2). Basis states for the code are, for coset representatives \(\gamma \in C_X/C_Z^\perp\), \begin{align}
Transversal and Permutation-Based Gates
Modular-qudit generalizations of CNOT gates are transversal interblock gates for all modular-qudit CSS codes.Scalar multiplication physical gates, which map \(|x\rangle \mapsto |ax\rangle\) for \(a \in \mathbb{Z}_q^\times\), the multiplicative group modulo \(q\), are transversal.Cousins
- Two-block CSS code— Any \([[n,k,d]]_{\mathbb{Z}_q}\) stabilizer code can be mapped onto a \([[2n,2k,d^{\prime}]]_{\mathbb{Z}_q}\) two-block CSS code with \(d\leq d^{\prime}\leq 2d\) via symplectic doubling, which preserves geometric locality of a code up to a constant factor.
- Linear code over \(\mathbb{Z}_q\)— The modular-qudit CSS construction uses two related \(q\)-ary linear codes over \(\mathbb{Z}_q\), \(C_X\) and \(C_Z\).
- Subsystem modular-qudit CSS code— Subsystem modular-qudit CSS codes reduce to (subspace) modular-qudit CSS codes when there is no gauge subsystem.
Primary Hierarchy
References
- [1]
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist”, Physical Review A 54, 1098 (1996) arXiv:quant-ph/9512032 DOI
- [2]
A. M. Steane, “Error Correcting Codes in Quantum Theory”, Physical Review Letters 77, 793 (1996) DOI
- [3]
“Multiple-particle interference and quantum error correction”, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452, 2551 (1996) arXiv:quant-ph/9601029 DOI
- [4]
E. M. Rains, “Nonbinary quantum codes”, (1997) arXiv:quant-ph/9703048
- [5]
H. Bombin and M. A. Martin-Delgado, “Homological error correction: Classical and quantum codes”, Journal of Mathematical Physics 48, (2007) arXiv:quant-ph/0605094 DOI
- [6]
K. Guenda and T. A. Gulliver, “Quantum codes over rings”, International Journal of Quantum Information 12, 1450020 (2014) DOI
- [7]
S. Novák, “Homological Quantum Error Correction with Torsion”, (2024) arXiv:2405.03559
Page edit log
- Victor V. Albert (2026-08-24) — most recent
- Victor V. Albert (2026-06-08)
- Leonid Pryadko (2022-02-16)
- Victor V. Albert (2022-02-16)
Cite as:
“Modular-qudit CSS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/qudit_css, arXiv:2606.11484