Enhanced Scalability in Assessing Quantum Integer Factorization Performance
Abstract: With the advancement of quantum technologies, there is a potential threat to traditional encryption systems based on integer factorization. Therefore, developing techniques for accurately measuring the performance of associated quantum algorithms is crucial, as it can provide insights into the practical feasibility from the current perspective. In this chapter, we aim to analyze the time required for integer factorization tasks using Shor's algorithm within a gate-based quantum circuit simulator of the matrix product state type. Additionally, we observe the impact of parameter pre-selection in Shor's algorithm. Specifically, this pre-selection is expected to increase the success rate of integer factorization by reducing the number of iterations and facilitating performance measurement under fixed conditions, thus enabling scalable performance evaluation even on real quantum hardware.
- P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th annual symposium on foundations of computer science, pp. 124–134, Ieee, 1994.
- L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 212–219, 1996.
- P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review, vol. 41, no. 2, pp. 303–332, 1999.
- X. Bonnetain, M. Naya-Plasencia, and A. Schrottenloher, “Quantum security analysis of aes,” IACR Transactions on Symmetric Cryptology, vol. 2019, no. 2, pp. 55–93, 2019.
- S. P. Jordan and Y.-K. Liu, “Quantum cryptanalysis: shor, grover, and beyond,” IEEE Security & Privacy, vol. 16, no. 5, pp. 14–21, 2018.
- E. Gerjuoy, “Shor’s factoring algorithm and modern cryptography. an illustration of the capabilities inherent in quantum computers,” American journal of physics, vol. 73, no. 6, pp. 521–540, 2005.
- M. Grassl, B. Langenberg, M. Roetteler, and R. Steinwandt, “Applying grover’s algorithm to aes: quantum resource estimates,” in Post-Quantum Cryptography: 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24-26, 2016, Proceedings 7, pp. 29–43, Springer, 2016.
- R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, 1978.
- M. J. Dworkin, E. B. Barker, J. R. Nechvatal, J. Foti, L. E. Bassham, E. Roback, and J. F. Dray Jr, “Advanced encryption standard (aes),” 2001.
- S. Jiang, K. A. Britt, A. J. McCaskey, T. S. Humble, and S. Kais, “Quantum annealing for prime factorization,” Scientific reports, vol. 8, no. 1, p. 17667, 2018.
- R. Dridi and H. Alghassi, “Prime factorization using quantum annealing and computational algebraic geometry,” Scientific reports, vol. 7, no. 1, pp. 1–10, 2017.
- W. Peng, B. Wang, F. Hu, Y. Wang, X. Fang, X. Chen, and C. Wang, “Factoring larger integers with fewer qubits via quantum annealing with optimized parameters,” SCIENCE CHINA Physics, Mechanics & Astronomy, vol. 62, pp. 1–8, 2019.
- B. Wang, F. Hu, H. Yao, and C. Wang, “Prime factorization algorithm based on parameter optimization of ising model,” Scientific reports, vol. 10, no. 1, pp. 1–10, 2020.
- J. Preskill, “Quantum computing in the nisq era and beyond,” Quantum, vol. 2, p. 79, 2018.
- S. W. Shin, G. Smith, J. A. Smolin, and U. Vazirani, “How” quantum” is the d-wave machine?,” arXiv preprint arXiv:1401.7087, 2014.
- M. W. Johnson, M. H. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, et al., “Quantum annealing with manufactured spins,” Nature, vol. 473, no. 7346, pp. 194–198, 2011.
- K. Jeong, “Sample-size-reduction of quantum states for the noisy linear problem,” Annals of Physics, p. 169215, 2023.
- P. Hayden, D. Leung, P. W. Shor, and A. Winter, “Randomizing quantum states: Constructions and applications,” Communications in Mathematical Physics, vol. 250, pp. 371–391, 2004.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.