Abstract
Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise. In this work, we construct six families of new EAQECCs of lengths $$n=(q^2+1)/a$$ , $$n=q^2+1$$ and $$n=(q^2+1)/2$$ from cyclic codes, where $$a=m^2+1$$ ( $$m\ge 1$$ is odd) and q is an odd prime power with the form of $$a|(q+m)$$ or $$a|(q-m)$$ . Moreover, those EAQECCs are entanglement-assisted quantum maximum distance separable (EAQMDS) codes when $$d\le (n+2)/2$$ . In particular, the length of EAQECCs we studied is more general and the method of selecting defining set is different from others. Compared with all the previously known results, the EAQECCs in this work have flexible parameters and larger minimum distance. All of these EAQECCs are new in the sense that their parameters are not covered by the quantum codes available in the literature.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.