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

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

Murat Güzeltepe, Mehmet Özen

Published Jan 1, 2010• 0 citations
OpenAlex

Related papers

A Construction of Optimal Nonbinary Pure Quantum Stabilizer Codes

Sujuan Huang, Zhonghua Sun, Shixin Zhu

International Journal of Theoretical Physics•Apr 1, 2022•0 citations

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

Mehmet Özen, Murat Güzeltepe

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}$).

arXiv:1003.3754•Quantum Information and Computation•Sep 1, 2012•12 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

Nonbinary quantum codes derived from finite geometries

David Clark, Vladimir D. Tonchev

Finite Fields and Their Applications•Jul 5, 2011•2 citations

Code constructions and code families for nonbinary quantum stabilizer code

Avanti Ulhas Ketkar

Stabilizer codes form a special class of quantum error correcting codes. Nonbinary quantum stabilizer codes are studied in this thesis. A lot of work on binary quantum stabilizer codes has been done. Nonbinary stabilizer codes have received much less attention. Various results on binary stabilizer codes such as various code families and general code constructions are generalized to the nonbinary case in this thesis. The lower bound on the minimum distance of a code is nothing but the minimum distance of the currently best known code. The focus of this research is to improve the lower bounds on this minimum distance. To achieve this goal, various existing quantum codes are studied that have good minimum distance. Some new families of nonbinary stabilizer codes such as quantum BCH codes are constructed. Different ways of constructing new codes from the existing ones are also found. All these constructions together help improve the lower bounds.

•Nov 1, 2005•0 citations

Nonbinary Quantum Codes from Hermitian Curves

Pradeep Kiran Sarvepalli, Andreas Klappenecker

Lecture notes in computer science•Jan 1, 2006•8 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​).
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.
Stabilizer codes form a special class of quantum error correcting codes. Nonbinary quantum stabilizer codes are studied in this thesis. A lot of work on binary quantum stabilizer codes has been done. Nonbinary stabilizer codes have received much less attention. Various results on binary stabilizer codes such as various code families and general code constructions are generalized to the nonbinary case in this thesis. The lower bound on the minimum distance of a code is nothing but the minimum distance of the currently best known code. The focus of this research is to improve the lower bounds on this minimum distance. To achieve this goal, various existing quantum codes are studied that have good minimum distance. Some new families of nonbinary stabilizer codes such as quantum BCH codes are constructed. Different ways of constructing new codes from the existing ones are also found. All these constructions together help improve the lower bounds.