Zhiqi Liu1, Shihui Zheng1, Xingyu Yan1, Ping Pan1,2, Licheng Wang1,3,*
Journal of Quantum Computing, Vol.5, pp. 41-54, 2023, DOI:10.32604/jqc.2023.045572
Abstract The hardness of the integer factoring problem (IFP) plays a core role in the security of RSA-like cryptosystems that are widely used today. Besides Shor’s quantum algorithm that can solve IFP within polynomial time, quantum annealing algorithms (QAA) also manifest certain advantages in factoring integers. In experimental aspects, the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms. In this paper, we report some interesting observations about the effects of QAA for solving IFP. More specifically, we introduce a metric, More >
Login
Register
