改进的测量设备独立协议参数优化方法

IF 0.8 4区 物理与天体物理 Q3 PHYSICS, MULTIDISCIPLINARY
Zhou Jiang-Ping, Zhou Yuan-Yuan, Zhou Xue-Jun
{"title":"改进的测量设备独立协议参数优化方法","authors":"Zhou Jiang-Ping, Zhou Yuan-Yuan, Zhou Xue-Jun","doi":"10.7498/aps.72.20230179","DOIUrl":null,"url":null,"abstract":"The optimal selection of parameters in practical quantum key distribution can greatly improve the key generation rate and maximum transmission distance of the system. Due to the high cost of global search algorithm, local search algorithm is widely used. However, there are two vulnerabilities in local search algorithm, one is that the solution obtained is not always the global optimal solution, the other is that the effectiveness of the algorithm is greatly dependent on the choice of initial value. It is different from the previous article that this paper uses the Monte Carlo method to prove whether the key generation rate function is convex, and also simulates and analyzes the projection of key generation rate function on each dimension of the parameter. In order to eliminate the effect of the initial value, this paper proposes the particle swarm local search optimization algorithm which is combining particle swarm optimization algorithm and local search algorithm. The first step is using the particle swarm optimization to find a valid parameter which leads to nonzero key generation rate, the second step is using the parameter as the initial value of local search algorithm to derive the global optimal solution. Then, the two algorithms are simulated and compared. The results show that the key generation rate function is non-convex because it does not satisfy the definition of a convex function, however, since the key generation rate function has only one non-zero stagnation point, the LSA algorithm can still obtain the global optimal solution with a proper initial value, when the transmission distance is relatively long, the local search algorithm is invalid because it is difficult to obtain an effective initial value by random value method. Particle swarm optimization algorithm can overcome this shortcoming and improve the maximum transmission distance of the system at the cost of slightly increasing the complexity of the algorithm.","PeriodicalId":6995,"journal":{"name":"物理学报","volume":"91 1","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved parameter optimization method for measurement device independent protocol\",\"authors\":\"Zhou Jiang-Ping, Zhou Yuan-Yuan, Zhou Xue-Jun\",\"doi\":\"10.7498/aps.72.20230179\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The optimal selection of parameters in practical quantum key distribution can greatly improve the key generation rate and maximum transmission distance of the system. Due to the high cost of global search algorithm, local search algorithm is widely used. However, there are two vulnerabilities in local search algorithm, one is that the solution obtained is not always the global optimal solution, the other is that the effectiveness of the algorithm is greatly dependent on the choice of initial value. It is different from the previous article that this paper uses the Monte Carlo method to prove whether the key generation rate function is convex, and also simulates and analyzes the projection of key generation rate function on each dimension of the parameter. In order to eliminate the effect of the initial value, this paper proposes the particle swarm local search optimization algorithm which is combining particle swarm optimization algorithm and local search algorithm. The first step is using the particle swarm optimization to find a valid parameter which leads to nonzero key generation rate, the second step is using the parameter as the initial value of local search algorithm to derive the global optimal solution. Then, the two algorithms are simulated and compared. The results show that the key generation rate function is non-convex because it does not satisfy the definition of a convex function, however, since the key generation rate function has only one non-zero stagnation point, the LSA algorithm can still obtain the global optimal solution with a proper initial value, when the transmission distance is relatively long, the local search algorithm is invalid because it is difficult to obtain an effective initial value by random value method. Particle swarm optimization algorithm can overcome this shortcoming and improve the maximum transmission distance of the system at the cost of slightly increasing the complexity of the algorithm.\",\"PeriodicalId\":6995,\"journal\":{\"name\":\"物理学报\",\"volume\":\"91 1\",\"pages\":\"\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"物理学报\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.7498/aps.72.20230179\",\"RegionNum\":4,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"物理学报","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.7498/aps.72.20230179","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

在实际的量子密钥分配中,参数的优化选择可以大大提高密钥的生成速率和系统的最大传输距离。由于全局搜索算法的成本较高,局部搜索算法被广泛使用。然而,局部搜索算法存在两个漏洞,一是得到的解并不总是全局最优解,二是算法的有效性很大程度上依赖于初始值的选择。与前一篇文章不同的是,本文采用蒙特卡罗方法来证明密钥生成率函数是否为凸,并模拟分析了密钥生成率函数在参数各维上的投影。为了消除初始值的影响,本文提出了将粒子群优化算法与局部搜索算法相结合的粒子群局部搜索优化算法。第一步是利用粒子群算法寻找一个有效的参数,使密钥生成率达到非零,第二步是利用该参数作为局部搜索算法的初始值,推导出全局最优解。然后,对两种算法进行了仿真和比较。结果表明,由于密钥生成速率函数不满足凸函数的定义,因此它是非凸的,但由于密钥生成速率函数只有一个非零的驻点,因此LSA算法仍然可以获得具有适当初始值的全局最优解,当传输距离较长时,局部搜索算法由于难以通过随机值方法获得有效的初始值而无效。粒子群优化算法可以克服这一缺点,以略微增加算法复杂度为代价提高系统的最大传输距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved parameter optimization method for measurement device independent protocol
The optimal selection of parameters in practical quantum key distribution can greatly improve the key generation rate and maximum transmission distance of the system. Due to the high cost of global search algorithm, local search algorithm is widely used. However, there are two vulnerabilities in local search algorithm, one is that the solution obtained is not always the global optimal solution, the other is that the effectiveness of the algorithm is greatly dependent on the choice of initial value. It is different from the previous article that this paper uses the Monte Carlo method to prove whether the key generation rate function is convex, and also simulates and analyzes the projection of key generation rate function on each dimension of the parameter. In order to eliminate the effect of the initial value, this paper proposes the particle swarm local search optimization algorithm which is combining particle swarm optimization algorithm and local search algorithm. The first step is using the particle swarm optimization to find a valid parameter which leads to nonzero key generation rate, the second step is using the parameter as the initial value of local search algorithm to derive the global optimal solution. Then, the two algorithms are simulated and compared. The results show that the key generation rate function is non-convex because it does not satisfy the definition of a convex function, however, since the key generation rate function has only one non-zero stagnation point, the LSA algorithm can still obtain the global optimal solution with a proper initial value, when the transmission distance is relatively long, the local search algorithm is invalid because it is difficult to obtain an effective initial value by random value method. Particle swarm optimization algorithm can overcome this shortcoming and improve the maximum transmission distance of the system at the cost of slightly increasing the complexity of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
物理学报
物理学报 物理-物理:综合
CiteScore
1.70
自引率
30.00%
发文量
31245
审稿时长
1.9 months
期刊介绍: Acta Physica Sinica (Acta Phys. Sin.) is supervised by Chinese Academy of Sciences and sponsored by Chinese Physical Society and Institute of Physics, Chinese Academy of Sciences. Published by Chinese Physical Society and launched in 1933, it is a semimonthly journal with about 40 articles per issue. It publishes original and top quality research papers, rapid communications and reviews in all branches of physics in Chinese. Acta Phys. Sin. enjoys high reputation among Chinese physics journals and plays a key role in bridging China and rest of the world in physics research. Specific areas of interest include: Condensed matter and materials physics; Atomic, molecular, and optical physics; Statistical, nonlinear, and soft matter physics; Plasma physics; Interdisciplinary physics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信