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/0206174 · Hindustan Book Agency

A Family of Quantum Stabilizer Codes Based on the Weyl Commutation Relations over a Finite Field

V. Arvind, Kalyanapuram Rangachari Parthasarathy

Published Jan 1, 2003• 15 citations
arXivHTMLPDF

Abstract

Using the Weyl commutation relations over a finite field F q $${\mathbb{F}_q}$$ we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over F q $${\mathbb{F}_q}$$ satisfying certain natural conditions. When q = 2 the existence of a rich class of such symmetric matrices is demonstrated by a simple probabilistic argument depending on the Chernoff bound for i.i.d. symmetric Bernoulli trials. If, in addition, these symmetric matrices are assumed to be circulant it is possible to obtain concrete examples by a computer program. The quantum codes thus obtained admit elegant encoding circuits.

DOI
10.1007/978-93-86279-11-8_12

Related papers

A Construction of Quantum Stabilizer Codes Based on Syndrome Assignment by Classical Parity-Check Matrices

Ching–Yi Lai, Chung-Chin Lu

In this paper, a new but simple construction of stabilizer codes and related entanglement-assisted quantum error-correcting codes is proposed based on syndrome assignment by classical parity-check matrices. This method turns the construction of quantum stabilizer codes to the construction of classical parity-check matrices satisfying a specific commutative condition. The designed minimum distance 2t*+1 of the constructed quantum stabilizer codes can be achieved by a commutative classical parity-check matrix with classical minimum distance 4t*-m, where the parameterm, 0 ≤m≤ 2t*, depends on a property of the parity-check matrix. Asmdecreases, there is an increasing set of additional correctable error operators beyond the designed error correcting capability t*. The (asymptotic) coding efficiency is at least comparable to that of CSS codes. A class of quantum Reed-Muller codes is constructed and codes in this class have a larger set of correctable error operators than that of the quantum Reed-Muller codes previously developed in the literature. Quantum circulant codes are also constructed and many of them are optimal in terms of their coding parameters.

arXiv:0712.0103•IEEE Transactions on Information Theory•Oct 1, 2011•14 citations

A class of quantum stabilizer codes based on classical convolutional codes

Xinmei Wang

A new class of quantum stabilizer codes is presented.The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding self-orthogonal codes over the Galois field GF(4) under a trace inner product.Based on this connection,the necessary and sufficient condition is proved under which classical convolutional codes over GF(4) are self-orthogonal with respect to the trace inner product,and then corresponding codes satisfying the condition are found.Tail-biting codes with a simple block structure are obtained by tail-biting transformation,which are self-orthogonal with respect to the trace inner product.Finally,relative quantum stabilizer codes are constructed.The code construction is simple,and the minimum distance of the code approaches the upper bound.

Journal of Xidian University•Jan 1, 2008•0 citations

Quantum Reed-Solomon Codes

Markus Grassl, Willi Geiselmann, Thomas Beth +1 more

. We introduce a new class of quantum error--correcting codes derived from (classical) Reed--Solomon codes over finite fields of characteristic two. Quantum circuits for encoding and decoding based on the discrete cyclic Fourier transform over finite fields are presented. 1 Introduction During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [18]) and finding pre--images of an n--ary Boolean function ("searching") in time O( p 2 n ) (see [12]). Quantum computers are not only of theoretical nature---there are several suggestions how to physically realize them (see, e. g., [6, 7]). On the way towards building a quantum computer, one very important problem is to stabilize quantum mechanical systems since they are very vulnerable. A theory of quantum error--correcting codes has already been established (see [15]). Nevertheless, the pr...

•Oct 15, 1999•75 citations

Nonbinary Stabilizer Codes Over Finite Fields

Avanti Ulhas Ketkar, Andreas Klappenecker, Santhosh Kumar +1 more

One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. To address this difficulty, many good quantum error-correcting codes have been derived as binary stabilizer codes. Fault-tolerant quantum computation prompted the study of nonbinary quantum codes, but the theory of such codes is not as advanced as that of binary quantum codes. This paper describes the basic theory of stabilizer codes over finite fields. The relation between stabilizer codes and general quantum codes is clarified by introducing a Galois theory for these objects. A characterization of nonbinary stabilizer codes over$bf F_q$in terms of classical codes over$ bf F_q^2$is provided that generalizes the well-known notion of additive codes over$ bf F_4$of the binary case. This paper also derives lower and upper bounds on the minimum distance of stabilizer codes, gives several code constructions, and derives numerous families of stabilizer codes, including quantum Hamming codes, quadratic residue codes, quantum Melas codes, quantum Bose–Chaudhuri–Hocquenghem (BCH) codes, and quantum character codes. The puncturing theory by Rains is generalized to additive codes that are not necessarily pure. Bounds on the maximal length of maximum distance separable stabilizer codes are given. A discussion of open problems concludes this paper.

arXiv:quant-ph/0508070•IEEE Transactions on Information Theory•Oct 30, 2006•659 citations

Families of Cyclic Codes over Finite Chain Rings

Andrew Nemec

