Constructios of l-adic t-deletion-correcting quantum codes

R. Matsumoto, M. Hagiwara
{"title":"Constructios of l-adic t-deletion-correcting quantum codes","authors":"R. Matsumoto, M. Hagiwara","doi":"10.1587/transfun.2021EAP1034","DOIUrl":null,"url":null,"abstract":"SUMMARY We propose two systematic constructions of deletion-correcting codes for protecting quantum inforomation. The first one works with qudits of any dimension ‘ , which is re- ferred to as ‘ -adic, but only one deletion is corrected and the constructed codes are asymptotically bad. The second one cor- rects multiple deletions and can construct asymptotically good codes. The second one also allows conversion of stabilizer-based quantum codes to deletion-correcting codes, and entanglement","PeriodicalId":348826,"journal":{"name":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1587/transfun.2021EAP1034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

SUMMARY We propose two systematic constructions of deletion-correcting codes for protecting quantum inforomation. The first one works with qudits of any dimension ‘ , which is re- ferred to as ‘ -adic, but only one deletion is corrected and the constructed codes are asymptotically bad. The second one cor- rects multiple deletions and can construct asymptotically good codes. The second one also allows conversion of stabilizer-based quantum codes to deletion-correcting codes, and entanglement
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
l进t缺失校正量子码的构造
为了保护量子信息,我们提出了两种系统的删除纠错码结构。第一种方法适用于任何维度的量数,这被称为“进数”,但只有一个删除被纠正,并且构造的代码是渐近坏的。第二种方法可以纠正多次删除,并能构造渐近良好的码。第二种还允许将基于稳定器的量子码转换为删除校正码和纠缠
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Erratum: Concatenated Permutation Codes under Chebyshev Distance [IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Vol. E106.A (2023), No. 3 pp.616-632] Automorphism Shuffles for Graphs and Hypergraphs and Its Applications Erratum: A Compact Digital Signature Scheme Based on the Module-LWR Problem [IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Vol. E104.A (2021), No. 9 pp.1219-1234] Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields Ramsey Numbers of Trails
×
引用
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