Paper 2023/092
Estimation of Shor's Circuit for 2048-bit Integers based on Quantum Simulator
Abstract
Evaluating exact computational resources necessary for factoring large integers by Shor algorithm using an ideal quantum computer is difficult because simplified circuits were used in past experiments, in which qubits and gates were reduced as much as possible by using the features of the integers, though 15 and 21 were factored on quantum computers. In this paper, we implement Shor algorithm for general composite numbers, and factored 96 RSA-type composite numbers up to 9-bit using a quantum computer simulator. In the largest case,
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- Shor algorithminteger factorizationquantum computerquantum computer simulator
- Contact author(s)
-
j-yamaguchi @ fujitsu com
izu @ fujitsu com - History
- 2023-01-26: approved
- 2023-01-25: received
- See all versions
- Short URL
- https://ia.cr/2023/092
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/092, author = {Junpei Yamaguchi and Masafumi Yamazaki and Akihiro Tabuchi and Takumi Honda and Tetsuya Izu and Noboru Kunihiro}, title = {Estimation of Shor's Circuit for 2048-bit Integers based on Quantum Simulator}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/092}, year = {2023}, url = {https://eprint.iacr.org/2023/092} }