Acta Physica Sinica

Encoding and decoding of quantum convolutional codes

Lijuan Xing, Zhuo Li, Bai Bao-Ming, Xinmei Wang, 西安电子科技大学综合业务网国家重点实验室,西安 710071

Published Jan 1, 2008• 6 citations

Abstract

The research on quantum convolutional codes is aimed at protecting a flow of information over long distance communications. The polynomial representation of a quantum state is defined. Based on the Calderbank-Shor-Steane(CSS)-type construction of quantum codes, a new method for encoding and decoding of CSS-type quantum convolutional codes is presented and corresponding networks are described. The basis state of the code is transformed into the product of an information polynomial by the generator polynomial. Then networks can be realized by operations of polynomial multiplication. Finally, inspired by classical convolutional decoding idea, a quantum Viterbi algorithm with linear complexity is put forward.

DOI: 10.7498/aps.57.4695

Related papers

Encoding and Decoding of CSS-Type Quantum Convolution Codes

Linrang Zhang

The polynomial representation of a quantum state is defined.Based on the Calderbank-Shor-Steane(CSS)-type construction of quantum codes,a new method for encoding and decoding of CSS-type quantum convolution codes is presented.Its corresponding networks are also described.The basis state of the code is transformed into the multiplication of an information polynomial by the generator polynomial.Then networks can be realized with operations of polynomial multiplication. The simple method possesses a highly regular structure,and the networks are easy to realize.

Beijing Youdian Xueyuan xuebaoJan 1, 20080 citations

Description of Quantum Convolutional Codes

Lijuan Xing, Zhuo Li, Baoming Bai

Quantum communication system is influenced by environment noise in the whole process. Quantum error-correcting codes can solve this problem efficiently. The polynomial representation of a quantum state is defined. Based on the structure of the classical convolutional codes, the basis state of the quantum convolutional codes is transformed into the multiplication of an information polynomial by the generator polynomial. A new method is proposed to encode and decode these quantum codes and the networks can be realized with the polynomial multiplication circuits. Finally, we provide a maximum likelihood error estimation algorithm with complexity growing linearly.

International Conference on Wireless Communications, Networking and Mobile ComputingOct 1, 20082 citations

Quantum Convolutional Codes Based on the Stabilizer of Linear Codes

Ying Guo, Guihua Zeng

A quantum error correction scheme is proposed to protect a flow of transmitted quantum information. It is largely inspired by the theory of classical convolutional codes and the construction of the linear quantum code for error correction using the stabilizer formalism. Also, we provide an explicit encoding circuit to describe the process of the online encoding and the quantum error propagation. To decode the construction of the code, a quantum Viterbi algorithm is put forward for decoding of quantum signals received at the decoder

Asia-Pacific Conference on Communications (APCC)Dec 13, 20052 citations

Entanglement-assisted quantum convolutional coding

Mark M. Wilde, Todd A. Brun

We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary classical binary convolutional codes. The rate and error-correcting properties of the classical convolutional codes directly determine the corresponding properties of the resulting entanglement-assisted quantum convolutional code. We explain how to encode our CSS entanglement-assisted quantum convolutional codes starting from a stream of information qubits, ancilla qubits, and shared entangled bits.

arXiv:0712.2223Physical Review AApr 30, 201059 citations

Quantum convolutional codes: fundamentals

Ollivier, H., Jean–Pierre Tillich

We describe the theory of quantum convolutional error correcting codes. These codes are aimed at protecting a flow of quantum information over long distance communication. They are largely inspired by their classical analogs which are used in similar circumstances in classical communication. In this article, we provide an efficient polynomial formalism for describing their stabilizer group, derive an on-line encoding circuit with linear gate complexity and study error propagation together with the existence of on-line decoding. Finally, we provide a maximum likelihood error estimation algorithm with linear classical complexity for any memoryless channel.

arXiv:quant-ph/0401134Jan 21, 200458 citations

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Mitsuru Hamada

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.

Jan 1, 200840 citations