Why does quantum algorithms matter?

The whole justification for building quantum computers is that these algorithms exist. Shor's algorithm can break the encryption protecting most of the internet today. Chemistry algorithms could simulate molecules exactly — the holy grail of drug and materials design. Optimization algorithms tackle scheduling, routing, and finance problems classical methods struggle with.

Grover's Is Provably Optimal

No quantum search can do better than √N — Grover already reaches it.

VQE Runs On Today's Hardware

The Variational Quantum Eigensolver is friendly to noisy near-term machines.

HHL Solves Linear Systems

Exponentially fast — under specific structural conditions.

Only ~60 Algorithms Are Known

The Quantum Algorithm Zoo lists roughly 60 distinct quantum algorithms.

Concepts

Concept / Quantum Algorithms

Quantum Algorithms.

The recipes that actually let quantum computers beat classical ones.

A quantum algorithm is a program written for a quantum computer. The famous ones — Shor's, Grover's, HHL, VQE, QAOA — are the reasons we're building these machines in the first place. Each exploits superposition and entanglement to solve a specific problem faster than any classical method.

Shor's Broke Cryptography

In 1994 Peter Shor gave the world an algorithm that factors RSA numbers exponentially fast.

In plain English.

A quantum algorithm is a recipe. You put qubits in, apply a specific sequence of gates, and measure the output.

The clever part is designing the recipe so that the right answers get amplified and wrong answers cancel — even though you're exploring every possibility at once.

Only a handful of algorithms give real speedups. Finding new ones is a small but very active research field.

Why it matters.

The whole justification for building quantum computers is that these algorithms exist.
Shor's algorithm can break the encryption protecting most of the internet today.
Chemistry algorithms could simulate molecules exactly — the holy grail of drug and materials design.
Optimization algorithms tackle scheduling, routing, and finance problems classical methods struggle with.

Timeline — past and future.

What already happened, and what's next for quantum algorithms.

1985
Deutsch's algorithm — the first quantum algorithm ever.
1994
Shor's algorithm for factoring.
1996
Grover's algorithm for search.
2008
HHL algorithm for linear systems.
2014
VQE and QAOA — algorithms designed for noisy near-term machines.
2019
Google's Sycamore runs a sampling algorithm no classical computer could.
2030Forecast
The first commercially valuable quantum algorithm runs at scale.

Where it shows up.

Cryptanalysis

Shor's algorithm factors big numbers — the basis of RSA — exponentially fast.

Search

Grover's algorithm searches unstructured data in √N time.

Chemistry

VQE computes ground-state energies of molecules.

Optimization

QAOA attacks combinatorial problems like scheduling and portfolio balancing.

Previous concept

Quantum Gates

Next concept