在非局部环集合 $${{\varvec{A}}}_{{{\varvec{k}}}$ 上使用常环码的新优化 Lcd 码和量子码

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL Quantum Information Processing Pub Date : 2024-08-21 DOI:10.1007/s11128-024-04489-5
Pooja Soni, Manju Pruthi
{"title":"在非局部环集合 $${{\\varvec{A}}}_{{{\\varvec{k}}}$ 上使用常环码的新优化 Lcd 码和量子码","authors":"Pooja Soni, Manju Pruthi","doi":"10.1007/s11128-024-04489-5","DOIUrl":null,"url":null,"abstract":"<p>In this article, we find several novel and efficient quantum error-correcting codes (<span>\\(\\boldsymbol{\\mathcal{Q}}\\)</span><b>ecc</b>) by studying the structure of constacyclic (<span>\\(\\boldsymbol{{\\mathcal{C}}{\\mathcalligra{cc}}}\\)</span>), cyclic (<span>\\(\\boldsymbol{{\\mathcal{C}}{\\mathcalligra{c}}}\\)</span>), and negacyclic codes (<b>N</b><span>\\(\\boldsymbol{{\\mathcal{C}}{\\mathcalligra{c}}}\\)</span>) over the ring <span>\\({A}_{k}={Z}_{p}\\left[{r}_{1},{r}_{2},\\dots ,{r}_{k}\\right]\\)</span>/<span>\\(\\langle {{(r}_{b}}^{({m}_{b}+1)}-{r}_{b}), {r}_{l}{r}_{b}={r}_{b}{r}_{l}=0, b\\ne l\\rangle \\)</span>, where <span>\\(p={q}^{m}\\)</span> for m, <span>\\({m}_{b}\\in {\\mathbb{N}}\\)</span>, <span>\\({m}_{b} | \\left(-1+q\\right)\\)</span> <span>\\(\\forall b, l \\in \\left\\{1\\, \\text{to}\\, k\\right\\}\\)</span>, <span>\\(q\\ge 3\\)</span> is a prime, <span>\\({Z}_{p}\\)</span> is a finite field. We define distance-preserving gray map <span>\\({\\delta }_{k}\\)</span>. Moreover, we determine the quantum singleton defect (<span>\\(\\mathcal{Q}\\)</span>SD) of <span>\\(\\boldsymbol{\\mathcal{Q}}\\)</span><b>ecc</b>, which indicates their overall quality. We compare our codes with existing codes in recent publications. The rings discussed by Kong et al. (EPJ Quantum Technol 10:1–16, 2023), Suprijanto et al. (Quantum codes constructed from cyclic codes over the ring<span>\\(F_{\\text{q}}+{\\text{vF}}_{\\text{q}}+{v}^{2}F_{\\text{q}}+{v}^{3}F_{\\text{q}}+{v}^{4}F_{\\text{q}}\\)</span>, pp 1–14, 2021. arXiv: 2112.13488v2 [cs.IT]), and Dinh et al. (IEEE Access 8:194082–194091, 2020) are specific cases of our work. Furthermore, we construct several novel and optimum linear complementary dual (Lcd) codes over <span>\\({A}_{k}.\\)</span></p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New optimized Lcd codes and quantum codes using constacyclic codes over a non-local collection of rings $${{\\\\varvec{A}}}_{{\\\\varvec{k}}}$$\",\"authors\":\"Pooja Soni, Manju Pruthi\",\"doi\":\"10.1007/s11128-024-04489-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this article, we find several novel and efficient quantum error-correcting codes (<span>\\\\(\\\\boldsymbol{\\\\mathcal{Q}}\\\\)</span><b>ecc</b>) by studying the structure of constacyclic (<span>\\\\(\\\\boldsymbol{{\\\\mathcal{C}}{\\\\mathcalligra{cc}}}\\\\)</span>), cyclic (<span>\\\\(\\\\boldsymbol{{\\\\mathcal{C}}{\\\\mathcalligra{c}}}\\\\)</span>), and negacyclic codes (<b>N</b><span>\\\\(\\\\boldsymbol{{\\\\mathcal{C}}{\\\\mathcalligra{c}}}\\\\)</span>) over the ring <span>\\\\({A}_{k}={Z}_{p}\\\\left[{r}_{1},{r}_{2},\\\\dots ,{r}_{k}\\\\right]\\\\)</span>/<span>\\\\(\\\\langle {{(r}_{b}}^{({m}_{b}+1)}-{r}_{b}), {r}_{l}{r}_{b}={r}_{b}{r}_{l}=0, b\\\\ne l\\\\rangle \\\\)</span>, where <span>\\\\(p={q}^{m}\\\\)</span> for m, <span>\\\\({m}_{b}\\\\in {\\\\mathbb{N}}\\\\)</span>, <span>\\\\({m}_{b} | \\\\left(-1+q\\\\right)\\\\)</span> <span>\\\\(\\\\forall b, l \\\\in \\\\left\\\\{1\\\\, \\\\text{to}\\\\, k\\\\right\\\\}\\\\)</span>, <span>\\\\(q\\\\ge 3\\\\)</span> is a prime, <span>\\\\({Z}_{p}\\\\)</span> is a finite field. We define distance-preserving gray map <span>\\\\({\\\\delta }_{k}\\\\)</span>. Moreover, we determine the quantum singleton defect (<span>\\\\(\\\\mathcal{Q}\\\\)</span>SD) of <span>\\\\(\\\\boldsymbol{\\\\mathcal{Q}}\\\\)</span><b>ecc</b>, which indicates their overall quality. We compare our codes with existing codes in recent publications. The rings discussed by Kong et al. (EPJ Quantum Technol 10:1–16, 2023), Suprijanto et al. (Quantum codes constructed from cyclic codes over the ring<span>\\\\(F_{\\\\text{q}}+{\\\\text{vF}}_{\\\\text{q}}+{v}^{2}F_{\\\\text{q}}+{v}^{3}F_{\\\\text{q}}+{v}^{4}F_{\\\\text{q}}\\\\)</span>, pp 1–14, 2021. arXiv: 2112.13488v2 [cs.IT]), and Dinh et al. (IEEE Access 8:194082–194091, 2020) are specific cases of our work. Furthermore, we construct several novel and optimum linear complementary dual (Lcd) codes over <span>\\\\({A}_{k}.\\\\)</span></p>\",\"PeriodicalId\":746,\"journal\":{\"name\":\"Quantum Information Processing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Information Processing\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.1007/s11128-024-04489-5\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MATHEMATICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1007/s11128-024-04489-5","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

摘要

在这篇文章中,我们通过研究常环码(constacyclic codes)、循环码(cyclic codes)和负环码(negacyclic codes)的结构,发现了几种新颖高效的量子纠错码(ec)、以及环 \({A}_{k}={Z}_{p}left[{r}_{1},{r}_{2},\dots 、{r}_{k}\right]\)/\(angle {{(r}_{b}}^{({m}_{b}+1)}-{r}_{b}), {r}_{l}{r}_{b}={r}_{b}{r}_{l}=0, b\ne l\rangle \),其中 \(p={q}^{m}\) for m, \({m}_{b}\in {\mathbb{N}}\),\({m}_{b}}.| (左(-1+右)))\(对于所有的 b, l 在\left\{1\, \text{to}\, k\right\}), \(q\ge 3\) 是一个素数,\({Z}_{p}\) 是一个有限域。我们定义了保距灰度映射({\delta }_{k}\)。此外,我们还确定了 \(\boldsymbol\{mathcal{Q}}\)ecc 的量子单子缺陷(\(\mathcal{Q}\)SD),这表明了它们的整体质量。我们将我们的代码与最近发表的现有代码进行比较。Kong 等人(EPJ Quantum Technol 10:1-16, 2023)、Suprijanto 等人(Suprijanto et al.(Quantum codes constructed from cyclic codes over the ring\(F_{\text{q}}+{text{vF}}_{\text{q}}+{v}^{2}F_\{text{q}}+{v}^{3}F_\{text{q}}+{v}^{4}F_{\text{q}}\), pp 1-14, 2021.arXiv: 2112.13488v2 [cs.IT])和 Dinh 等人(IEEE Access 8:194082-194091, 2020)是我们工作的具体案例。此外,我们还在\({A}_{k}.\)上构造了几种新颖且最优的线性互补对偶(Lcd)编码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
New optimized Lcd codes and quantum codes using constacyclic codes over a non-local collection of rings $${{\varvec{A}}}_{{\varvec{k}}}$$

In this article, we find several novel and efficient quantum error-correcting codes (\(\boldsymbol{\mathcal{Q}}\)ecc) by studying the structure of constacyclic (\(\boldsymbol{{\mathcal{C}}{\mathcalligra{cc}}}\)), cyclic (\(\boldsymbol{{\mathcal{C}}{\mathcalligra{c}}}\)), and negacyclic codes (N\(\boldsymbol{{\mathcal{C}}{\mathcalligra{c}}}\)) over the ring \({A}_{k}={Z}_{p}\left[{r}_{1},{r}_{2},\dots ,{r}_{k}\right]\)/\(\langle {{(r}_{b}}^{({m}_{b}+1)}-{r}_{b}), {r}_{l}{r}_{b}={r}_{b}{r}_{l}=0, b\ne l\rangle \), where \(p={q}^{m}\) for m, \({m}_{b}\in {\mathbb{N}}\), \({m}_{b} | \left(-1+q\right)\) \(\forall b, l \in \left\{1\, \text{to}\, k\right\}\), \(q\ge 3\) is a prime, \({Z}_{p}\) is a finite field. We define distance-preserving gray map \({\delta }_{k}\). Moreover, we determine the quantum singleton defect (\(\mathcal{Q}\)SD) of \(\boldsymbol{\mathcal{Q}}\)ecc, which indicates their overall quality. We compare our codes with existing codes in recent publications. The rings discussed by Kong et al. (EPJ Quantum Technol 10:1–16, 2023), Suprijanto et al. (Quantum codes constructed from cyclic codes over the ring\(F_{\text{q}}+{\text{vF}}_{\text{q}}+{v}^{2}F_{\text{q}}+{v}^{3}F_{\text{q}}+{v}^{4}F_{\text{q}}\), pp 1–14, 2021. arXiv: 2112.13488v2 [cs.IT]), and Dinh et al. (IEEE Access 8:194082–194091, 2020) are specific cases of our work. Furthermore, we construct several novel and optimum linear complementary dual (Lcd) codes over \({A}_{k}.\)

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Quantum Information Processing
Quantum Information Processing 物理-物理:数学物理
CiteScore
4.10
自引率
20.00%
发文量
337
审稿时长
4.5 months
期刊介绍: Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.
期刊最新文献
Secure sharing of one-sided quantum randomness using entangled coherent states Classification and transformations of quantum circuit decompositions for permutation operations Secure multiparty quantum computation for summation and data sorting Fusion of atomic W-like states in cavity QED systems Cryptanalysis of a quantum identity-based signature and its improvement
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1