Minimal-Memory, Noncatastrophic, Polynomial-Depth Quantum Convolutional Encoders

DOI10.1109/TIT.2012.2220520zbMATH Open1364.81092arXiv1105.0649WikidataQ59832593 ScholiaQ59832593MaRDI QIDQ2989441FDOQ2989441

Authors: Monireh Houshmand, Saied Hosseini-Khayat, Mark M. Wilde 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Quantum convolutional coding is a technique for encoding a stream of quantum information before transmitting it over a noisy quantum channel. Two important goals in the design of quantum convolutional encoders are to minimize the memory required by them and to avoid the catastrophic propagation of errors. In a previous paper, we determined minimal-memory, non-catastrophic, polynomial-depth encoders for a few exemplary quantum convolutional codes. In this paper, we elucidate a general technique for finding an encoder of an arbitrary quantum convolutional code such that the encoder possesses these desirable properties. We also provide an elementary proof that these encoders are non-recursive. Finally, we apply our technique to many quantum convolutional codes from the literature.

Full work available at URL: https://arxiv.org/abs/1105.0649

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Convolutional codes (94B10)

Cited In (2)

• On the constructions of quantum MDS convolutional codes
• On the construction of stabilizer codes with an arbitrary binary matrix

This page was built for publication: Minimal-Memory, Noncatastrophic, Polynomial-Depth Quantum Convolutional Encoders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989441)