Aharonov–Jones–Landau algorithm (original) (raw)

In computer science, the Aharonov–Jones–Landau algorithm is an efficient quantum algorithm for obtaining an additive approximation of the Jones polynomial of a given link at an arbitrary root of unity. Finding a multiplicative approximation is a #P-hard problem, so a better approximation is considered unlikely. However, it is known that computing an additive approximation of the Jones polynomial is a BQP-complete problem. The algorithm was published in 2009 in a paper written by Dorit Aharonov, Vaughan Jones and .