基于质维局部可区分状态的量子秘密共享方案

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL Quantum Information Processing Pub Date : 2024-08-27 DOI:10.1007/s11128-024-04496-6
Kexin Hu, Zhihui Li, Xingjia Wei, Haozhe Duan
{"title":"基于质维局部可区分状态的量子秘密共享方案","authors":"Kexin Hu, Zhihui Li, Xingjia Wei, Haozhe Duan","doi":"10.1007/s11128-024-04496-6","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we first study the maximally commutative set in prime dimensional systems, which is a set of generalized Pauli matrices, and it can be used to detect the local discrimination of generalized Bell states. We give a simple characterization of prime dimensional maximally commutative sets, that is, a subset of a set of generalized Bell states, whose second subscript is a multiple of the first subscript. Furthermore, some sets of generalized Bell states which can be locally distinguishable by one-way local operation and classical communication (LOCC) are constructed by using the structural characteristics of prime dimensional maximally commutative sets. Based on these distinguishable generalized Bell states, we propose a (<i>t</i>, <i>n</i>)-threshold quantum secret sharing scheme. Compared with the existing quantum secret sharing scheme, it can be found that there are enough distinguishable states to encode classical information in our scheme, the dealer only needs to send entangled particles once to make the participants get their secret share, which makes the secret sharing process more efficient than the existing schemes. Finally, we prove that this protocol is secure under dishonest participant attack, interception-and-resend attack and entangle-and-measure attack.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum secret sharing scheme based on prime dimensional locally distinguishable states\",\"authors\":\"Kexin Hu, Zhihui Li, Xingjia Wei, Haozhe Duan\",\"doi\":\"10.1007/s11128-024-04496-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we first study the maximally commutative set in prime dimensional systems, which is a set of generalized Pauli matrices, and it can be used to detect the local discrimination of generalized Bell states. We give a simple characterization of prime dimensional maximally commutative sets, that is, a subset of a set of generalized Bell states, whose second subscript is a multiple of the first subscript. Furthermore, some sets of generalized Bell states which can be locally distinguishable by one-way local operation and classical communication (LOCC) are constructed by using the structural characteristics of prime dimensional maximally commutative sets. Based on these distinguishable generalized Bell states, we propose a (<i>t</i>, <i>n</i>)-threshold quantum secret sharing scheme. Compared with the existing quantum secret sharing scheme, it can be found that there are enough distinguishable states to encode classical information in our scheme, the dealer only needs to send entangled particles once to make the participants get their secret share, which makes the secret sharing process more efficient than the existing schemes. Finally, we prove that this protocol is secure under dishonest participant attack, interception-and-resend attack and entangle-and-measure attack.</p>\",\"PeriodicalId\":746,\"journal\":{\"name\":\"Quantum Information Processing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-08-27\",\"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-04496-6\",\"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-04496-6","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

摘要

本文首先研究了素维系统中的最大交换集,它是广义保利矩阵的集合,可用于检测广义贝尔态的局部判别。我们给出了质维最大交换集的一个简单特征,即广义贝尔态集的一个子集,其第二个下标是第一个下标的倍数。此外,利用质维最大交换集的结构特征,还构建了一些可通过单向局部运算和经典通信(LOCC)进行局部区分的广义贝尔态集。基于这些可区分的广义贝尔态,我们提出了一种(t,n)门限量子秘密共享方案。与现有的量子秘密共享方案相比,我们发现在我们的方案中存在足够多的可区分态来编码经典信息,交易者只需发送一次纠缠粒子就能让参与者得到他们的秘密份额,这使得秘密共享过程比现有方案更高效。最后,我们证明了该协议在不诚实参与者攻击、拦截-发送攻击和纠缠-测量攻击下是安全的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Quantum secret sharing scheme based on prime dimensional locally distinguishable states

In this paper, we first study the maximally commutative set in prime dimensional systems, which is a set of generalized Pauli matrices, and it can be used to detect the local discrimination of generalized Bell states. We give a simple characterization of prime dimensional maximally commutative sets, that is, a subset of a set of generalized Bell states, whose second subscript is a multiple of the first subscript. Furthermore, some sets of generalized Bell states which can be locally distinguishable by one-way local operation and classical communication (LOCC) are constructed by using the structural characteristics of prime dimensional maximally commutative sets. Based on these distinguishable generalized Bell states, we propose a (tn)-threshold quantum secret sharing scheme. Compared with the existing quantum secret sharing scheme, it can be found that there are enough distinguishable states to encode classical information in our scheme, the dealer only needs to send entangled particles once to make the participants get their secret share, which makes the secret sharing process more efficient than the existing schemes. Finally, we prove that this protocol is secure under dishonest participant attack, interception-and-resend attack and entangle-and-measure attack.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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