Shor's quantum factoring via modular exponentiation and period finding (quantum)

Layer 1 — Physicsin the quantum subtree

Quantum application of L0 multiplication and Peano successor. Shor's 1994/1997 algorithm factors an integer N in polynomial time on a quantum computer. Its central primitive is the controlled modular-exponentiation unitary U|x⟩|0⟩ =…

Related concepts

Explore Shor's quantum factoring via modular exponentiation and period finding (quantum) on the interactive knowledge graph →