Aharonov–Jones–Landau algorithm

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. The algorithm was published in 2009 in a paper written by Dorit Aharonov, Vaughan Jones and Zeph Landau. The error in the additive approximation produced by the Aharonov-Jones-Landau algorithm depends on the input link. Finding an algorithm to additively or multiplicatively approximate the Jones polynomial in a way that the error does not depend on the input link is a #P-hard problem. The problem that the Aharonov-Jones-Landau problem solves is a BQP-complete problem.