Published 2009
| public
Journal Article
Estimating Jones and HOMFLY polynomials with one clean qubit
- Creators
- Jordan, Stephen P.
- Wocjan, Pawel
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[18]. 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.
Additional Information
© 2009 Rinton Press. Received August 13, 2008. Revised October 21, 2008. We thank Peter Shor for useful discussions. During the research and writing of this paper SJ was at Center for Theoretical physics at MIT, the Digital Materials Laboratory at RIKEN, and the Institute for Quantum Information at Caltech. SJ thanks these institutions as well as the Army Research Office (ARO), the Disruptive Technology Office (DTO), the Department of Energy (DOE), Eddie Farhi at MIT, Franco Nori and Sahel Ashab at RIKEN, and John Preskill at Caltech. PW gratefully acknowledges support from NSF grants CCF-0726771 and CCF-0746600. PW would like to thank Eddie Farhi's group for their hospitality and the W. M. Keck Foundation for partial support.Additional details
- Eprint ID
- 15625
- Resolver ID
- CaltechAUTHORS:20090904-134456902
- CCF-0726771
- NSF
- CCF-0746600
- NSF
- W. M. Keck Foundation
- Created
-
2009-09-15Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field