Estimating Jones polynomials is a complete problem for one clean qubit

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[13, 3, 1]. 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 [21]. 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.

[1]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[2]  Thomas G. Draper.  Addition on a Quantum Computer , 2000, quant-ph/0008033.

[3]  D. Coppersmith.  An approximate Fourier transform useful in quantum factoring , 2002, quant-ph/0201067.

[4]  Michael Larsen,et al.  A Modular Functor Which is Universal¶for Quantum Computation , 2000, quant-ph/0001108.

[5]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[6]  V. Jones.  A polynomial invariant for knots via von Neumann algebras , 1985 .

[7]  R Laflamme,et al.  Characterization of complex quantum dynamics with a scalable NMR information processor. , 2005, Physical review letters.

[8]  Umesh V. Vazirani,et al.  Molecular scale heat engines and scalable quantum computation , 1999, STOC '99.

[9]  Raymond Laflamme,et al.  Quantum Computation and Quadratically Signed Weight Enumerators , 1999, ArXiv.

[10]  Dorit Aharonov,et al.  The BQP-hardness of approximating the Jones polynomial , 2006, ArXiv.

[11]  E. Knill,et al.  Power of One Bit of Quantum Information , 1998, quant-ph/9802037.

[12]  Thomas G. Draper,et al.  A new quantum ripple-carry addition circuit , 2004, quant-ph/0410184.

[13]  A. Datta,et al.  Entanglement and the power of one qubit , 2005, quant-ph/0505213.

[14]  Pawel Wocjan,et al.  The Jones polynomial: quantum algorithms and applications in quantum complexity theory , 2008, Quantum Inf. Comput..

[15]  Jeffrey C. Lagarias,et al.  The computational complexity of knot and link problems , 1999, JACM.

[16]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[17]  Yasuhiro Takahashi,et al.  A quantum circuit for shor's factoring algorithm using 2n + 2 qubits , 2006, Quantum Inf. Comput..

[18]  A. Kitaev.  Quantum computations: algorithms and error correction , 1997 .

[19]  Dan Shepherd.  Computation with Unitaries and One Pure Qubit , 2006 .

[20]  A BarringtonDavid.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1989 .

[21]  Andris Ambainis,et al.  Computing with highly mixed states , 2006, JACM.

[22]  Raymond Laflamme,et al.  Quantum computing and quadratically signed weight enumerators , 2001, Inf. Process. Lett..

[23]  M. Freedman,et al.  Simulation of Topological Field Theories¶by Quantum Computers , 2000, quant-ph/0001071.

[24]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.

[25]  Barenco,et al.  Approximate quantum Fourier transform and decoherence. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[26]  Dorit Aharonov,et al.  A Polynomial Quantum Algorithm for Approximating the Jones Polynomial , 2008, Algorithmica.

[27]  R. Laflamme,et al.  Exponential speedup with a single bit of quantum information: measuring the average fidelity decay. , 2003, Physical review letters.

[28]  D. Aharonov,et al.  Polynomial Quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane Preliminary Version , 2008 .

[29]  Edward Witten,et al.  Quantum field theory and the Jones polynomial , 1989 .

[30]  Louis H. Kauffman,et al.  $q$ - Deformed Spin Networks, Knot Polynomials and Anyonic Topological Quantum Computation , 2006 .