Abstract
Quantum codes over finite rings have the advantage of being able to adapt to quantum physical systems with arbitrary order. Furthermore, operations are much easier to execute in finite rings than they are in fields. This paper discusses quantum cyclic codes over the modulo m residue class ring \( {\mathbb{Z}}_m \). A connection is established between the stabilizer codes over \( {\mathbb{Z}}_m \) and the additive codes over an extension ring of \( {\mathbb{Z}}_m \) that generalizes the well-known relationship between the stabilizer codes over \( {\mathbb{F}}_q \) and the additive codes over \( {\mathbb{F}}_{q^2} \). We prove that if the irreducible polynomial is selected according to a simple criterion, the additive codes which are self-orthogonal with respect to the conjugate inner product correspond to the stabilizer codes. The structure of cyclic stabilizer codes is developed, and some simple conditions for finding them are presented. We also define the quantum Bose-Chaudhuri-Hocquenghem (BCH) and quantum Reed-Solomon (RS) codes over \( {\mathbb{Z}}_m \). Finally, new quantum cyclic codes over \( {\mathbb{Z}}_m \) are given.
Similar content being viewed by others
References
Shor, P.W.: Scheme for reducing decoherence in quantum memory. Phys. Rev. A 52, 2493–2496 (1995)
Calderbank, A.R., Shor, P.W.: Good quantum error correction codes exist. Phys. Rev. A 54, 1098–1105 (1996)
Gottesman, D.: Class of quantum error-correcting codes saturating the quantum Hamming bound. Phys. Rev. A 54, 1862–1868 (1996)
Calderbank, A.R., Rains, E.M., Shor, P.W., Sloane, N.J.A.: Quantum error correction via codes over G F(4). IEEE Trans. Inf. Theory 44, 1369–1387 (1998)
Ketkar, A., Klappenecker, A., Kumar, S., Sarvepalli, P.K.: Nonbinary stabilizer codes over finite fields. IEEE Trans. Inf. Theory 52, 4892–4914 (2006)
Grassl, M., Beth, T.: Quantum BCH codes. Quantum Physics 10, 207–212 (1999)
Li, R., Li, X.: Quantum codes constructed from binary cyclic codes. Int. J. Quantum Inf. 2, 265–272 (2004)
Aly, S.A., Klappenecker, A., Sarvepalli, P.K.: Primitive quantum BCH codes over finite fields. Proc. Int. Symp. Inf. Theory, 1114–1118 (2006)
Aly, S.A., Klappenecker, A., Sarvepalli, P.K.: On quantum and classical BCH codes. IEEE. Trans. Inf. Theory 53, 1183–1188 (2007)
Guardia, G.G.: Constructions of new families of nonbinary quantum codes. Phys. Rev. A 80, 042331 (2009)
Kai, X., Zhu, S.: Quantum negacyclic codes. Phys. Rev. A 88, 012326 (2013)
Chen, B., Ling, S., Zhang, G.: Application of constacyclic codes to quantum MDS codes. IEEE Trans. Inf. Theory 61, 1474–1484 (2015)
Wang, L., Zhu, S.: New quantum MDS codes derived from constacyclic codes. Quantum Inf. Process. 14, 881–889 (2015)
Zhang, T., Ge, G.: Some new class of quantum MDS codes from constacyclic codes. IEEE Trans. Inf. Theory 61, 5224–5228 (2015)
Guardia, G.G.: New quantum MDS codes. IEEE Trans. Inf. Theory 57, 5551–5554 (2011)
Qian, J., Ma, W., Gou, W.: Quantum codes from cyclic codes over finite ring. Int. J. Quantum Inf. 7, 1277–1283 (2009)
Ashraf, M., Mohammad, G.: Quantum codes from cyclic codes over \( {\mathbb{F}}_q+u{\mathbb{F}}_q+v{\mathbb{F}}_q+ uv{\mathbb{F}}_q \). Quantum Inf. Process. 15, 4089–4098 (2016)
Gao, J., Wang, Y.: u-Constacyclic codes over \( {\mathbb{F}}_p+u{\mathbb{F}}_p \) and their applications of constructing new non-binary quantum codes. Quantum Inf. Process. (2018)
Liu, X., Liu, H.: Quantum codes from linear codes over finite chain rings. Quantum Inf. Process. https://doi.org/10.1007/s11128-017-1695-7 (2017)
Qian, J., Zhang, L.: Improved constructions for nonbinary quantum BCH codes. Int. J. Theor. Phys. 56, 1355–1363 (2017)
Tang, Y., Zhu, S., Kai, X., Ding, J.: New quantum codes from dual-containing cyclic codes over finite rings. Quantum Inf. process. 15(11), 4489–4500 (2016)
Norton, G.H., Salagean, A.: On the hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46, 1060–1067 (2000)
Artin, M.: Algebra, 2nd edn. Pearson Education, London (2011)
McDonald, B.R.: Finite Rings with Identity. Marcel Dekker, New York (1974)
Wan, Z.X.: Lectures on finite fields and galois rings. World Science Publishing, Singapore (2003)
Nadella, S., Klappenecker, A.: Stabilizer codes over Frobenius rings. In: Proceedings of IEEE Symposium and Information Theory (2012)
Norton, G.H., Salagean, A.: On the structure of linear and cyclic codes over a finite chain ring. Applicable Alg. Eng. Commun. Comput. 10 (2000)
Shankar, P.: On BCH codes over arbitrary integer rings. IEEE Trans. Inf. Theory 25 (1979)
Li, R., Zuo, F., Liu, Y., Xu, Z.: Hermitian dual-containing BCH codes and construction of new quantum codes. Quantum Inf. Comput. 12, 0021–0035 (2013)
Qian, J., Zhang, L.: Improved construction for nonbinary quantum BCH codes. Int. J. Theor. Phys. 56, 1355–1363 (2017)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work was supported in part by the National Natural Science Foundation of China (grant 61372072), and in part by the 111 Project(grant B08038).
Appendix
Appendix
1.1 Proof of Lemma 2
For two elements a + bx, c + dx in Qi, we have
and
Thus, σi is compatible with addition and multiplication in Qi. Moreover, one has σi(1) = 1. It follows that σi is a homomorphism from Qi to Qi. Since the kernel of σi is trivial, we conclude that Qi is an automorphism of Qi.
1.2 Proof of Lemma 3
For \( \mathbf{u},\mathbf{w},{\mathbf{u}}^{\prime}\in {Q}_i^n \), it is easy to verify that \( <\mathbf{u},\mathbf{w}{>}_{s_i}=-<\mathbf{w},\mathbf{u}{>}_{s_i} \). Then we know \( <\mathbf{u},\mathbf{u}{>}_{s_i}=-<\mathbf{u},\mathbf{u}{>}_{s_i} \) and \( <\mathbf{u},\mathbf{u}{>}_{s_i}=0 \). Furthermore, we have
which means the bilinearity holds. Hence, we can deduce that \( {\left\langle \kern1em ,\kern1em \right\rangle}_{s_i} \) is a symplectic form. On the other hand, if we ignore the scalar, the matrix of the form with respect to the standard symplectic basis is equivalent to \( \left(\begin{array}{ll}0& I\\ {}-I& 0\end{array}\right) \). It follows that the form \( {\left\langle \kern1em ,\kern1em \right\rangle}_{s_i} \) is non-degenerate. The claim holds.
1.3 Proof of Lemma 4
For two vectors a = (a1∣a2), \( \mathbf{b}=\left({\mathbf{b}}_1|{\mathbf{b}}_2\right)\in {R}_i^{2n} \), we have
and
Thus, it follows that \( {\left\langle \psi \left(\mathbf{a}\right)\kern1em ,\psi \left(\mathbf{b}\right)\right\rangle}_{s_i}=\left({\mathbf{a}}_2\cdot {\mathbf{b}}_1-{\mathbf{a}}_1\cdot {\mathbf{b}}_2\right)={\left\langle \mathbf{a}\kern1em ,\mathbf{b}\right\rangle}_a \).
1.4 Proof of Lemma 6
For a, b ∈ Q, we assume that \( \mu (a)=\left({a}_1,\dots, {a}_l\right),\kern1em \mu (b)=\left({b}_1,\dots, {b}_l\right) \), where ai, bi ∈ Qi for \( i=1,\dots, l \). Then
and
Therefore, σ is compatible with addition and multiplication in Q. Moreover, we have σ(1) = 1. It follows that σ is a homomorphism from Q to Q. Because the kernel of σ is trivial, we conclude that σ is an automorphism of Q.
1.5 Proof of Lemma 9
Suppose that u = a + bx, w = c + dx, where \( \mathbf{a},\mathbf{b},\mathbf{c},\mathbf{d}\in {R}_i^n \). If pi = 2, we have x2 = −x − 1 in Qi. There is
Therefore, if u ⋅ σi(w) equals 0, we must have b ⋅c −a ⋅d = 0, which is equivalent to \( {\left\langle \mathbf{u}\kern1em ,\mathbf{w}\right\rangle}_{s_i}=0 \) according to Lemma 4.
Conversely, if pi ≠ 2, we know that x2 = a in Qi. There is
Thus, if u ⋅ σi(w) equals 0, we must have b ⋅c −a ⋅d = 0, which is equivalent to \( {\left\langle \mathbf{u}\kern1em ,\mathbf{w}\right\rangle}_{s_i}=0 \) according to Lemma 4. This completes the proof.
Rights and permissions
About this article
Cite this article
Tang, N., Li, Z., Xing, L. et al. Quantum Cyclic Codes Over \( {\mathbb{Z}}_m \). Int J Theor Phys 58, 1088–1107 (2019). https://doi.org/10.1007/s10773-019-04000-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10773-019-04000-2