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

arXiv:quant-ph/9802009

Quantum Convolutional Error Correction Codes

H. F. Chau

Published Feb 3, 1998• 1 citation
arXivHTMLPDF

Abstract

I report two general methods to construct quantum convolutional codes for quantum registers with internal $N$ states. Using one of these methods, I construct a quantum convolutional code of rate 1/4 which is able to correct one general quantum error for every eight consecutive quantum registers.

DOI
10.48550/arxiv.quant-ph/9802009

Related papers

Quantum convolutional error-correcting 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 can correct one quantum error for every eight consecutive quantum registers.

arXiv:quant-ph/9712029•Physical Review A•Aug 1, 1998•38 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, 1997•2 citations

A concatenated [(4, 1, 3)] quantum convolutional code

Antonio Carlos Aido de Almeida, Reginaldo Palazzo

We construct a concatenated [(4, 1, 3)] quantum convolutional code from a (2, 1, 2) classical convolutional code. This quantum convolutional code can correct one general error.

Manufacturing Engineer•Apr 6, 2005•25 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

Quantum convolutional codes design and their encoder architectures

Jun Jin Kong, Keshab K. Parhi

In this paper, design of quantum convolutional codes and their encoder architectures have been investigated. We claim that rate-1/(n+1) quantum systematic convolutional codes can be constructed from rate-1/n classical nonsystematic convolutional codes, where n is greater than or equal to 2. The free distances (d/sub free/) of proposed rate-1/(n+1) quantum systematic convolutional codes are larger than that of original rate-1/n classical nonsystematic convolutional codes. A quantum convolutional code encoder can be implemented by using quantum linear feed-forward shift registers and quantum exclusive-OR (controlled-NOT: CNOT) gates. A quantum memory may be used as a quantum state delay element of a quantum register. It is also shown that different encoder architectures one needed for quantum nonsuperposition and superposition state inputs. For quantum superposition state input, additional Hadamard gates should be used in conjunction with a quantum convolutional code encoder for quantum nonsuperposition state input.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Mar 31, 2005•1 citation

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/0511016•IEEE Transactions on Information Theory•Mar 1, 2007•103 citations
I report two general methods to construct quantum convolutional codes for quantum registers with internal NNN states. Using one of these methods, I construct a quantum convolutional code of rate 1/4 which is able to correct one general quantum error for every eight consecutive quantum registers.
I report two general methods to construct quantum convolutional codes for NNN-state quantum systems. Using these general methods, I construct a quantum convolutional code of rate 1/4, which can correct one quantum error for every eight consecutive quantum registers.
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.
In this paper, design of quantum convolutional codes and their encoder architectures have been investigated. We claim that rate-1/(n+1) quantum systematic convolutional codes can be constructed from rate-1/n classical nonsystematic convolutional codes, where n is greater than or equal to 2. The free distances (d/sub free/) of proposed rate-1/(n+1) quantum systematic convolutional codes are larger than that of original rate-1/n classical nonsystematic convolutional codes. A quantum convolutional code encoder can be implemented by using quantum linear feed-forward shift registers and quantum exclusive-OR (controlled-NOT: CNOT) gates. A quantum memory may be used as a quantum state delay element of a quantum register. It is also shown that different encoder architectures one needed for quantum nonsuperposition and superposition state inputs. For quantum superposition state input, additional Hadamard gates should be used in conjunction with a quantum convolutional code encoder for quantum nonsuperposition state input.
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