With the development of quantum technologies, the performance of quantum computing simulators continues to be matured. Given the potential threat of quantum computing to cyber security, it is required to assess the possibility in practice from a current point of view. In this research, we scalably measure the integer factorization time using Shor's algorithm given numerous numbers in the gate-based quantum computing simulator, simulator\_mps. Also, we show the impact of the pre-selection of Shor's algorithm. Specifically, the pre-selection ensures the success rate of integer factorization with a reduced number of iterations, thereby enabling performance measurement under fixed conditions. The comparative result against the random selection of a parameter shows that the pre-selection of a parameter enables scalable evaluation of integer factorization with high efficiency.

翻译：随着量子技术的发展，量子计算模拟器的性能持续成熟。考虑到量子计算对网络安全的潜在威胁，有必要从当前视角评估其实际可行性。本研究在基于门的量子计算模拟器simulator_mps上，利用Shor算法对大量数字进行了可扩展的整数因式分解时间测量。同时，我们展示了Shor算法预选择的影响。具体而言，预选择通过减少迭代次数确保了整数因式分解的成功率，从而能够在固定条件下进行性能测量。与参数随机选择的对比结果表明，参数预选择能够以高效率实现整数因式分解的可扩展评估。