{"title":"由循环码衍生出新的纠缠辅助量子MDS码","authors":"Sujuan Huang, Shixin Zhu, Pan Wang","doi":"10.26421/QIC23.5-6-4","DOIUrl":null,"url":null,"abstract":"Entanglement-assisted quantum error-correcting codes, which can be seen as a generalization of quantum error-correcting codes, can be constructed from arbitrary classical linear codes by relaxing the self-orthogonality properties and using pre-shared entangled states between the sender and the receiver, and can also improve the performance of quantum error-correcting codes. In this paper, we construct some families of entanglement-assisted quantum maximum-distance-separable codes with parameters $[[\\frac{{{q^2} - 1}}{a},\\frac{{{q^2} - 1}}{a} - 2d+2 + c,d;c]]_q$, where $q$ is a prime power with the form $q = am \\pm \\ell$, $a = \\frac{{\\ell^2} - 1}{3}$ is an odd integer, $\\ell \\equiv 2\\ (\\bmod\\ 6)$ or $\\ell \\equiv 4\\ (\\bmod\\ 6)$, and $m$ is a positive integer. Most of these codes are new in the sense that their parameters are not covered by the codes available in the literature.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"44 1","pages":"415-440"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New entanglement-assisted quantum MDS codes derived from cyclic codes\",\"authors\":\"Sujuan Huang, Shixin Zhu, Pan Wang\",\"doi\":\"10.26421/QIC23.5-6-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Entanglement-assisted quantum error-correcting codes, which can be seen as a generalization of quantum error-correcting codes, can be constructed from arbitrary classical linear codes by relaxing the self-orthogonality properties and using pre-shared entangled states between the sender and the receiver, and can also improve the performance of quantum error-correcting codes. In this paper, we construct some families of entanglement-assisted quantum maximum-distance-separable codes with parameters $[[\\\\frac{{{q^2} - 1}}{a},\\\\frac{{{q^2} - 1}}{a} - 2d+2 + c,d;c]]_q$, where $q$ is a prime power with the form $q = am \\\\pm \\\\ell$, $a = \\\\frac{{\\\\ell^2} - 1}{3}$ is an odd integer, $\\\\ell \\\\equiv 2\\\\ (\\\\bmod\\\\ 6)$ or $\\\\ell \\\\equiv 4\\\\ (\\\\bmod\\\\ 6)$, and $m$ is a positive integer. Most of these codes are new in the sense that their parameters are not covered by the codes available in the literature.\",\"PeriodicalId\":20904,\"journal\":{\"name\":\"Quantum Inf. Comput.\",\"volume\":\"44 1\",\"pages\":\"415-440\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Inf. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26421/QIC23.5-6-4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Inf. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26421/QIC23.5-6-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New entanglement-assisted quantum MDS codes derived from cyclic codes
Entanglement-assisted quantum error-correcting codes, which can be seen as a generalization of quantum error-correcting codes, can be constructed from arbitrary classical linear codes by relaxing the self-orthogonality properties and using pre-shared entangled states between the sender and the receiver, and can also improve the performance of quantum error-correcting codes. In this paper, we construct some families of entanglement-assisted quantum maximum-distance-separable codes with parameters $[[\frac{{{q^2} - 1}}{a},\frac{{{q^2} - 1}}{a} - 2d+2 + c,d;c]]_q$, where $q$ is a prime power with the form $q = am \pm \ell$, $a = \frac{{\ell^2} - 1}{3}$ is an odd integer, $\ell \equiv 2\ (\bmod\ 6)$ or $\ell \equiv 4\ (\bmod\ 6)$, and $m$ is a positive integer. Most of these codes are new in the sense that their parameters are not covered by the codes available in the literature.