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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
