A Research of the Influence of Quantum Annealing Parameters on the Quality of the Solution of the Number Factorization Problem

V. Korolyov, Oleksandr Khodzinskyi
{"title":"A Research of the Influence of Quantum Annealing Parameters on the Quality of the Solution of the Number Factorization Problem","authors":"V. Korolyov, Oleksandr Khodzinskyi","doi":"10.34229/2707-451x.23.1.2","DOIUrl":null,"url":null,"abstract":"Introduction. Modern information security systems use methods of asymmetric cryptography to transfer encryption keys, which are based on the high computational complexity of factorization of large numbers. Quantum computers (QCs) theoretically make it possible to accelerate the solution of the problem of factorization of numbers in comparison with classical computers and pose a potential threat to information security systems. However, real QCs have a limited number of connections between them and problems with preserving a stable low temperature, which reduces the probability of detecting a global minimum. The joint use of QCs with classical computers based on hybrid cloud services is advisable when the search for the optimal solution by direct methods is a complex problem both in the theoretical sense and in the sense of the required amount of calculations for tasks with specific data. The article proposes a method for improving the accuracy of solving the factorization problem based on multiple minimum search by the method of hardware reverse quantum annealing with a variation of its parameters. The results of numerical experiments for two different QC processors and a hybrid quantum-classical computer by D-Wave are presented, it is shown that the maximum number that can be factorized exclusively by direct annealing is 143, and with a combination of direct and reverse annealing 255. The purpose. Examination of the influence of the parameters of quantum annealing and the corresponding solutions for the adiabatic CC, developed by D-Wave, on the quality of the solution of the factorization problem. To give recommendations for improving the accuracy of solving the factorization problem and increasing the statistical frequency of the appearance of correct pairs of multipliers. Results. Numerical experiments have shown that for the problem of factorization of numbers, the successive application of direct and reverse annealing makes it possible to improve the probability of obtaining the correct pair of multipliers and to more than double the statistical frequency of its occurrence. Quantum annealing modes: pause and quenching reduce the probability of obtaining the correct solution and worsen the statistical frequency of the appearance of correct pairs of multipliers. Conclusions. The use of direct and reverse annealing makes it possible to increase the probability of obtaining the correct solution of the factorization problem for the adiabatic QC of D-Wave. Increasing the calculation time of the problem is justified, since it allows increasing the probability of a correct solution. The use of hybrid quantum-classical computing and cloud services allows factorization for numbers with a bit depth of up to twenty-two bits. Keywords: quantum annealing, factorization of natural numbers, asymmetric shifts, hardening, reverse annealing, combinatorial optimization.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kibernetika ta kompiuterni tekhnologiyi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34229/2707-451x.23.1.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Introduction. Modern information security systems use methods of asymmetric cryptography to transfer encryption keys, which are based on the high computational complexity of factorization of large numbers. Quantum computers (QCs) theoretically make it possible to accelerate the solution of the problem of factorization of numbers in comparison with classical computers and pose a potential threat to information security systems. However, real QCs have a limited number of connections between them and problems with preserving a stable low temperature, which reduces the probability of detecting a global minimum. The joint use of QCs with classical computers based on hybrid cloud services is advisable when the search for the optimal solution by direct methods is a complex problem both in the theoretical sense and in the sense of the required amount of calculations for tasks with specific data. The article proposes a method for improving the accuracy of solving the factorization problem based on multiple minimum search by the method of hardware reverse quantum annealing with a variation of its parameters. The results of numerical experiments for two different QC processors and a hybrid quantum-classical computer by D-Wave are presented, it is shown that the maximum number that can be factorized exclusively by direct annealing is 143, and with a combination of direct and reverse annealing 255. The purpose. Examination of the influence of the parameters of quantum annealing and the corresponding solutions for the adiabatic CC, developed by D-Wave, on the quality of the solution of the factorization problem. To give recommendations for improving the accuracy of solving the factorization problem and increasing the statistical frequency of the appearance of correct pairs of multipliers. Results. Numerical experiments have shown that for the problem of factorization of numbers, the successive application of direct and reverse annealing makes it possible to improve the probability of obtaining the correct pair of multipliers and to more than double the statistical frequency of its occurrence. Quantum annealing modes: pause and quenching reduce the probability of obtaining the correct solution and worsen the statistical frequency of the appearance of correct pairs of multipliers. Conclusions. The use of direct and reverse annealing makes it possible to increase the probability of obtaining the correct solution of the factorization problem for the adiabatic QC of D-Wave. Increasing the calculation time of the problem is justified, since it allows increasing the probability of a correct solution. The use of hybrid quantum-classical computing and cloud services allows factorization for numbers with a bit depth of up to twenty-two bits. Keywords: quantum annealing, factorization of natural numbers, asymmetric shifts, hardening, reverse annealing, combinatorial optimization.
量子退火参数对数因子分解问题解质量的影响研究
介绍。现代信息安全系统采用非对称加密方法传输加密密钥,这种方法是基于大数分解的高计算复杂度。与经典计算机相比,量子计算机在理论上可以加速数字分解问题的解决,但对信息安全系统构成潜在威胁。然而,实际qc之间的连接数量有限,并且存在保持稳定低温的问题,这降低了检测到全局最小值的概率。当通过直接方法寻找最优解在理论意义上和特定数据任务所需的计算量意义上都是一个复杂的问题时,建议将qc与基于混合云服务的经典计算机联合使用。本文提出了一种利用可变参数的硬件反向量子退火方法提高多重最小搜索分解问题求解精度的方法。用D-Wave软件对两种不同的QC处理器和混合量子经典计算机进行了数值实验,结果表明,直接退火能完全分解的最大数目为143个,直接退火和反向退火结合能分解的最大数目为255个。的目的。研究由D-Wave开发的绝热CC的量子退火参数和相应解对分解问题解的质量的影响。为提高解因式分解问题的准确性和增加正确乘数对出现的统计频率提出建议。结果。数值实验表明,对于数字分解问题,连续应用直接退火和反向退火可以提高获得正确乘数对的概率,并使其出现的统计频率增加一倍以上。量子退火模式:暂停和猝灭降低了获得正确解的概率,并使正确乘数对出现的统计频率变差。利用直接退火和反向退火,可以提高D-Wave绝热QC分解问题得到正确解的概率。增加问题的计算时间是合理的,因为它允许增加正确解决方案的概率。混合量子经典计算和云服务的使用允许对位深度高达22位的数字进行因数分解。关键词:量子退火,自然数分解,非对称移位,硬化,反向退火,组合优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
20
审稿时长
6 weeks
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书