Skip to content
#

shors-algorithm

Here are 44 public repositories matching this topic...

A pure Python implementation of Shor's quantum factorisation algorithm using classical matrix operations to simulate quantum circuits. This educational project demonstrates the core concepts of Shor's algorithm without requiring quantum computing frameworks like qiskit, making it accessible for learning how the quantum algorithm works step-by-step.

  • Updated Apr 22, 2026
  • Python

Browser-based Shor's algorithm simulation — modular exponentiation period finding, QFT probability distribution, continued fractions, factor extraction. The reason RSA, ECC, and Diffie-Hellman need replacing. No backends. No simulated shortcuts — the number theory is real.

  • Updated Apr 17, 2026
  • TypeScript

Empirical suite for the Z/6Z Topological Prior. This quantum state preparation protocol uses bounded MPS to confine amplitudes to prime channels, inducing a resilient Non-Ergodic Extended (NEE) phase under Lindblad noise. By passively purging 66.6% of the search space, it massively reduces T-count for FTQC and enables NISQ cryptanalysis.

  • Updated Apr 1, 2026
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the shors-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the shors-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more