A major difficulty in quantum computation and communication is preventing and correcting errors in the quantum bits. Most of the research in this area has focused on stabilizer codes derived from self-orthogonal cyclic error-correcting codes over finite fields. Our goal is to develop a similar theory for self-orthogonal cyclic codes over the class of finite chain rings which have been proven to also produce stabilizer codes. We also will discuss these restrictions on families of cyclic codes, including, but not limited to quadratic residue codes and Bose-Chaudhuri-Hocquenghem codes. Finally, we will extend the concepts of weight enumerators to the class of Frobenius rings and use them to derive bounds for our codes.

•Sep 29, 2015•0 citations

Stabilizer codes : encoding schemes and applications

Shiyu Shi

Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.

•Jan 1, 2016•0 citations
Using the Weyl commutation relations over a finite field F q Fq{\mathbb{F}_q}Fq​ we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over F q Fq{\mathbb{F}_q}Fq​ satisfying certain natural conditions. When q = 2 the existence of a rich class of such symmetric matrices is demonstrated by a simple probabilistic argument depending on the Chernoff bound for i.i.d. symmetric Bernoulli trials. If, in addition, these symmetric matrices are assumed to be circulant it is possible to obtain concrete examples by a computer program. The quantum codes thus obtained admit elegant encoding circuits.
In this paper, a new but simple construction of stabilizer codes and related entanglement-assisted quantum error-correcting codes is proposed based on syndrome assignment by classical parity-check matrices. This method turns the construction of quantum stabilizer codes to the construction of classical parity-check matrices satisfying a specific commutative condition. The designed minimum distance 2t*+1 of the constructed quantum stabilizer codes can be achieved by a commutative classical parity-check matrix with classical minimum distance 4t*-m, where the parameterm, 0 ≤m≤ 2t*, depends on a property of the parity-check matrix. Asmdecreases, there is an increasing set of additional correctable error operators beyond the designed error correcting capability t*. The (asymptotic) coding efficiency is at least comparable to that of CSS codes. A class of quantum Reed-Muller codes is constructed and codes in this class have a larger set of correctable error operators than that of the quantum Reed-Muller codes previously developed in the literature. Quantum circulant codes are also constructed and many of them are optimal in terms of their coding parameters.
A new class of quantum stabilizer codes is presented.The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding self-orthogonal codes over the Galois field GF(4) under a trace inner product.Based on this connection,the necessary and sufficient condition is proved under which classical convolutional codes over GF(4) are self-orthogonal with respect to the trace inner product,and then corresponding codes satisfying the condition are found.Tail-biting codes with a simple block structure are obtained by tail-biting transformation,which are self-orthogonal with respect to the trace inner product.Finally,relative quantum stabilizer codes are constructed.The code construction is simple,and the minimum distance of the code approaches the upper bound.
. We introduce a new class of quantum error--correcting codes derived from (classical) Reed--Solomon codes over finite fields of characteristic two. Quantum circuits for encoding and decoding based on the discrete cyclic Fourier transform over finite fields are presented. 1 Introduction During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [18]) and finding pre--images of an n--ary Boolean function ("searching") in time O( p 2 n ) (see [12]). Quantum computers are not only of theoretical nature---there are several suggestions how to physically realize them (see, e. g., [6, 7]). On the way towards building a quantum computer, one very important problem is to stabilize quantum mechanical systems since they are very vulnerable. A theory of quantum error--correcting codes has already been established (see [15]). Nevertheless, the pr...
One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. To address this difficulty, many good quantum error-correcting codes have been derived as binary stabilizer codes. Fault-tolerant quantum computation prompted the study of nonbinary quantum codes, but the theory of such codes is not as advanced as that of binary quantum codes. This paper describes the basic theory of stabilizer codes over finite fields. The relation between stabilizer codes and general quantum codes is clarified by introducing a Galois theory for these objects. A characterization of nonbinary stabilizer codes overbfFqbf F_qbfFq​in terms of classical codes over$ bf F_q^2isprovidedthatgeneralizesthewell−knownnotionofadditivecodesoveris provided that generalizes the well-known notion of additive codes overisprovidedthatgeneralizesthewell−knownnotionofadditivecodesover bf F_4$of the binary case. This paper also derives lower and upper bounds on the minimum distance of stabilizer codes, gives several code constructions, and derives numerous families of stabilizer codes, including quantum Hamming codes, quadratic residue codes, quantum Melas codes, quantum Bose–Chaudhuri–Hocquenghem (BCH) codes, and quantum character codes. The puncturing theory by Rains is generalized to additive codes that are not necessarily pure. Bounds on the maximal length of maximum distance separable stabilizer codes are given. A discussion of open problems concludes this paper.
A major difficulty in quantum computation and communication is preventing and correcting errors in the quantum bits. Most of the research in this area has focused on stabilizer codes derived from self-orthogonal cyclic error-correcting codes over finite fields. Our goal is to develop a similar theory for self-orthogonal cyclic codes over the class of finite chain rings which have been proven to also produce stabilizer codes. We also will discuss these restrictions on families of cyclic codes, including, but not limited to quadratic residue codes and Bose-Chaudhuri-Hocquenghem codes. Finally, we will extend the concepts of weight enumerators to the class of Frobenius rings and use them to derive bounds for our codes.
Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.