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:1312.6064

Extending Construction X for Quantum Error-Correcting Codes

Akshay Degwekar, Kenza Guenda, Thomas Aaron Gulliver

Published Dec 20, 2013• 1 citation
arXivHTMLPDF

Abstract

In this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order $p^2^ where p is prime. The results obtained are applied to the dual of Hermitian repeated root cyclic codes to generate new quantum error-correcting codes.
DOI
10.48550/arxiv.1312.6064

Related papers

Elementary Constructions of Best Known Quantum Codes

Tran, Long, Nguyen, Trang, Aydin, Nuh

Building large-scale quantum computers is a very active area of research. A critical part of this effort is the ability to control quantum errors. Recently, many good quantum error correcting codes (QECC) over various finite fields Fq have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from classical codes, including cyclic, constacyclic, quasicyclic (QC), quasi-twisted (QT), and polycyclic codes using the CSS construction, Hermitian construction, and Lisonek-Singh methods. We believe direct and more elementary methods should be preferred.

•Jul 1, 2024•0 citations

QUANTUM CODES FROM CYCLIC CODES OVER FINITE RING

Jianfa Qian, Wenping Ma, Wangmei Guo

A new method to obtain self-orthogonal codes over finite field F2 is presented. Based on this method, we provide a construction for quantum error-correcting codes starting from cyclic codes over finite ring R = F2 + uF2. As an example, we present infinite families of quantum error-correcting codes which are derived from cyclic codes over the ring R = F2 + uF2.

International Journal of Quantum Information•Sep 1, 2009•90 citations

Constructing Quantum Error-Correcting Codes for pm-State System from Classical Error-Correcting Codes

Ryutaroh Matsumoto, Tomohiko Uyematsu

Quantum error-correcting codes have attracted much attention. Among many research articles, the most general and systematic construction is the so called stabilizer code construction [6] or additive code construction [2], which constructs a quantum error-correcting code as an eigenspace of an Abelian subgroup S of the error group. Thereafter Calderbank et al. [3] proposed a construction of S from an additive code over the finite field F4 with 4 elements. These constructions work for tensor products of 2-state quantum systems. However Knill [8], [9] and Rains [13] observed that the construction [2], [6] can be generalized to n-state systems by an appropriate choice of the error basis. Rains [13] also generalized the construction [3] using additive codes over F4 to p-state quantum systems, but his generalization does not relate the problem of quantum code construction to classical error-correcting codes. We propose a construction of quantum error-correcting codes for p-state systems from classical error-correcting codes which is a generalization of [3]. Throughout this paper, p denotes a prime number andm a positive integer. This paper is organized as follows. In Sect. 2, we review the construction of quantum codes for nonbinary systems. In Sect. 3, we propose a construction of quantum codes for p-state systems from classical codes over Fp2 . In Sect. 4, we propose a construction of quantum codes for p-state systems from classical linear codes over Fp2m . In Sect. 5, we discuss a

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 25, 2000•26 citations

Constructing Quantum Error-correcting Codes by Introducing Representation Number

Sun Guang-ren

In this paper,we generalize the notion of representation number over binary field to finite fields with arbitrary positive characteristic,simultaneously compute corresponding maximum representation number and construct quantum error-correcting codes of general positive characteristic.

Journal of Anqing Teachers College•Jan 1, 2007•0 citations

Quantum codes constructed from cyclic codes over the ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q$

Djoko Suprijanto, Hopein Christofen Tang

In this article, we investigate properties of cyclic codes over a finite non-chain ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,$ where $q=p^r,$ $r$ is a positive integer, $p$ is an odd prime, $4 \mid (p-1),$ and $v^5=v.$ As an application, we construct several quantum error correcting codes over the finite field $\mathbb{F}_q.$

arXiv:2112.13488•Dec 27, 2021•0 citations

ON QUANTUM CODES CONSTRUCTION FROM CONSTACYCLIC CODES OVER THE RING I_q[u,v] / <u^2-a^2, v^2-a^2, uv-vu>

Shakir Ali, Pushpendra Sharma

