The hardware experiment
Sometimes It’s Too Slow… for Shor!!
Follow the implementation from order-finding circuits to IBM hardware, then examine what the measured outcomes and classical recovery actually show.
Read on Medium← All projectsProject 03 / 12 · research
Quantum FactoringA series by Monit Sharma
Essays / Hardware / Code
Shor’s algorithm.
Beyond the headline.
From the algorithm on paper to the experiment on a chip—and the evidence that connects them.
A route through the collection
Start with the experiment.
Keep asking what it proves.
The evidence behind the claim
The Emperor Has No Factors
Revisit published factoring demonstrations through null baselines, post-processing choices, and the distinction between recovering factors and observing useful quantum signal.
Read on MediumThe engineering gap
The Fault in our Qubits
Explore the cost of moving from small demonstrations to useful factoring, including circuit depth, error correction, and the assumptions behind resource estimates.
Read on MediumReading a resource estimate
To You, 10,000 Qubits From Now
Look beyond a headline qubit count to the architecture, runtime, and error-correction assumptions in a neutral-atom factoring proposal.
Read on MediumThe other half of the series
Read it.
Then inspect it.
The companion repository contains the implementation and analysis scripts referenced in the essays. Begin with the README for setup and the distinction between strict and exploratory metrics.
shor/ + experiments/
Order finding & hardware experiments
Circuit construction, modular multiplication, execution helpers, sweep runners, and strict post-processing for toy-scale studies.
scorecard_engine.py
Factoring scorecards
The analysis engine accompanying the discussion of published factoring claims and their classical null baselines.
part_iii/resource_estimation.py
Resource estimates
The calculation code behind the series’ discussion of scaling and the resources required for larger factoring problems.
The implementation is designed for small order-finding experiments; its permutation-based oracle is not a scalable factoring construction.