MilestoneTheory & algorithmsConfirmed

Aharonov, Jones and Landau make a quantum knot algorithm explicit

Nov 9, 2005

Dorit Aharonov, Vaughan Jones and Zeph Landau give an explicit polynomial-time quantum algorithm for certain additive approximations of the Jones polynomial, a quantity used to study knots. The result does not make its exact evaluation efficient in general.

Why it matters

Approximating a knot invariant connects topology with the power of quantum computation and supplies an algorithm beyond familiar search and factoring problems.

Dorit Aharonov · Vaughan Jones · Zeph Landau

See it on the timeline