Skip to content
Frontier Sciences
Quantum Computing
1994
Research

Shor's Algorithm Complexity

T=O((log⁡N)3)T = O((\log N)^3)

Quantum factoring runs in polynomial time—threatening RSA encryption.

By Peter Shor

Frontier Sciences
Shor's Algorithm Complexity
1994 · Peter Shor
Why it matters: Proved quantum computers could solve classically intractable problems.

Discoverers: Peter Shor (1994)

What does it mean?

Quantum factoring runs in polynomial time—threatening RSA encryption.

Why should I care?

Proved quantum computers could solve classically intractable problems.

Variables & Units

SymbolNameUnitMeaning
NNNumber to factor—Semiprime integer
TTTime complexity—Gate operations

Worked Example

Classical: exponential; Quantum: polynomial in log N.

AI Guide (Pro)

Ask questions about equations and get answers grounded in the Equation Universe catalog.

Upgrade to ProTry demo (7 days)

Sources & further reading

Search WikipediaSearch Wolfram MathWorldOpen in Wolfram|AlphaWatch explainers on YouTube

Share this equation

Equation Universe

Shor's Algorithm Complexity

T=O((log⁡N)3)T = O((\log N)^3)

Real-world impact

Quantum technology

Wave mechanics enables next-generation devices.

Photo: Unsplash — quantum hardware

Quantum factoring runs in polynomial time—threatening RSA encryption.

equation-universe.vercel.app

Post