By using difference schemes, orthogonal partitions and a replacement method, some new methods to construct pure quantum error-correcting codes are provided from orthogonal arrays. As an application of these methods,… Click to show full abstract
By using difference schemes, orthogonal partitions and a replacement method, some new methods to construct pure quantum error-correcting codes are provided from orthogonal arrays. As an application of these methods, we construct several infinite series of quantum error-correcting codes including some optimal ones. Compared with the existing binary quantum codes, more new codes can be constructed, which have a lower number of terms (i.e., the number of computational basis states) for each of their basis states.
               
Click one of the above tabs to view related content.