Estimating Jones and HOMFLY polynomials with One Clean Qubit

Details Estimating Jones and HOMFLY polynomials with One Clean Qubit Estimating Jones and HOMFLY polynomials with One Clean Qubit

2008-07-29

arxiv.org/abs/0807.4688v2

Quantum Information and Computation Vol. 9 pg. 264 (2009)

Physics

Quantum Physics

22 pages, 11 figures, revised in response to referee comments

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Estimating Jones and HOMFLY polynomials with One Clean Qubit does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Estimating Jones and HOMFLY polynomials with One Clean Qubit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimating Jones and HOMFLY polynomials with One Clean Qubit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38966