Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1003.3754 · Quantum Information and Computation

Quantum codes from codes over Gaussian integers with respect to the Mannheim metric

Mehmet Özen, Murat Güzeltepe

Published Sep 1, 2012• 12 citations
arXivHTMLPDF

Abstract

In this paper, some nonbinary quantum codes using classical codes over Gaussian integers are obtained. Also, some of our quantum codes are better than or comparable with those known before, (for instance $[[8,2,5]]_{4+i}$).

DOI
10.26421/qic12.9-10-6

Related papers

Nonbinary quantum stabilizer codes from codes over Gaussian integers with respect to the Mannheim metric

Murat Güzeltepe, Mehmet Özen

•Jan 1, 2010•0 citations

NONBINARY QUANTUM CODES DERIVED FROM GROUP CHARACTER CODES

Jianfa Qian, Lina Zhang

Most of quantum codes have been constructed by using classical linear codes over finite field. However, little is known about the construction of quantum codes via group character codes. In this work, we present the constructions of nonbinary quantum and asymmetric quantum codes based on group character codes, and give explicit parameters for infinite families of nonbinary quantum codes and asymmetric quantum codes. Furthermore, we present families of optimal quantum codes which derived from group character codes.

International Journal of Quantum Information•Jun 1, 2012•10 citations

Graphical nonbinary quantum error-correcting codes

Dan Mei Hu, Weidong Tang, Meisheng Zhao +3 more

In this paper, we present a systematic way based on the nonbinary graph state of constructing good nonbinary quantum codes, both additive and nonadditive, for systems with integer dimensions. With a computer search, which results in many interesting codes including some nonadditive codes meeting the Singleton bounds, we are able to construct explicitly four families of optimal codes, namely, ${[[6,2,3]]}_{p}$, ${[[7,3,3]]}_{p}$, ${[[8,2,4]]}_{p}$, and ${[[8,4,3]]}_{p}$ for any odd dimension $\mathit{p}$ and a family of nonadditive codes ${((5,p,3))}_{p}$ for arbitrary $p>3$. In the case of composite numbers as dimensions, we also construct a family of stabilizer codes ${((6,2{p}^{2},3))}_{2p}$ for odd $\mathit{p}$, whose coding subspace is not of a dimension that is a power of the dimension of the physical subsystem.

arXiv:0801.0831•Physical Review A•Jul 3, 2008•77 citations

Quantum negacyclic codes

Xiaoshan Kai, Shixin Zhu, Yongsheng Tang

In this paper, we construct families of nonbinary quantum codes from classical negacyclic codes. The BCH bound for negacyclic codes is applied to determine the dimension and distance of these quantum codes. The parameters of these quantum codes are good compared with the ones available in the literature. We also construct a family of quantum maximum-distance-separable codes with parameters ${[[q+1,q\ensuremath{-}2d+3,d]]}_{q}$, where $q\ensuremath{\equiv}1\phantom{\rule{0.28em}{0ex}}\mathrm{mod}\phantom{\rule{0.28em}{0ex}}4$ and $2\ensuremath{\le}d\ensuremath{\le}(q+3)/2$.

Physical Review A•Jul 24, 2013•46 citations

New quantum codes derived from the images of constacyclic codes

Liqi Wang, Xiu‐Jing Zheng, Shixin Zhu

Assume that $q$ is a prime power and $m\geq 2$ is a positive integer. Cyclic codes over $\mathbb{F}_{q^{2m}}$ of length $n=\frac{q^{2m}-1}{\rho }$ with $\rho\mid (q-1)$, and constacyclic codes over $\mathbb{F}_{q^{2m}}$ of length $n=\frac{q^{2m}-1}{\rho }$ with $\rho\mid (q+1)$ are considered in this paper, respectively. Two classes of quantum codes are derived from the images of these codes by the Hermitian construction. Compared with the previously known quantum codes, the quantum codes in our scheme have better parameters.

Quantum Information and Computation•Jan 1, 2023•1 citation

Constructions of new families of nonbinary quantum codes

Giuliano G. La Guardia

