Successful Shor's Factorization of N=1031167 using the IBM Quantum Systems

So far, the highest number factorized on a quantum computer using Shor’s algorithm was 35. This poster shows that much larger numbers can be factorized using this algorithm on current quantum computers. The factorization of number 1031167, along with the quantum circuits used and results from the IBM quantum systems ibm_brisbane and ibm_kyoto, is shown. Shor’s algorithm was proposed in 1994, but only now has quantum technology evolved to such a level that its realization has become possible. The bottleneck of this algorithm is the implementation of the modular exponentiation function (MEF), which is also the subject of this poster. Thanks to the appropriately chosen parameter "a", this implementation was quite simple. Therefore, it was not a problem to use the Qiskit framework to program and run the necessary quantum circuits on the IBM quantum systems. The measured results of the whole circuit were then accurate enough to determine both factors. Since they were correct, it can be stated that the highest number factorized by a quantum computer using Shor's algorithm is now 1031167.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-12-03
DOI
https://doi.org/10.5281/zenodo.17806923
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Successful Shor's Factorization of N=1031167 using the IBM Quantum Systems

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

Successful Shor's Factorization of N=1031167 using the IBM Quantum Systems

article en

Abstract

So far, the highest number factorized on a quantum computer using Shor’s algorithm was 35. This poster shows that much larger numbers can be factorized using this algorithm on current quantum computers. The factorization of number 1031167, along with the quantum circuits used and results from the IBM quantum systems ibm_brisbane and ibm_kyoto, is shown. Shor’s algorithm was proposed in 1994, but only now has quantum technology evolved to such a level that its realization has become possible. The bottleneck of this algorithm is the implementation of the modular exponentiation function (MEF), which is also the subject of this poster. Thanks to the appropriately chosen parameter "a", this implementation was quite simple. Therefore, it was not a problem to use the Qiskit framework to program and run the necessary quantum circuits on the IBM quantum systems. The measured results of the whole circuit were then accurate enough to determine both factors. Since they were correct, it can be stated that the highest number factorized by a quantum computer using Shor's algorithm is now 1031167.

Zenodo (CERN European Organization for Nuclear Research)
VSB - Technical University of Ostrava (CZ)
Openalex Percentile: Top 21%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Successful Shor's Factorization of N=1031167 using the IBM Quantum Systems · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS