Computer Science – Information Theory
Scientific paper
2010-07-10
Computer Science
Information Theory
Scientific paper
In this paper, we define and study \emph{quantum cyclic codes}, a generalisation of cyclic codes to the quantum setting. Previously studied examples of quantum cyclic codes were all quantum codes obtained from classical cyclic codes via the CSS construction. However, the codes that we study are much more general. In particular, we construct cyclic stabiliser codes with parameters $[[5,1,3]]$, $[[17,1,7]]$ and $[[17,9,3]]$, all of which are \emph{not} CSS. The $[[5,1,3]]$ code is the well known Laflamme code and to the best of our knowledge the other two are new examples. Our definition of cyclicity applies to non-stabiliser codes as well; in fact we show that the $((5,6,2))$ nonstabiliser first constructed by Rains\etal~ cite{rains97nonadditive} and latter by Arvind \etal~\cite{arvind:2004:nonstabilizer} is cyclic. We also study stabiliser codes of length $4^m +1$ over $\mathbb{F}_2$ for which we define a notation of BCH distance. Much like the Berlekamp decoding algorithm for classical BCH codes, we give efficient quantum algorithms to correct up to $\floor{\frac{d-1}{2}}$ errors when the BCH distance is $d$.
Dutta Sagarmoy
Kurur Piyush P.
No associations
LandOfFree
Quantum Cyclic Code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quantum Cyclic Code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Cyclic Code will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-300237