This paper focuses on studying the properties of constacyclic codes, quantum error-correcting codes. The code is studied over a specific mathematical structure called the ring $\mathfrak{S}$, which is defined as $\mathfrak{S}=\mathfrak{I}_q[\mathfrak{u},\mathfrak{v}]/\langle \mathfrak{u}^2-\alpha^2,~ \mathfrak{v}^2-\alpha^2,~\mathfrak{u}\mathfrak{v}-\mathfrak{v}\mathfrak{u} \rangle$, where $\mathfrak{I}_q$ is a finite field of $q$ elements, $\alpha$ be the nonzero elements of the field $\mathfrak{I}_q$ and $q$ is a power of an odd prime $p$ such that $q=p^m, ~\textup{for}~ m \ge 1$. The paper also introduces a Gray map and use it to decompose constacyclic codes over the ring $\mathfrak{S}$ into a direct sum of constacyclic codes over $\mathfrak{I}_q$. We construct new and better quantum error-correcting codes over the ring $\mathfrak{S}$ (cf.; Table 1 and Table 2). Moreover, we also obtain best known linear codes as well as best dimension linear codes (cf.; Table 4).

Journal of the Indonesian Mathematical Society•Aug 21, 2024•0 citations
Building large-scale quantum computers is a very active area of research. A critical part of this effort is the ability to control quantum errors. Recently, many good quantum error correcting codes (QECC) over various finite fields Fq have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from classical codes, including cyclic, constacyclic, quasicyclic (QC), quasi-twisted (QT), and polycyclic codes using the CSS construction, Hermitian construction, and Lisonek-Singh methods. We believe direct and more elementary methods should be preferred.
Quantum error-correcting codes have attracted much attention. Among many research articles, the most general and systematic construction is the so called stabilizer code construction [6] or additive code construction [2], which constructs a quantum error-correcting code as an eigenspace of an Abelian subgroup S of the error group. Thereafter Calderbank et al. [3] proposed a construction of S from an additive code over the finite field F4 with 4 elements. These constructions work for tensor products of 2-state quantum systems. However Knill [8], [9] and Rains [13] observed that the construction [2], [6] can be generalized to n-state systems by an appropriate choice of the error basis. Rains [13] also generalized the construction [3] using additive codes over F4 to p-state quantum systems, but his generalization does not relate the problem of quantum code construction to classical error-correcting codes. We propose a construction of quantum error-correcting codes for p-state systems from classical error-correcting codes which is a generalization of [3]. Throughout this paper, p denotes a prime number andm a positive integer. This paper is organized as follows. In Sect. 2, we review the construction of quantum codes for nonbinary systems. In Sect. 3, we propose a construction of quantum codes for p-state systems from classical codes over Fp2 . In Sect. 4, we propose a construction of quantum codes for p-state systems from classical linear codes over Fp2m . In Sect. 5, we discuss a
Quantum codes constructed from cyclic codes over the ring Fq+vFq+v2Fq+v3Fq+v4Fq\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_qFq​+vFq​+v2Fq​+v3Fq​+v4Fq​
In this article, we investigate properties of cyclic codes over a finite non-chain ring Fq+vFq+v2Fq+v3Fq+v4Fq,\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,Fq​+vFq​+v2Fq​+v3Fq​+v4Fq​, where q=pr,q=p^r,q=pr, rrr is a positive integer, ppp is an odd prime, 4∣(p−1),4 \mid (p-1),4∣(p−1), and v5=v.v^5=v.v5=v. As an application, we construct several quantum error correcting codes over the finite field Fq.\mathbb{F}_q.Fq​.
This paper focuses on studying the properties of constacyclic codes, quantum error-correcting codes. The code is studied over a specific mathematical structure called the ring S\mathfrak{S}S, which is defined as S=Iq[u,v]/⟨u2−α2, v2−α2, uv−vu⟩\mathfrak{S}=\mathfrak{I}_q[\mathfrak{u},\mathfrak{v}]/\langle \mathfrak{u}^2-\alpha^2,~ \mathfrak{v}^2-\alpha^2,~\mathfrak{u}\mathfrak{v}-\mathfrak{v}\mathfrak{u} \rangleS=Iq​[u,v]/⟨u2−α2, v2−α2, uv−vu⟩, where Iq\mathfrak{I}_qIq​ is a finite field of qqq elements, α\alphaα be the nonzero elements of the field Iq\mathfrak{I}_qIq​ and qqq is a power of an odd prime ppp such that q=pm, for m≥1q=p^m, ~\textup{for}~ m \ge 1q=pm, for m≥1. The paper also introduces a Gray map and use it to decompose constacyclic codes over the ring S\mathfrak{S}S into a direct sum of constacyclic codes over Iq\mathfrak{I}_qIq​. We construct new and better quantum error-correcting codes over the ring S\mathfrak{S}S (cf.; Table 1 and Table 2). Moreover, we also obtain best known linear codes as well as best dimension linear codes (cf.; Table 4).