shor

What problem does it solve?

Shor's algorithm factors a given composite integer efficiently by reducing factoring to quantum period finding and classical post-processing.

Core Features & Use Cases

• Quantum period finding using QPE and IQFT to derive the order r.
• Two circuit implementations: matrix-based modular exponentiation and operator-based modular addition.
• Classical post-processing with continued fractions to extract factors and a retry mechanism for challenging cases.
• Educational and demonstrative use: factor small integers like 15 or 21 to illustrate the workflow.

Quick Start

Use a small factoring example with N=15 using the matrix method to observe factors.