Quantum error-correcting (QEC) and entanglement-assisted quantum error-correcting (EAQEC) constructions from ring-linear codes require both duality preservation and rigorous distance analysis. For odd $ q $, we distinguish coefficient coordinates from Chinese remainder theorem (CRT) coordinates in $ R_{q, v} = \mathbb{F}_q[v]/\langle v^3-v\rangle $ and give the explicit change of basis. No invertible coefficient–coordinate matrix satisfying $ MM^T = aI_3 $ with $ a\in \mathbb{F}_q^* $ preserves Euclidean duals for every $ R_{q, v} $-linear code. Over a split semisimple ring $ \mathcal{R} = \bigoplus_{i = 1}^s e_i \mathbb{F}_q $, a component Gray map with mixing matrix $ B\in GL_s(\mathbb{F}_q) $ preserves duals for every $ \mathcal{R} $-linear code if and only if $ BB^T $ is nonsingular diagonal. Matrices satisfying this criterion and the nonsingular-by-columns (NSC) condition exist for every $ s\ge2 $ and every odd $ q > 2s-1 $. The NSC condition requires $ s\le q $; for orders three and four, existence is equivalent to $ q > 3 $. The matrix-product description gives exact classical distances for nested constituents. Counterexamples identify defects in specific component decompositions, duality claims, and a five-case distance formula. In particular, the reported $ [[21, 13, 6]]_7 $ parameters violate the quantum Singleton bound, whereas the corrected repeated-root construction yields $ [[21, 13, 3]]_7 $. Nested cyclic Reed–Solomon constituents yield the exact QEC families $ [[3(q-1), 3q-15, 4]]_q $ for odd prime powers $ q\ge9 $ and $ [[3(q-1), 3q+3-11t, 3t]]_q $ for even $ t\ge2 $ and odd prime powers $ q > 6t-1 $, together with the exact EAQEC family $ [[3(q-1), 3q-14, 6;5]]_q $ for odd prime powers $ q\ge7 $. Dual-distance bounds and explicit words outside the hull establish the quantum distances in these families; the general construction theorems retain lower bounds when the additional distance checks are unavailable.
Citation: Qingyu Zhang, Yong Zhang. Quantum codes over split semisimple rings: coordinate-correct Gray maps and exact distances[J]. AIMS Mathematics, 2026, 11(11): 38141-38169. doi: 10.3934/math.20261473
Quantum error-correcting (QEC) and entanglement-assisted quantum error-correcting (EAQEC) constructions from ring-linear codes require both duality preservation and rigorous distance analysis. For odd $ q $, we distinguish coefficient coordinates from Chinese remainder theorem (CRT) coordinates in $ R_{q, v} = \mathbb{F}_q[v]/\langle v^3-v\rangle $ and give the explicit change of basis. No invertible coefficient–coordinate matrix satisfying $ MM^T = aI_3 $ with $ a\in \mathbb{F}_q^* $ preserves Euclidean duals for every $ R_{q, v} $-linear code. Over a split semisimple ring $ \mathcal{R} = \bigoplus_{i = 1}^s e_i \mathbb{F}_q $, a component Gray map with mixing matrix $ B\in GL_s(\mathbb{F}_q) $ preserves duals for every $ \mathcal{R} $-linear code if and only if $ BB^T $ is nonsingular diagonal. Matrices satisfying this criterion and the nonsingular-by-columns (NSC) condition exist for every $ s\ge2 $ and every odd $ q > 2s-1 $. The NSC condition requires $ s\le q $; for orders three and four, existence is equivalent to $ q > 3 $. The matrix-product description gives exact classical distances for nested constituents. Counterexamples identify defects in specific component decompositions, duality claims, and a five-case distance formula. In particular, the reported $ [[21, 13, 6]]_7 $ parameters violate the quantum Singleton bound, whereas the corrected repeated-root construction yields $ [[21, 13, 3]]_7 $. Nested cyclic Reed–Solomon constituents yield the exact QEC families $ [[3(q-1), 3q-15, 4]]_q $ for odd prime powers $ q\ge9 $ and $ [[3(q-1), 3q+3-11t, 3t]]_q $ for even $ t\ge2 $ and odd prime powers $ q > 6t-1 $, together with the exact EAQEC family $ [[3(q-1), 3q-14, 6;5]]_q $ for odd prime powers $ q\ge7 $. Dual-distance bounds and explicit words outside the hull establish the quantum distances in these families; the general construction theorems retain lower bounds when the additional distance checks are unavailable.
| [1] |
P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, 52 (1995), R2493. https://doi.org/10.1103/PhysRevA.52.R2493 doi: 10.1103/PhysRevA.52.R2493
|
| [2] |
A. R. Calderbank, P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A, 54 (1996), 1098–1105. https://doi.org/10.1103/PhysRevA.54.1098 doi: 10.1103/PhysRevA.54.1098
|
| [3] |
A. R. Calderbank, E. M. Rains, P. M. Shor, N. J. A. Sloane, Quantum error correction via codes over GF(4), IEEE Trans. Inf. Theory, 44 (1998), 1369–1387. https://doi.org/10.1109/18.681315 doi: 10.1109/18.681315
|
| [4] |
A. Ashikhmin, E. Knill, Nonbinary quantum stabilizer codes, IEEE Trans. Inf. Theory, 47 (2001), 3065–3072. https://doi.org/10.1109/18.959288 doi: 10.1109/18.959288
|
| [5] |
A. Ketkar, A. Klappenecker, S. Kumar, P. K. Sarvepalli, Nonbinary stabilizer codes over finite fields, IEEE Trans. Inf. Theory, 52 (2006), 4892–4914. https://doi.org/10.1109/TIT.2006.883612 doi: 10.1109/TIT.2006.883612
|
| [6] |
T. Brun, I. Devetak, M. H. Hsieh, Correcting quantum errors with entanglement, Science, 314 (2006), 436–439. https://doi.org/10.1126/science.1131563 doi: 10.1126/science.1131563
|
| [7] |
M. M. Wilde, T. A. Brun, Optimal entanglement formulas for entanglement-assisted quantum coding, Phys. Rev. A, 77 (2008), 064302. https://doi.org/10.1103/PhysRevA.77.064302 doi: 10.1103/PhysRevA.77.064302
|
| [8] |
C. Galindo, F. Hernando, R. Matsumoto, D. Ruano, Entanglement-assisted quantum error-correcting codes over arbitrary finite fields, Quantum Inf. Process., 18 (2019), 116. https://doi.org/10.1007/s11128-019-2234-5 doi: 10.1007/s11128-019-2234-5
|
| [9] |
K. Guenda, T. A. Gulliver, S. Jitman, S. Thipworawimon, Linear $\ell$-intersection pairs of codes and their applications, Des. Codes Cryptogr., 88 (2020), 133–152. https://doi.org/10.1007/s10623-019-00676-z doi: 10.1007/s10623-019-00676-z
|
| [10] |
F. R. F. Pereira, S. Mancini, Entanglement-assisted quantum codes from cyclic codes, Entropy, 25 (2023), 37. https://doi.org/10.3390/e25010037 doi: 10.3390/e25010037
|
| [11] |
W. C. Huffman, V. Pless, Fundamentals of error-correcting codes, Cambridge University Press, 2003. https://doi.org/10.1017/CBO9780511807077 |
| [12] |
S. Ling, C. Xing, Coding theory: a first course, Cambridge University Press, 2004. https://doi.org/10.1017/CBO9780511755279 |
| [13] |
S. A. Aly, A. Klappenecker, P. K. Sarvepalli, On quantum and classical BCH codes, IEEE Trans. Inf. Theory, 53 (2007), 1183–1188. https://doi.org/10.1109/TIT.2006.890730 doi: 10.1109/TIT.2006.890730
|
| [14] |
T. Blackmore, G. H. Norton, Matrix-product codes over $ \mathbb{F}_q$, Appl. Algebra Eng. Commun. Comput., 12 (2001), 477–500. https://doi.org/10.1007/PL00004226 doi: 10.1007/PL00004226
|
| [15] |
F. Hernando, K. Lally, D. Ruano, Construction and decoding of matrix-product codes from nested codes, Appl. Algebra Eng. Commun. Comput., 20 (2009), 497–507. https://doi.org/10.1007/s00200-009-0113-5 doi: 10.1007/s00200-009-0113-5
|
| [16] |
X. Liu, H. Liu, Quantum codes from linear codes over finite chain rings, Quantum Inf. Process., 16 (2017), 240. https://doi.org/10.1007/s11128-017-1695-7 doi: 10.1007/s11128-017-1695-7
|
| [17] |
M. Ashraf, G. Mohammad, Quantum codes over $ \mathbb{F}_p$ from cyclic codes over $ \mathbb{F}_p[u, v]/\langle u^2-1, v^3-v, uv-vu\rangle$, Cryptogr. Commun., 11 (2019), 325–335. https://doi.org/10.1007/s12095-018-0299-0 doi: 10.1007/s12095-018-0299-0
|
| [18] |
Y. Gao, J. Gao, F. W. Fu, Quantum codes from cyclic codes over the ring $ \mathbb{F}_q+v_1 \mathbb{F}_q+\cdots+v_r \mathbb{F}_q$, Appl. Algebra Eng. Commun. Comput., 30 (2019), 161–174. https://doi.org/10.1007/s00200-018-0366-y doi: 10.1007/s00200-018-0366-y
|
| [19] |
O. P. Pandey, S. Pathak, A. K. Shukla, V. Mishra, A. K. Upadhyay, A study of QECCs and EAQECCs construction from cyclic codes over the ring $ \mathbb{F}_q+v_1 \mathbb{F}_q+v_2 \mathbb{F}_q+\cdots+v_s \mathbb{F}_q$, Quantum Inf. Process., 23 (2024), 31. https://doi.org/10.1007/s11128-023-04240-6 doi: 10.1007/s11128-023-04240-6
|
| [20] |
X. Zhang, QEC and EAQEC codes from cyclic codes over non-chain rings, Quantum Inf. Process., 21 (2022), 389. https://doi.org/10.1007/s11128-022-03734-z doi: 10.1007/s11128-022-03734-z
|
| [21] |
M. Cao, Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal and quasi-unitary matrices, arXiv, 2022. https://doi.org/10.48550/arXiv.2012.15691 |
| [22] |
M. Cao, F. Wei, G. Luo, Entanglement-assisted quantum error-correcting codes using matrix-product codes, Des. Codes Cryptogr., 93 (2025), 4473–4500. https://doi.org/10.1007/s10623-025-01685-x doi: 10.1007/s10623-025-01685-x
|
| [23] |
Y. Li, S. Zhu, E. Martínez-Moro, On general self-orthogonal matrix-product codes associated with Toeplitz matrices, Cryptogr. Commun., 17 (2025), 397–420. https://doi.org/10.1007/s12095-024-00763-6 doi: 10.1007/s12095-024-00763-6
|
| [24] |
X. Xu, W. Zhang, X. Liu, Matrix-product codes related to constacyclic codes and their applications to EAQEC codes, Discrete Math., 347 (2024), 113878. https://doi.org/10.1016/j.disc.2024.113878 doi: 10.1016/j.disc.2024.113878
|
| [25] |
J. Liu, P. Hu, X. Liu, The Euclidean hulls of matrix product codes and their applications to EAQEC codes, Quantum Inf. Process., 24 (2025), 275. https://doi.org/10.1007/s11128-025-04899-z doi: 10.1007/s11128-025-04899-z
|
| [26] |
S. Ali, G. Mohammad, Jeelani, N. Khan, P. Sharma, On quantum and LCD codes over the ring $ \mathbb{F}_q+v \mathbb{F}_q+v^2 \mathbb{F}_q$, Quantum Inf. Process., 21 (2022), 306. https://doi.org/10.1007/s11128-022-03654-y doi: 10.1007/s11128-022-03654-y
|
| [27] |
H. Li, X. Liu, Cyclic codes over a semi-local ring and their applications to QEC and EAQEC codes, Quantum Inf. Process., 24 (2025), 49. https://doi.org/10.1007/s11128-025-04666-0 doi: 10.1007/s11128-025-04666-0
|
| [28] |
S. Szabo, F. Ulmer, Duality preserving Gray maps for codes over rings, J. Algebra Appl., 16 (2017), 1750161. https://doi.org/10.1142/S0219498817501614 doi: 10.1142/S0219498817501614
|
| [29] |
X. Liu, H. Liu, L. Yu, Entanglement-assisted quantum codes from matrix-product codes, Quantum Inf. Process., 18 (2019), 183. https://doi.org/10.1007/s11128-019-2300-z doi: 10.1007/s11128-019-2300-z
|
| [30] |
J. Liu, P. Hu, X. Liu, Application of Euclidean sums of matrix-product codes to quantum codes, Quantum Inf. Process., 22 (2023), 202. https://doi.org/10.1007/s11128-023-03954-x doi: 10.1007/s11128-023-03954-x
|
| [31] |
C. Galindo, F. Hernando, R. Matsumoto, D. Ruano, Correction to: Entanglement-assisted quantum error-correcting codes over arbitrary finite fields, Quantum Inf. Process., 20 (2021), 216. https://doi.org/10.1007/s11128-021-03066-4 doi: 10.1007/s11128-021-03066-4
|
| [32] |
G. Luo, X. Cao, Two new families of entanglement-assisted quantum MDS codes from generalized Reed–Solomon codes, Quantum Inf. Process., 18 (2019), 89. https://doi.org/10.1007/s11128-019-2207-8 doi: 10.1007/s11128-019-2207-8
|
| [33] |
G. Luo, X. Cao, X. Chen, MDS codes with hulls of arbitrary dimensions and their quantum error correction, IEEE Trans. Inf. Theory, 65 (2019), 2944–2952. https://doi.org/10.1109/TIT.2018.2874953 doi: 10.1109/TIT.2018.2874953
|
| [34] |
W. Fang, F. W. Fu, L. Li, S. Zhu, Euclidean and Hermitian hulls of MDS codes and their applications to EAQECCs, IEEE Trans. Inf. Theory, 66 (2020), 3527–3537. https://doi.org/10.1109/TIT.2019.2950245 doi: 10.1109/TIT.2019.2950245
|
| [35] |
M. Grassl, T. Beth, M. Rötteler, On optimal quantum codes, Int. J. Quantum Inf., 2 (2004), 55–64. https://doi.org/10.1142/S0219749904000079 doi: 10.1142/S0219749904000079
|
| [36] |
M. Cao, K. Zhou, Quantum codes and optimal pure quantum $(r, \delta)$-LRCs via the MP construction, arXiv, 2026. https://doi.org/10.48550/arXiv.2606.14253 |
| [37] |
N. Alon, Combinatorial nullstellensatz, Combin. Probab. Comput., 8 (1999), 7–29. https://doi.org/10.1017/S0963548398003411 doi: 10.1017/S0963548398003411
|
| [38] |
T. Zhang, G. Ge, Quantum codes from generalized Reed–Solomon codes and matrix-product codes, arXiv, 2015. https://doi.org/10.48550/arXiv.1508.00978 |
| [39] |
M. Grassl, Bounds on the minimum distance of quantum codes, 2026. Available from: https://www.codetables.de/QECC/index.html. |
| [40] |
M. Grassl, Bounds on $[[12, 8]]_5$, 2026. Available from: https://www.codetables.de/QECC/QECC.php?k=8&n=12&q=25. Accessed 21 October 2026. |
| [41] |
M. Grassl, Bounds on $[[18, 12]]_7$, 2026. Available from: https://www.codetables.de/QECC/QECC.php?k=12&n=18&q=49. Accessed 21 October 2026. |
| [42] |
M. Grassl, Bounds on $[[18, 10]]_7$, 2026. Available from: https://www.codetables.de/QECC/QECC.php?k=10&n=18&q=49. Accessed 21 October 2026. |