Fp -Linear and Fpm-Linear Qudit Codes From Dual-Containing Classical Codes

Quantum code construction from two classical codes D1[n,k1,d1] and D2[n,k2,d2] over the field Fpm ( p is prime and m is an integer) satisfying the dual containing criteria D⊥1⊂D2 using the Calderbank–Shor–Steane (CSS) framework is well-studied. We show that the generalization of the CSS framework for qubits to qudits yields two different classes of codes, namely, the Fp -linear CSS codes and the well-known Fpm -linear CSS codes based on the […]