Shor's algorithm

A simple Qiskit implementation of Peter Shor's integer factorization quantum algorithm using about $2n+\log{n}+2$ qubits, with a CX count of $168n^3\log{n}$.

References

Khattar and Gidney, Rise of conditionally clean ancillae for efficient quantum circuit constructions arXiv:2407.17966

Häner et. al., Factoring using 2n+2 qubits with Toffoli based modular multiplication arXiv:1611.07995