REVIEW 1 cited by
Quantum Computing and the Jones Polynomial
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum Computing and the Jones Polynomial
read the original abstract
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains open.
Forward citations
Cited by 1 Pith paper
-
A TQFT-based Platform for Efficient Computation of Knot Invariants
A web platform evaluates Chern–Simons invariants of arborescent knots from Feynman ribbon diagrams and claims two-vertex FRDs classify all FRD-like knots through 10 crossings.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.