Quantum error correcting codes for specific position errors, which are a different type from ordinary quantum error correcting codes, are proposed. The quantum Hamming bound is modified to apply to such codes. Furthermore, an example of the code which breaks the modified quantum Hamming bound is shown.
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode k=n-j-2 quantum bits (qubits) in n=2j qubits and correct t=1 error. \textcopyright{} 1996 The American Physical Society.
Quantum error-correcting codes play an important role in not only quantum communication but also quantum computation.All kinds of cyclic codes,for example,Hamming codes,BCH codes and Reed-Solomon codes et al.,constacyclic codes and quasi-cyclic codes have been used to construct quantum error-correcting codes.An unified approach to construct quantum error-correcting codes was presented by using quasi-twisted codes.A sufficient and necessary condition for quasi-twisted contained its dual codes,and a new method for constructing quasi-twisted codes was given.Moreover,new quantum quasi-twisted codes were obtained by using quasi-twisted codes.
This paper is concerned with bounds for quantum error-correcting codes. Using the quantum MacWilliams (1972, 1977) identities, we generalize the linear programming approach from classical coding theory to the quantum case. Using this approach, we obtain Singleton-type, Hamming-type, and the first linear-programming-type bounds for quantum codes. Using the special structure of linear quantum codes, we derive an upper bound that is better than both Hamming and the first linear programming bounds on some subinterval of rates.