Editing Quantum algorithm (section)

===Computing knot invariants===
Witten had shown that the [[Chern-Simons]] [[topological quantum field theory]] (TQFT) can be solved in terms of [[Jones polynomial]]s. A quantum computer can simulate a TQFT, and thereby approximate the Jones polynomial,<ref>
{{Cite conference
 | last1 = Aharonov | first1 = D.
 | last2 = Jones | first2 = V.
 | last3 = Landau | first3 = Z.
 | year = 2006
 | title = A polynomial quantum algorithm for approximating the Jones polynomial
 | book-title=Proceedings of the 38th Annual ACM symposium on Theory of Computing
 | pages = 427–436
 | publisher=[[Association for Computing Machinery]]
 | doi = 10.1145/1132516.1132579
| arxiv = quant-ph/0511096| isbn = 1595931341
 }}</ref> which as far as we know, is hard to compute classically in the worst-case scenario.{{citation needed|date=December 2014}}