Convolutional and tail-biting quantum error-correcting codes
arXiv:quant-ph/0511016 · doi:10.1109/TIT.2006.890698
Abstract
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 F_4-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 algorithms are derived from these convolutional codes via tail-biting.
30 pages. Submitted to IEEE Transactions on Information Theory. Minor revisions after first round of reviews
References in corpus (4)
Cited by in corpus (37)
- Catalytic quantum error correction
- Entanglement-assisted quantum turbo codes
- Entanglement-Assisted Quantum Convolutional Coding
- Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
- EXIT-Chart Aided Near-Capacity Quantum Turbo Code Design
- On the logical operators of quantum codes
- The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
- Quantum Convolutional BCH Codes
- Constructions of Quantum Convolutional Codes
- On Classical and Quantum MDS-Convolutional BCH Codes
- Quantum Coding with Entanglement
- Quantum Shift Register Circuits
- Unified Quantum Convolutional Coding
- On the MacWilliams Identity for Classical and Quantum Convolutional Codes
- Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
- Minimal-memory, non-catastrophic, polynomial-depth quantum convolutional encoders
- Quantum Convolutional Coding with Shared Entanglement: General Structure
- Entanglement-assisted Coding Theory
- Extra Shared Entanglement Reduces Memory Demand in Quantum Convolutional Coding
- A Construction of MDS Quantum Convolutional Codes
- Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
- Convolutional Entanglement Distillation
- Asymmetric and Symmetric Subsystem BCH Codes and Beyond
- Quantum convolutional data-syndrome codes
- Decoding Schemes for Foliated Sparse Quantum Error Correcting Codes
- Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Examples of minimal-memory, non-catastrophic quantum convolutional encoders
- Minimal memory requirements for pearl-necklace encoders of quantum convolutional codes
- Error Correction for Reliable Quantum Computing
- Design of Quantum Stabilizer Codes From Quadratic Residues Sets
- Qubit encodings for lattices of dipolar planar rotors
- Degenerate Viterbi decoding
- Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
- New constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes
- Asymmetric quantum convolutional codes
- Efficient ML Decoding for Quantum Convolutional Codes