Examples of minimal-memory, non-catastrophic quantum convolutional encoders

Abstract

One of the most important open questions in the theory of quantum convolutional coding is to determine a minimal-memory, non-catastrophic, polynomial-depth convolutional encoder for an arbitrary quantum convolutional code. Here, we present a technique that finds quantum convolutional encoders with such desirable properties for several example quantum convolutional codes (an exposition of our technique in full generality will appear elsewhere). We first show how to encode the well-studied Forney-Grassl-Guha (FGG) code with an encoder that exploits just one memory qubit (the former Grassl-Roetteler encoder requires 15 memory qubits). We then show how our technique can find an online decoder corresponding to this encoder, and we also detail the operation of our technique on a different example of a quantum convolutional code. Finally, the reduction in memory for the FGG encoder makes it feasible to simulate the performance of a quantum turbo code employing it, and we present the results of such simulations.

5 pages, 2 figures, Accepted for the International Symposium on Information Theory 2011 (ISIT 2011), St. Petersburg, Russia; v2 has minor changes

References in corpus (10)

• Optimal Entanglement Formulas for Entanglement-Assisted Quantum Coding
• Quantum convolutional codes: fundamentals
• Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
• On the logical operators of quantum codes
• Quantum Convolutional BCH Codes
• Constructions of Quantum Convolutional Codes
• Quantum Shift Register Circuits
• Unified Quantum Convolutional Coding
• Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
• Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

Cited by in corpus (1)

• Minimal-memory, non-catastrophic, polynomial-depth quantum convolutional encoders