Poulin discovered an important separation between the classical and quantum theories of convolutional coding, by proving that a quantum convolutional encoder cannot be both noncatastrophic and recursive. Noncatastrophicity is desirable so that an iterative decoding algorithm converges when decoding a quantum turbo code whose constituents are quantum convolutional codes, and recursiveness is as well so that a quantum turbo code has a minimum distance growing nearly linearly with the length of the code, respectively. Their proof of the aforementioned theorem was admittedly “rather involved,” and as such, it has been desirable since their result to find a simpler proof. In this paper, we furnish a proof that is arguably simpler. Our approach is group-theoretic-we show that the subgroup of memory states that are part of a zero physical-weight cycle of a quantum convolutional encoder is equivalent to the centralizer of its “finite-memory” subgroup (the subgroup of memory states which eventually reach the identity memory state by identity operator inputs for the information qubits and identity or Pauli- Z operator inputs for the ancilla qubits). After proving that this symmetry holds for any quantum convolutional encoder, it easily follows that an encoder is nonrecursive if it is noncatastrophic. Our proof also illuminates why this no-go theorem does not apply to entanglement-assisted quantum convolutional encoders-the introduction of shared entanglement as a resource allows the above symmetry to be broken.
Poulin discovered an important separation between the classical and quantum theories of convolutional coding, by proving that a quantum convolutional encoder cannot be both noncatastrophic and recursive. Noncatastrophicity is desirable so that an iterative decoding algorithm converges when decoding a quantum turbo code whose constituents are quantum convolutional codes, and recursiveness is as well so that a quantum turbo code has a minimum distance growing nearly linearly with the length of the code, respectively. Their proof of the aforementioned theorem was admittedly “rather involved,” and as such, it has been desirable since their result to find a simpler proof. In this paper, we furnish a proof that is arguably simpler. Our approach is group-theoretic-we show that the subgroup of memory states that are part of a zero physical-weight cycle of a quantum convolutional encoder is equivalent to the centralizer of its “finite-memory” subgroup (the subgroup of memory states which eventually reach the identity memory state by identity operator inputs for the information qubits and identity or Pauli- Z operator inputs for the ancilla qubits). After proving that this symmetry holds for any quantum convolutional encoder, it easily follows that an encoder is nonrecursive if it is noncatastrophic. Our proof also illuminates why this no-go theorem does not apply to entanglement-assisted quantum convolutional encoders-the introduction of shared entanglement as a resource allows the above symmetry to be broken.
An unexpected breakdown in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential for quantum turbo code families to have a minimum distance growing with blocklength and for their iterative decoding algorithm to converge, respectively. Here, we show that the entanglement-assisted paradigm simplifies the theory of quantum turbo codes, in the sense that an entanglement-assisted quantum (EAQ) convolutional encoder can possess both of the aforementioned desirable properties. We give several examples of EAQ convolutional encoders that are both recursive and non-catastrophic and detail their relevant parameters. We then modify the quantum turbo decoding algorithm of Poulin , in order to have the constituent decoders pass along only extrinsic information to each other rather than a posteriori probabilities as in the decoder of Poulin , and this leads to a significant improvement in the performance of unassisted quantum turbo codes. Other simulation results indicate that entanglement-assisted turbo codes can operate reliably in a noise regime 4.73 dB beyond that of standard quantum turbo codes, when used on a memoryless depolarizing channel. Furthermore, several of our quantum turbo codes are within 1 dB or less of their hashing limits, so that the performance of quantum turbo codes is now on par with that of classical turbo codes. Finally, we prove that entanglement is the resource that enables a convolutional encoder to be both non-catastrophic and recursive because an encoder acting on only information qubits, classical bits, gauge qubits, and ancilla qubits cannot simultaneously satisfy them.
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, noncatastrophic, 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 nonrecursive. Finally, we apply our technique to many quantum convolutional codes from the literature.
In this paper, 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 low-density parity-check (LDPC) codes. First, the Tanner graph used for decoding is free of 4-cycles that deteriorate the performances of iterative decoding. Second, 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 encoders have catastrophic error propagation. In our constructions, the convolutional codes have thus been chosen to be noncatastrophic and nonrecursive. 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.
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 appears 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-Rötteler 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.
Classical turbo codes efficiently approach the Shannon limit, and so bringing these over to the quantum scenario would allow for rapid transmission of quantum information. Early on in the work of defining the quantum analogue, it was shown that an efficient recursive subroutine (quantum convolutional codes) would always be catastrophic. This result may have stunted the further research into this coding scheme. In this document, we prove that this previously proven no-go theorem is no longer always true if we extend the coding scheme into qudit space with dimension some prime larger than 2. This removes a blockade in the development of quantum turbo codes and hopefully will stimulate further research in this area.