Classical Simulation and Computational Optimization of a Shor-Type Modular Exponentiation Circuit
This work presents a classical simulation framework for circuit components associated with the modular-exponentiation and order-finding stages of Shor’s factoring algorithm. The study examines five experimental cases and combines reversible state evolution, a dual-uint64 representation, Numba just-in-time execution, sparse grouping of phase amplitudes, and Fourier analysis. Its principal contribution is an occupancy-aware Fourier procedure that evaluates singleton groups analytically and applies the conventional fast Fourier transform only to groups containing multiple occupied phase positions. For the instance N = 4,028,033, this procedure reduced the number of FFT calls from 60,970 to 4,566 and decreased the measured Fourier-processing time from 197.68 seconds to 18.11 seconds, a reduction of 90.84%. All five selected cases satisfied the seven adopted validation criteria. The work concerns computational optimization of a classical simulation pipeline; it does not claim execution on quantum hardware, quantum computational advantage, or a new factoring algorithm. The experimental dataset supporting this study is publicly available through Harvard Dataverse: https://doi.org/10.7910/DVN/OOYKSC.
Authors
- JOHN wayni Santos OLIVEIRA (ORCID: https://orcid.org/0009-0009-1051-3401)
Institutions
- Instituto Federal do Maranhão (BR)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.5281/zenodo.24178872
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- preprint