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

Journal of Applied Mathematics and Computing

Quantum codes from trace codes

Pavan Kumar, Noor Mohammad Khan

Published Oct 23, 2022• 0 citations
Publisher
DOI
10.1007/s12190-022-01801-3

Related papers

Quantum codes from one-point codes on norm-trace curves

Boran Kim

Cryptography and Communications•May 14, 2022•3 citations

Constructing quantum codes

Hao Chen

Frontiers of Computer Science in China•Jun 1, 2008•0 citations

Quaternary conjucyclic codes with an application to EAQEC codes

Md Ajaharul Hossain, Ramakrishna Bandi

Conjucyclic codes are part of a family of codes that includes cyclic, constacyclic, and quasi-cyclic codes, among others. Despite their importance in quantum error correction, they have not received much attention in the literature. This paper focuses on additive conjucyclic (ACC) codes over $ \mathbb{F}_4 $ and investigates their properties. Specifically, we derive the duals of ACC codes by using a trace inner product and obtain the trace hull and its dimension. Also, we establish a necessary and sufficient condition for an additive code to have a complementary dual (ACD). Additionally, we identify a necessary condition for an additive conjucyclic complementary pair of codes over $ \mathbb{F}_4 $. Furthermore, we show that the trace code of an ACC code is cyclic and provide a condition for the trace code of an ACC code to be LCD. To demonstrate the practical application of our findings, we construct some good entanglement-assisted quantum error-correcting (EAQEC) codes using the trace code of ACC codes.

arXiv:2309.01983•Advances in Mathematics of Communications•Mar 5, 2024•1 citation

Classical and quantum codes

Alexei Kitaev, Alexander Khanievich Shen', M. Vyalyi

Graduate studies in mathematics•May 31, 2002•12 citations

Stabilizer quantum codes defined by trace-depending polynomials

Carlos Galindo, Fernando Hernando, Helena Martín-Cruz +1 more

Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace [18]. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a constant plus the trace of a polynomial) and show that this procedure gives rise to stabilizer quantum error-correcting codes with a wider range of lengths than in [18] and with excellent parameters. Namely, we are able to provide new binary records according to [21] and non-binary codes improving the ones available in the literature.

arXiv:2208.06187•Finite Fields and Their Applications•Dec 29, 2022•3 citations

Quantum Codes and Computation

Sankalpa Khadka

•Jan 1, 2012•0 citations
Conjucyclic codes are part of a family of codes that includes cyclic, constacyclic, and quasi-cyclic codes, among others. Despite their importance in quantum error correction, they have not received much attention in the literature. This paper focuses on additive conjucyclic (ACC) codes over $ \mathbb{F}_4 $ and investigates their properties. Specifically, we derive the duals of ACC codes by using a trace inner product and obtain the trace hull and its dimension. Also, we establish a necessary and sufficient condition for an additive code to have a complementary dual (ACD). Additionally, we identify a necessary condition for an additive conjucyclic complementary pair of codes over $ \mathbb{F}_4 $. Furthermore, we show that the trace code of an ACC code is cyclic and provide a condition for the trace code of an ACC code to be LCD. To demonstrate the practical application of our findings, we construct some good entanglement-assisted quantum error-correcting (EAQEC) codes using the trace code of ACC codes.
Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace [18]. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a constant plus the trace of a polynomial) and show that this procedure gives rise to stabilizer quantum error-correcting codes with a wider range of lengths than in [18] and with excellent parameters. Namely, we are able to provide new binary records according to [21] and non-binary codes improving the ones available in the literature.