Shor's Algorithm: Quantum Factorization Demo

Demonstrating quantum supremacy in integer factorization using Qiskit

This project implements Shor’s Algorithm to factor small composite numbers (e.g., 15, 21) on a quantum simulator. It showcases how quantum computing can solve classically hard problems like integer factorization exponentially faster.

Target: Factor N = 15 using quantum period-finding
Framework: Qiskit (IBM Quantum SDK)
Run Locally: Simulated quantum backend
Educational Focus: Quantum algorithms, cryptography, QFT

---

Prerequisites

• Python 3.8+
• Qiskit (pip install qiskit)
• Matplotlib (for visualization)

Install dependencies:

pip install -r requirements.txt