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

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•117 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, 2004•0 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•76 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•26 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

Stabilizer codes : encoding schemes and applications

Shiyu Shi

Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.

•Jan 1, 2016•0 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
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.
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 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.
Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.