Quantum algorithm: Difference between revisions

Revision as of 15:07, 20 October 2010

Revision as of 21:58, 21 November 2010

Line 165:

Witten had shown that the [[Chern-Simons]] [[topological quantum field theory]] can be solved in terms of [[Jones polynomial]]s. A quantum computer can simulate a TQFT, and thereby approximate the Jones polynomial

<ref>

{{Cite journal

{{Citation

| last = Aharonov

| first = Dorit

Line 186:

| archiveurl =

| archivedate =

| doi = http://doi.acm.org/10.1145/1132516.1132579

| id = }}

| postscript = <!-- Bot inserted parameter. Either remove it; or change its value to "." for the cite to end in a ".", as necessary. -->{{inconsistent citations}} }}

</ref>, which as far as we know, is hard to compute classically in the worst case scenario.