A parallel divide-and-conquer algorithm computes the Jones polynomial of knots, links, and open curves by subdividing into linkoids and grouping states, but the claimed exponential speedup is not rigorously established.
The BQP-hardness of approximating the Jones polynomial
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.GT 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A parallel algorithm for the computation of the Jones polynomial
A parallel divide-and-conquer algorithm computes the Jones polynomial of knots, links, and open curves by subdividing into linkoids and grouping states, but the claimed exponential speedup is not rigorously established.