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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Classical Simulation and Computational Optimization of a Shor-Type Modular Exponentiation Circuit

JOHN wayni Santos OLIVEIRA
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Classical Simulation and Computational Optimization of a Shor-Type Modular Exponentiation Circuit

JOHN wayni Santos OLIVEIRA
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Instituto Federal do Maranhão (BR)
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.

Laika access coming soon