Constructions of Quantum Convolutional Codes

Simple item page
dc.creatorGrassl, Markus
dc.creatorRoetteler, Martin
dc.date2007-03-19
dc.date.accessioned2026-07-07T13:17:21Z
dc.date.available2026-07-07T13:17:21Z
dc.descriptionWe 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.
dc.description5 pages, to appear in the Proceedings of the 2007 IEEE International Symposium on Information Theory
dc.identifierhttps://arxiv.org/abs/quant-ph/0703182
dc.identifierhttp://arxiv.org/abs/quant-ph/0703182
dc.identifierProceedings 2007 IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, June 2007, pp. 816-820
dc.identifierdoi:10.1109/ISIT.2007.4557325
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/231086
dc.subjectQuantum Physics
dc.subjectInformation Theory
dc.titleConstructions of Quantum Convolutional Codes
dc.typetext

Files

Collections

arXiv