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:quant-ph/0312164 · International Journal of Quantum Information

ON OPTIMAL QUANTUM CODES

Markus Grassl, Thomas Beth, Martin Rötteler

Published Mar 1, 2004• 285 citations
arXivHTMLPDF

Abstract

We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary prime power. It is shown that codes with parameters 〚n, n - 2d + 2, d〛q exist for all 3≤n≤q and 1≤d≤n/2+1. We also present quantum MDS codes with parameters 〚q2, q2-2d+2, d〛q for 1≤d≤q which additionally give rise to shortened codes 〚q2-s, q2-2d+2-s, d〛q for some s.

DOI
10.1142/s0219749904000079

Related papers

Quantum Generalized Reed-Solomon codes

Zhuo Li, Lijuan Xing, 西安电子科技大学综合业务网国家重点实验室，西安 710071

We construct a family of quantum error-correcting codes with parameters ［［n，n-2k，k+1］］q which are defined in q-dimensional quantum systems，where q is an arbitrary prime power. These codes are optimal in the sense that the minimum distance is maximal. It is shown that codes exist for all n satisfying 2≤n≤q or q2-q+2≤n≤q2.

Acta Physica Sinica•Jan 1, 2008•13 citations

On quantum MDS codes

Martin Rötteler, Markus Grassl, T. Beth

We construct maximum distance separable quantum error-correcting codes. The codes are defined over q-dimensional quantum systems, where q is any prime power. The construction yields quantum MDS codes of length up to q+1 for all possible dimensions and some quantum MDS codes of length up to q2+1. In particular, those families contain codes [[6,2,3]]pand [[7,3,3]]pfor pges3 (cf. [K. Feng (2002)])

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•55 citations

Quantum MDS codes over small fields

Markus Grassl, Martin Roetteler

We consider quantum MDS (QMDS) codes for quantum systems of dimension q with lengths up to q2+ 2 and minimum distances up to q + 1. We show how starting from QMDS codes of length q2+ 1 based on cyclic and constacyclic codes, new QMDS codes can be obtained by shortening. We provide numerical evidence for our conjecture that almost all admissible lengths, from a lower bound n0(q, d) on, are achievable by shortening. Some additional codes that fill gaps in the list of achievable lengths are presented as well along with a construction of a family of QMDS codes of length q2+2, where q = 2m, that appears to be new.

arXiv:1502.05267•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•79 citations

Some families of optimal quantum codes derived from constacyclic codes

Jian‐Zhang Chen, Yuanyuan Huang, Chunhui Feng +1 more

Quantum maximum-distance-separable (MDS) codes form an important family of quantum codes. Quantum MDS codes are optimal, which can attain the quantum Singleton bound. In this paper, using some classes of constacyclic codes and Hermitian constructions, we propose the constructions of optimal quantum convolutional codes and optimal asymmetric quantum codes in the sense of the quantum Singleton bound. Compared with the codes obtained in the literature, the parameters of the constructed quantum codes are new as well as the distance dz of optimal asymmetric quantum codes [[n,k,dz/dx]]q2 constructed in this paper is larger.

Linear and Multilinear Algebra•Feb 5, 2018•8 citations

New Quantum MDS Codes From Negacyclic Codes

Xiaoshan Kai, Shixin Zhu

Letqbe an odd prime power. Based on classical negacyclic codes, we construct two classes of quantum maximum-distance-separable (MDS) codes with parameters [[q2+1,q2-2d+3,d]]qwhereq≡ 1 (mod 4) and 2 ≤d≤q+1 is even, and [[(q2+1)/2,(q2+1)/2-2d+2,d]]qwhere 3 ≤d≤qis odd. Some of these quantum MDS codes are new in the sense that their parameters are different from all the previously known ones.

IEEE Transactions on Information Theory•Sep 24, 2012•183 citations

New quantum MDS codes

Guanghui Zhang, Bocong Chen

In this paper, we construct two classes of new quantum maximum-distance-separable (MDS) codes with parameters [Formula: see text], where q is an odd prime power with q ≡ 3 (mod 4) and [Formula: see text]; [[8(q - 1), 8(q - 1) - 2d + 2, d]]q, where q is an odd prime power with the form q = 8t - 1 (t is an even positive integer) and [Formula: see text]. Comparing the parameters with all known quantum MDS codes, the quantum MDS codes exhibited here have minimum distances bigger than the ones available in the literature.

International Journal of Quantum Information•Jun 1, 2014•43 citations
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary prime power. It is shown that codes with parameters 〚n, n - 2d + 2, d〛q exist for all 3≤n≤q and 1≤d≤n/2+1. We also present quantum MDS codes with parameters 〚q2, q2-2d+2, d〛q for 1≤d≤q which additionally give rise to shortened codes 〚q2-s, q2-2d+2-s, d〛q for some s.
We consider quantum MDS (QMDS) codes for quantum systems of dimension q with lengths up to q2+ 2 and minimum distances up to q + 1. We show how starting from QMDS codes of length q2+ 1 based on cyclic and constacyclic codes, new QMDS codes can be obtained by shortening. We provide numerical evidence for our conjecture that almost all admissible lengths, from a lower bound n0(q, d) on, are achievable by shortening. Some additional codes that fill gaps in the list of achievable lengths are presented as well along with a construction of a family of QMDS codes of length q2+2, where q = 2m, that appears to be new.
Quantum maximum-distance-separable (MDS) codes form an important family of quantum codes. Quantum MDS codes are optimal, which can attain the quantum Singleton bound. In this paper, using some classes of constacyclic codes and Hermitian constructions, we propose the constructions of optimal quantum convolutional codes and optimal asymmetric quantum codes in the sense of the quantum Singleton bound. Compared with the codes obtained in the literature, the parameters of the constructed quantum codes are new as well as the distance dz of optimal asymmetric quantum codes [[n,k,dz/dx]]q2 constructed in this paper is larger.
In this paper, we construct two classes of new quantum maximum-distance-separable (MDS) codes with parameters [Formula: see text], where q is an odd prime power with q ≡ 3 (mod 4) and [Formula: see text]; [[8(q - 1), 8(q - 1) - 2d + 2, d]]q, where q is an odd prime power with the form q = 8t - 1 (t is an even positive integer) and [Formula: see text]. Comparing the parameters with all known quantum MDS codes, the quantum MDS codes exhibited here have minimum distances bigger than the ones available in the literature.