Title :
On encoders for quantum convolutional codes
Author :
Grassl, Markus ; Rötteler, Martin
Author_Institution :
Centre for Quantum Technol., Nat. Univ. of Singapore, Singapore, Singapore
fDate :
Aug. 30 2010-Sept. 3 2010
Abstract :
We consider the problem of computing an encoding circuit for a quantum convolutional code given by a polynomial stabilizer matrix S(D) = (X(D) | Z(D)). We present an algorithm that is very similar to a polynomial-time algorithm for computing the Smith form of a polynomial matrix. This is a step towards the conjecture that any quantum convolutional code has an encoder with polynomially bounded depth.
Keywords :
convolutional codes; encoding; polynomial matrices; encoding circuit; polynomial matrix; polynomial stabilizer matrix; polynomial time algorithm; quantum convolutional code; Convolutional codes; Discrete Fourier transforms; Encoding; Generators; Logic gates; Polynomials; Quantum computing;
Conference_Titel :
Information Theory Workshop (ITW), 2010 IEEE
Conference_Location :
Dublin
Print_ISBN :
978-1-4244-8262-7
Electronic_ISBN :
978-1-4244-8263-4
DOI :
10.1109/CIG.2010.5592857
