Quantum Serial Turbo Codes

DOI10.1109/TIT.2009.2018339MaRDI QIDQ4975896zbMATH OpenFDO

Authors David Poulin, Jean-Pierre Tillich, Harold Ollivier

Publication date 8 August 2017

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

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

Mathematics Subject Classification ID

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

Abstract: We present a theory of quantum serial turbo-codes, describe their iterative decoding algorithm, and study their performances numerically on a depolarization channel. Our construction offers several advantages over quantum LDPC codes. First, the Tanner graph used for decoding is free of 4-cycles that deteriorate the performances of iterative decoding. Secondly, the iterative decoder makes explicit use of the code's degeneracy. Finally, there is complete freedom in the code design in terms of length, rate, memory size, and interleaver choice. We define a quantum analogue of a state diagram that provides an efficient way to verify the properties of a quantum convolutional code, and in particular its recursiveness and the presence of catastrophic error propagation. We prove that all recursive quantum convolutional encoder have catastrophic error propagation. In our constructions, the convolutional codes have thus been chosen to be non-catastrophic and non-recursive. While the resulting families of turbo-codes have bounded minimum distance, from a pragmatic point of view the effective minimum distances of the codes that we have simulated are large enough not to degrade the iterative decoding performance up to reasonable word error rates and block sizes. With well chosen constituent convolutional codes, we observe an important reduction of the word error rate as the code length increases.

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Boolean Functions, Projection Operators, and Quantum Error Correcting Codes
• Codeword Stabilized Quantum Codes
• Constructing quantum error correcting code via logic function
• Nonbinary Stabilizer Codes Over Finite Fields
• On subsystem codes beating the quantum Hamming or Singleton bound
• Quantum Serial Turbo Codes
• Quantum error correction via codes over GF(4)

Cited in

(8)

• A construction of quantum turbo product codes based on CSS-type quantum convolutional codes
• Quantum convolutional coding with shared entanglement: general structure
• Nonbinary quantum codes
• Dualities and identities for entanglement-assisted quantum codes
• On the construction of stabilizer codes with an arbitrary binary matrix
• Quantum Serial Turbo Codes
• A class of quantum low-density parity check codes by combining seed graphs
• scientific article; zbMATH DE number 6001555 (Why is no real title available?)

This page was built for publication: Quantum Serial Turbo Codes

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