Description of a quantum convolutional code
arXiv:quant-ph/0304189 · doi:10.1103/PhysRevLett.91.177902
Abstract
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, which provides an explicit encoding circuit. An associated error estimation algorithm is given explicitly and shown to provide the most likely error over any memoryless quantum channel, while its complexity grows only linearly with the number of encoded qubits.
4 pages, uses revtex4. Minor correction in the encoding and decoding circuits
References in corpus (1)
Cited by in corpus (50)
- Stabilizer Formalism for Operator Quantum Error Correction
- Quantum channels and memory effects
- Foliated Quantum Codes
- Convolutional and tail-biting quantum error-correcting codes
- Entanglement-assisted quantum turbo codes
- Tensor Networks and Quantum Error Correction
- Quantum repeaters based on concatenated bosonic and discrete-variable quantum codes
- Entanglement-Assisted Quantum Convolutional Coding
- Quantum convolutional codes: fundamentals
- Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
- EXIT-Chart Aided Near-Capacity Quantum Turbo Code Design
- The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
- Quantum Block and Convolutional Codes from Self-orthogonal Product Codes
- On Classical and Quantum MDS-Convolutional BCH Codes
- Tailored codes for small quantum memories
- Quantum Coding with Entanglement
- Quantum Shift Register Circuits
- Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes
- On the MacWilliams Identity for Classical and Quantum Convolutional Codes
- Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
- Belief propagation decoding of quantum channels by passing quantum messages
- Quantum Algorithm for Signal Denoising
- Minimal-memory, non-catastrophic, polynomial-depth quantum convolutional encoders
- Quantum Convolutional Coding with Shared Entanglement: General Structure
- Extra Shared Entanglement Reduces Memory Demand in Quantum Convolutional Coding
- Quantum outage probability for time-varying quantum channels
- A Construction of MDS Quantum Convolutional Codes
- Decoding Schemes for Foliated Sparse Quantum Error Correcting Codes
- Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
- New Convolutional Codes Derived from Algebraic Geometry Codes
- Recursive quantum convolutional encoders are catastrophic: A simple proof
- Convolutional Entanglement Distillation
- Trellises for stabilizer codes: definition and uses
- Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes
- Quantum resource theory of coding for error correction
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Spatially-Coupled QLDPC Codes
- Removing correlations in signals transmitted over a quantum memory channel
- Stabilizer codes for Open Quantum Systems
- Minimal memory requirements for pearl-necklace encoders of quantum convolutional codes
- Examples of minimal-memory, non-catastrophic quantum convolutional encoders
- Decoherence and Quantum Error Correction for Quantum Computing and Communications
- Quantum serial turbo-codes
- Error Correction for Reliable Quantum Computing
- Rethinking Renormalization for Quantum Phase Transitions
- A dataflow programming framework for linear optical distributed quantum computing
- Degenerate Viterbi decoding
- Asymmetric quantum convolutional codes
- New constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes
- A quantum algorithm for Viterbi decoding of classical convolutional codes