A Scalable Evaluation of Integer Factorization Performance on IBM Quantum Simulator

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.