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

QUANTUM ERROR CORRECTION MELALUI CODE ATAS GF(4)

Adryan Wiradinata, Al. Sutjijana

Published Jan 1, 2020• 0 citations
OpenAlex

Abstract

Permasalahan mengkonstruksi quantum error correcting code dibawa ke permasalahan mencari kode aditif atas GF(4) yang self orthogonal terhadap suatu hasil kali dalam trace. The problem of finding quantum-error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product.

Related papers

Quantum error correction via codes over GF(4)

A.R. Calderbank, Eric M. Rains, Peter W. Shor +1 more

The problem of finding quantum error correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.

IEEE Transactions on Information Theory•Jul 1, 1998•1,748 citations

Quantum Error Correction via Codes over GF(4)

A.R. Calderbank, Eric M. Rains, Peter W. Shor +1 more

The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.

arXiv:quant-ph/9608006•Aug 6, 1996•6 citations

Quantum error correction via codes over GF(4)

A.R. Calderbank, Eric M. Rains, Peter W. Shor +1 more

The unreasonable effectiveness of quantum computing is founded on coherent quantum superposition or entanglement which allows a large number of calculations to be performed simultaneously. This coherence is lost as a quantum system interacts with its environment. In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.

IEEE International Symposium on Information Theory (ISIT)•Nov 22, 2002•34 citations

A construction method for a family of quantum cyclic codes

Xinmei Wang

The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding classical self-orthogonal linear codes over the Galois field GF(4) under a Hermitian inner product.A classical cyclic code over the field GF(4) is self-orthogonal with respect to the Hermitian inner product iff the generator polynomial of its dual code is a factor of its generator polynomial.Based on this connection,a class of quantum cyclic codes is constructed by finding corresponding classical cyclic codes.Some examples are also given in detail.

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

Quantum error correction via codes over GF(2)

Arijit Chowdhury, Balaji Sundar Rajan

It is well known that n-length stabilizer quantum error correcting codes (QECCs) can be obtained via n-length classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 3n-length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•15 citations

Quantum constacyclic 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 additive self-orthogonal codes over the Galois field GF(4) under a trace inner product.Based on this connection,one method for constructing quantum constacyclic codes is presented by finding self-orthogonal classical constacyclic codes over the field GF(4) under a trace inner product.Finally,some examples are given.As an application of this method,quantum Hamming codes are constructed.This class of quantum codes includes well-known quantum cyclic codes.

Journal of Xidian University•Jan 1, 2009•0 citations
Permasalahan mengkonstruksi quantum error correcting code dibawa ke
permasalahan mencari kode aditif atas GF(4) yang self orthogonal terhadap suatu
hasil kali dalam trace.
The problem of finding quantum-error-correcting codes is transformed into
the problem of finding additive codes over the field GF(4) which are self-orthogonal
with respect to a certain trace inner product.
The unreasonable effectiveness of quantum computing is founded on coherent quantum superposition or entanglement which allows a large number of calculations to be performed simultaneously. This coherence is lost as a quantum system interacts with its environment. In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.
The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding classical self-orthogonal linear codes over the Galois field GF(4) under a Hermitian inner product.A classical cyclic code over the field GF(4) is self-orthogonal with respect to the Hermitian inner product iff the generator polynomial of its dual code is a factor of its generator polynomial.Based on this connection,a class of quantum cyclic codes is constructed by finding corresponding classical cyclic codes.Some examples are also given in detail.
It is well known that n-length stabilizer quantum error correcting codes (QECCs) can be obtained via n-length classical error correction codes (CECCs) over GF(4), that are additive and self-orthogonal with respect to the trace Hermitian inner product. But, most of the CECCs have been studied with respect to the Euclidean inner product. In this paper, it is shown that n-length stabilizer QECCs can be constructed via 3n-length linear CECCs over GF(2) that are self-orthogonal with respect to the Euclidean inner product. This facilitates usage of the widely studied self-orthogonal CECCs to construct stabilizer QECCs. Moreover, classical, binary, self-orthogonal cyclic codes have been used to obtain stabilizer QECCs with guaranteed quantum error correcting capability. This is facilitated by the fact that (i) self-orthogonal, binary cyclic codes are easily identified using transform approach and (ii) for such codes lower bounds on the minimum Hamming distance are known. Several explicit codes are constructed including two pure MDS QECCs.
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 additive self-orthogonal codes over the Galois field GF(4) under a trace inner product.Based on this connection,one method for constructing quantum constacyclic codes is presented by finding self-orthogonal classical constacyclic codes over the field GF(4) under a trace inner product.Finally,some examples are given.As an application of this method,quantum Hamming codes are constructed.This class of quantum codes includes well-known quantum cyclic codes.