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

International Conference on the Frontiers and Advances in Data Science (FADS)

A quantum stabilizer code associated with cluster states

Dan Song, Zhengwen Cao, Shuanghao Zhang, Jie Feng, Yan Li, Geng Chai

Published Oct 1, 2017• 2 citations
Publisher

Abstract

We present a construction scheme for quantum error-correcting code of cluster states, which is a similar method of splicing stepwise as the Toric code. The stabilizer codes space can be founded by a Hamiltonian, which is constructed with a finite abelian group. A principal code space is set up by the entanglement among cluster state particles. Then a complete stabilizer code matrix can be found by supplement of computing analysis which satisfies the error-correcting conditions. This allows a simple verification for 1 - error correcting property in any dimension. Furthermore, we can obtain a suitable quantum stabilizer code.

DOI
10.1109/fads.2017.8253204

Related papers

Quantum error-correcting codes associated with graphs

Dirk-M. Schlingemann, Reinhard F. Werner

We present a construction for quantum error correcting codes. The basic ingredients are a graph and a finite Abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors. This allows a simple verification of the one-error correcting property of codes of length 5 in any dimension. As examples, we construct a large class of maximum distance separable codes, i.e. codes saturating the Singleton bound, as well as a code of length 10 detecting three errors.

arXiv:quant-ph/0012111•Physical Review A•Dec 11, 2001•423 citations

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

Quantum error correcting codes: From stabilizer codes to induced codes

Edward A. Loeb

The first large class of quantum error-correcting codes that was constructed is the class of stabilizer codes. The construction method used for these codes is based on finding abelian subgroups of general Pauli groups. Stabilizer codes are a special case of a more general class of quantum error-correcting codes---Clifford codes. The construction technique for Clifford codes generalizes the stabilizer code construction by introducing abstract error groups. Abstract error groups generalize the Pauli groups so that codes can be constructed for quantum systems with any dimension. Clifford codes are thus constructed by finding normal subgroups of abstract error groups. In this dissertation we show that Clifford codes are a special case of a larger class of codes, which we refer to as induced codes. In addition to this new construction method, we also present some new results pertaining to a subclass of stabilizer codes called degenerate stabilizer codes.

•Jan 1, 2006•0 citations

A Theory of the Quantum Error-Correcting Codes

Fang Li

Quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error correcting codes has some close ties to and some striking differences from the theory of classical error correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, Clifford codes are stabilizer codes.

Journalof Southwest China Normal University•Jan 1, 2001•18 citations

An Introduction to Quantum Error Correction

Daniel Gottesman

Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements.

arXiv:quant-ph/0004072•Apr 18, 2000•103 citations

A Novel Construction of Quantum Stabilizer Codes

Shengmei Zhao

Quantum error correcting code is an efficient tool to correct and prevent quantum error.It is the basic for quantum computation and quantum communications.Taking advantage of the cyclic difference set,we present a novel approach to construct quantum stabilizer codes in this paper.It's not difficult to construct the well-known quantum code by our approach.By analyzing the property of the quantum code constructed by this method,such as ,as well as ,we find all the constructed codes are the quantum Single-bound codes,and we can use this method to encode different length information.Besides,the code rate is high.

Journal of Nanjing University of Posts and Telecommunications•Jan 1, 2011•0 citations
We present a construction scheme for quantum error-correcting code of cluster states, which is a similar method of splicing stepwise as the Toric code. The stabilizer codes space can be founded by a Hamiltonian, which is constructed with a finite abelian group. A principal code space is set up by the entanglement among cluster state particles. Then a complete stabilizer code matrix can be found by supplement of computing analysis which satisfies the error-correcting conditions. This allows a simple verification for 1 - error correcting property in any dimension. Furthermore, we can obtain a suitable quantum stabilizer code.
We present a construction for quantum error correcting codes. The basic ingredients are a graph and a finite Abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors. This allows a simple verification of the one-error correcting property of codes of length 5 in any dimension. As examples, we construct a large class of maximum distance separable codes, i.e. codes saturating the Singleton bound, as well as a code of length 10 detecting three errors.
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.
The first large class of quantum error-correcting codes that was constructed is the class of stabilizer codes. The construction method used for these codes is based on finding abelian subgroups of general Pauli groups. Stabilizer codes are a special case of a more general class of quantum error-correcting codes---Clifford codes. The construction technique for Clifford codes generalizes the stabilizer code construction by introducing abstract error groups. Abstract error groups generalize the Pauli groups so that codes can be constructed for quantum systems with any dimension. Clifford codes are thus constructed by finding normal subgroups of abstract error groups. In this dissertation we show that Clifford codes are a special case of a larger class of codes, which we refer to as induced codes. In addition to this new construction method, we also present some new results pertaining to a subclass of stabilizer codes called degenerate stabilizer codes.
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements.
Quantum error correcting code is an efficient tool to correct and prevent quantum error.It is the basic for quantum computation and quantum communications.Taking advantage of the cyclic difference set,we present a novel approach to construct quantum stabilizer codes in this paper.It's not difficult to construct the well-known quantum code by our approach.By analyzing the property of the quantum code constructed by this method,such as ,as well as ,we find all the constructed codes are the quantum Single-bound codes,and we can use this method to encode different length information.Besides,the code rate is high.