Physics – Quantum Physics
Scientific paper
2007-07-19
Quantum Information and Computation Vol. 8 pg. 681 (2008)
Physics
Quantum Physics
29 pages, 12 figures. Improved presentation and removed typos
Scientific paper
It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be strictly weaker than standard quantum computers, but still capable of solving some classically intractable problems. Here we show that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class. That is, a one clean qubit computer can approximate these Jones polynomials in time polynomial in both the number of strands and number of crossings, and the problem of simulating a one clean qubit computer is reducible to approximating the Jones polynomial of the trace closure of a braid.
Jordan Stephen P.
Shor Peter W.
No associations
LandOfFree
Estimating Jones polynomials is a complete problem for 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 polynomials is a complete problem for one clean qubit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimating Jones polynomials is a complete problem for one clean qubit will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-544350