Constructions of Quantum Convolutional Codes

Details Constructions of Quantum Convolutional Codes Constructions of Quantum Convolutional Codes

2007-03-19

arxiv.org/abs/quant-ph/0703182v1

Proceedings 2007 IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, June 2007, pp. 816-820

Physics

Quantum Physics

5 pages, to appear in the Proceedings of the 2007 IEEE International Symposium on Information Theory

Scientific paper

10.1109/ISIT.2007.4557325

We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum convolutional code by applying a product code construction to an arbitrary classical convolutional code and an arbitrary quantum block code. We show that the resulting codes have highly structured and efficient encoders. Furthermore, we show that the resulting quantum circuits have finite depth, independent of the lengths of the input stream, and show that this depth is polynomial in the degree and frame size of the code.

Affiliated with

Also associated with

No associations

Rating

Constructions of Quantum Convolutional Codes 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 Constructions of Quantum Convolutional Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructions of Quantum Convolutional Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-123729