IEEE Information Theory Workshop (ITW)

Convolutional and Block Quantum Error-Correcting Codes

Markus Grassl

Published Oct 1, 2006• 5 citations

Abstract

In this paper, we briefly recall the connection of both convolutional and block quantum error-correcting codes to their classical counterparts. Based on this correspondence, algorithms for computing encoding circuits for both types of codes are derived

DOI: 10.1109/itw2.2006.323775

Related papers

Classical convolutional GRS codes and applications to quantum convolutional codes

Xiu‐Jing Zheng, Liqi Wang, Shixin Zhu +1 more

Quantum Information ProcessingJan 23, 20260 citations

Quantum convolutional stabilizer codes

Neelima Chinthamani

Quantum error correction codes were introduced as a means to protect quantum information from decoherance and operational errors. Based on their approach to error control, error correcting codes can be divided into two different classes: block codes and convolutional codes. There has been significant development towards finding quantum block codes, since they were first discovered in 1995. In contrast, quantum convolutional codes remained mainly uninvestigated. In this thesis, we develop the stabilizer formalism for quantum convolutional codes. We define distance properties of these codes and give a general method for constructing encoding circuits, given a set of generators of the stabilizer of a quantum convolutional stabilizer code, is shown. The resulting encoding circuit enables online encoding of the qubits, i.e., the encoder does not have to wait for the input transmission to end before starting the encoding process. We develop the quantum analogue of the Viterbi algorithm. The quantum Viterbi algorithm (QVA) is a maximum likehood error estimation algorithm, the complexity of which grows linearly with the number of encoded qubits. A variation of the quantum Viterbi algorithm, the Windowed QVA, is also discussed. Using Windowed QVA, we can estimate the most likely error without waiting for the entire received sequence.

Sep 30, 20040 citations

Simple rate-1/3 convolutional and tail-biting quantum error-correcting codes

G. David Forney, Saikat Guha

Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum convolutional codes are constructed from classical self-orthogonal F4-linear and F2-linear convolutional codes, respectively. These quantum convolutional codes have higher rate than comparable quantum block codes or previous quantum convolutional codes, and are simple to decode. A block single-error-correcting [9,3,3] tail-biting code is derived from the unrestricted convolutional code, and similarly a [15,5,3] CSS-type block code from the CSS-type convolutional code

arXiv:quant-ph/0501099IEEE International Symposium on Information Theory (ISIT)Jan 1, 200522 citations

Quantum Convolutional Codes

H. F. Chau

I report two general methods to construct quantum convolutional codes for N-state quantum systems. Using these general methods, I construct a quantum convolutional code of rate 1/4, which outperforms the five register perfect code.

Dec 16, 19972 citations

Convolutional and Tail-Biting Quantum Error-Correcting Codes

G. David Forney, Markus Grassl, Saikat Guha

Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F4-linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same rate and error-correction capability and essentially the same decoding complexity are derived from these convolutional codes via tail-biting

arXiv:quant-ph/0511016IEEE Transactions on Information TheoryMar 1, 2007103 citations

Comment on "Quantum convolutional error-correcting codes" (2 pages)

Antonio Carlos Aido de Almeida

Physical Review AJan 1, 20050 citations