Constructions of Quantum Convolutional Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
5 pages, to appear in the Proceedings of the 2007 IEEE International Symposium on Information Theory

Keywords

Quantum Physics, Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/231086

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/0703182
 http://arxiv.org/abs/quant-ph/0703182
 Proceedings 2007 IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, June 2007, pp. 816-820
 doi:10.1109/ISIT.2007.4557325

Collections

arXiv