Three code constructions generating new families of good nonbinary quantum codes are presented in this paper. The first two ones are derived from Hermitian self-orthogonal non-narrow-sense Bose-Chaudhuri-Hocquenghem (BCH) codes. The third one is derived from $q$-ary ($q\ensuremath{\ne}2$ is a prime power) Steane's enlargement of Calderbank-Shor-Steane codes applied to Euclidean self-orthogonal non-narrow-sense BCH codes. The quantum nonbinary BCH codes presented here have parameters better than the ones available in the literature.

Physical Review A•Oct 28, 2009•97 citations
In this paper, some nonbinary quantum codes using classical codes over Gaussian integers are obtained. Also, some of our quantum codes are better than or comparable with those known before, (for instance [[8,2,5]]4+i[[8,2,5]]_{4+i}[[8,2,5]]4+i​).
Most of quantum codes have been constructed by using classical linear codes over finite field. However, little is known about the construction of quantum codes via group character codes. In this work, we present the constructions of nonbinary quantum and asymmetric quantum codes based on group character codes, and give explicit parameters for infinite families of nonbinary quantum codes and asymmetric quantum codes. Furthermore, we present families of optimal quantum codes which derived from group character codes.
In this paper, we present a systematic way based on the nonbinary graph state of constructing good nonbinary quantum codes, both additive and nonadditive, for systems with integer dimensions. With a computer search, which results in many interesting codes including some nonadditive codes meeting the Singleton bounds, we are able to construct explicitly four families of optimal codes, namely, [[6,2,3]]p{[[6,2,3]]}_{p}[[6,2,3]]p​, [[7,3,3]]p{[[7,3,3]]}_{p}[[7,3,3]]p​, [[8,2,4]]p{[[8,2,4]]}_{p}[[8,2,4]]p​, and [[8,4,3]]p{[[8,4,3]]}_{p}[[8,4,3]]p​ for any odd dimension p\mathit{p}p and a family of nonadditive codes ((5,p,3))p{((5,p,3))}_{p}((5,p,3))p​ for arbitrary p>3p>3p>3. In the case of composite numbers as dimensions, we also construct a family of stabilizer codes ((6,2p2,3))2p{((6,2{p}^{2},3))}_{2p}((6,2p2,3))2p​ for odd p\mathit{p}p, whose coding subspace is not of a dimension that is a power of the dimension of the physical subsystem.
In this paper, we construct families of nonbinary quantum codes from classical negacyclic codes. The BCH bound for negacyclic codes is applied to determine the dimension and distance of these quantum codes. The parameters of these quantum codes are good compared with the ones available in the literature. We also construct a family of quantum maximum-distance-separable codes with parameters ${[[q+1,q\ensuremath{-}2d+3,d]]}_{q}$, where $q\ensuremath{\equiv}1\phantom{\rule{0.28em}{0ex}}\mathrm{mod}\phantom{\rule{0.28em}{0ex}}4$ and $2\ensuremath{\le}d\ensuremath{\le}(q+3)/2$.
Assume that qqq is a prime power and m≥2m\geq 2m≥2 is a positive integer. Cyclic codes over Fq2m\mathbb{F}_{q^{2m}}Fq2m​ of length n=q2m−1ρn=\frac{q^{2m}-1}{\rho }n=ρq2m−1​ with ρ∣(q−1)\rho\mid (q-1)ρ∣(q−1), and constacyclic codes over Fq2m\mathbb{F}_{q^{2m}}Fq2m​ of length n=q2m−1ρn=\frac{q^{2m}-1}{\rho }n=ρq2m−1​ with ρ∣(q+1)\rho\mid (q+1)ρ∣(q+1) are considered in this paper, respectively. Two classes of quantum codes are derived from the images of these codes by the Hermitian construction. Compared with the previously known quantum codes, the quantum codes in our scheme have better parameters.
Three code constructions generating new families of good nonbinary quantum codes are presented in this paper. The first two ones are derived from Hermitian self-orthogonal non-narrow-sense Bose-Chaudhuri-Hocquenghem (BCH) codes. The third one is derived from qqq-ary ($q\ensuremath{\ne}2$ is a prime power) Steane's enlargement of Calderbank-Shor-Steane codes applied to Euclidean self-orthogonal non-narrow-sense BCH codes. The quantum nonbinary BCH codes presented here have parameters better than the ones available in the literature.