REVIEW 1 cited by
Estimating Jones and HOMFLY polynomials with One Clean Qubit
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
read the original abstract
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class. This is the class of problems solvable in polynomial time on a quantum computer acting on an initial state in which one qubit is pure and the rest are maximally mixed. Here we generalize this result by showing that one clean qubit computers can efficiently approximate the Jones and single-variable HOMFLY polynomials of the trace closure of a braid at any root of unity.
Forward citations
Cited by 1 Pith paper
-
A quantum algorithm for Khovanov homology
A conditional quantum algorithm for estimating the Betti numbers of Khovanov homology, together with DQC1, BQP, and #P hardness results for harder approximation regimes.
Discussion (0). Continue with ORCID to comment.