Aharonov–Jones–Landau algorithm
id:
aharonov-jones-landau-algorithm-255-10658208
title:
Aharonov–Jones–Landau algorithm
text:
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,
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Aharonov%E2%80%93Jones%E2%80%93Landau_algorithm
date created:
date modified:
2024-03-27T18:14:57Z
main entity:
{"identifier":"Q55603358","url":"https://www.wikidata.org/entity/Q55603358"}
image:
fields total:
13
integrity:
13