Convolutional and tail-biting quantum error-correcting codes
Preprint
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.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- A Distance Measure Tailored to Tailbiting CodesProblems of Information Transmission, 2002
- Cyclic quantum error–correcting codes and quantum shift registersProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2000
- Good quantum-convolutional error-correction codes and their decoding algorithm existPhysical Review A, 1999
- Quantum convolutional error-correcting codesPhysical Review A, 1998
- Theory of fault-tolerant quantum computationPhysical Review A, 1998
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Quantum Error Correction and Orthogonal GeometryPhysical Review Letters, 1997
- Mixed-state entanglement and quantum error correctionPhysical Review A, 1996
- Good quantum error-correcting codes existPhysical Review A, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995