Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Asia-Pacific Conference on Communications (APCC)

Quantum Convolutional Codes Based on the Stabilizer of Linear Codes

Ying Guo, Guihua Zeng

Published Dec 13, 2005• 2 citations
Publisher

Abstract

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

DOI
10.1109/apcc.2005.1554039

Related papers

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, 2004•0 citations

Description of a Quantum Convolutional Code

Harold Ollivier, Jean–Pierre Tillich

We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances in classical communication. The particular example shown here uses the stabilizer formalism. We provide an explicit encoding circuit and its associated error estimation algorithm. The latter gives the most likely error over any memoryless quantum channel, with a complexity growing only linearly with the number of encoded qubits.

arXiv:quant-ph/0304189•Physical Review Letters•Oct 23, 2003•112 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/0401134•Jan 21, 2004•58 citations

Good quantum-convolutional error-correction codes and their decoding algorithm exist

H. F. Chau

A quantum-convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of the quantum-convolutional code, I report a way to decode certain quantum-convolutional codes based on the classical Viterbi decoding algorithm. This decoding algorithm is optimal for a memoryless channel. I also report three simple criteria to test if decoding errors in a quantum-convolutional code will terminate after a finite number of decoding steps whenever the Hilbert space dimension of each quantum register is a prime power. Finally, I show that certain quantum-convolutional codes are in fact stabilizer codes. And hence, these quantum stabilizer convolutional codes have fault-tolerant implementations.

arXiv:quant-ph/9806032•Physical Review A•Sep 1, 1999•24 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 Computing•Oct 1, 2008•2 citations

Encoding and decoding of quantum convolutional codes

Lijuan Xing, Zhuo Li, Bai Bao-Ming +2 more

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.

Acta Physica Sinica•Jan 1, 2008•6 citations
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
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.
We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances in classical communication. The particular example shown here uses the stabilizer formalism. We provide an explicit encoding circuit and its associated error estimation algorithm. The latter gives the most likely error over any memoryless quantum channel, with a complexity growing only linearly with the number of encoded qubits.
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.
A quantum-convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of the quantum-convolutional code, I report a way to decode certain quantum-convolutional codes based on the classical Viterbi decoding algorithm. This decoding algorithm is optimal for a memoryless channel. I also report three simple criteria to test if decoding errors in a quantum-convolutional code will terminate after a finite number of decoding steps whenever the Hilbert space dimension of each quantum register is a prime power. Finally, I show that certain quantum-convolutional codes are in fact stabilizer codes. And hence, these quantum stabilizer convolutional codes have fault-tolerant implementations.
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.
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.