Abstract

On the basis of elementary transformation, we propose a new method for constructing a class of pure quantum codes [[n − i, 2k − n + i, d − i]]2 and [[n + 1, 2k − n − 1, d + 1]]2 from a class of classical linear codes [n, k, d]2 that contain their dual codes. The construction process was based on the elementary algebra; the error-correcting performance of the quantum codes was analyzed according to the relationship between the parity-check matrix and the minimum distance of the classical linear codes; the encoding and decoding networks were constructed based on the stabilizer. The proposed method is simple, straightforward and easy to implement using a computer and other hardware system. The theoretical results showed that the method is practical for the construction of a class of quantum codes.

Full Text
Paper version not known

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 call

Disclaimer: 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.