Physics – Quantum Physics
Scientific paper
2006-03-08
Physics
Quantum Physics
34 pages. Substantial revision. Increased emphasis on HOMFLYPT, greatly simplified arguments and improved organization
Scientific paper
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the braid group. We use these to provide new quantum algorithms for approximately evaluating a family of specializations of the HOMFLYPT two-variable polynomial of trace closures of braids. We also give algorithms for approximating the Jones polynomial of a general class of closures of braids at roots of unity. Next we provide a self-contained proof of a result of Freedman et al. that any quantum computation can be replaced by an additive approximation of the Jones polynomial, evaluated at almost any primitive root of unity. Our proof encodes two-qubit unitaries into the rectangular representation of the eight-strand braid group. We then give QCMA-complete and PSPACE-complete problems which are based on braids. We conclude with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a #P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the Tutte polynomial and graph coloring.
Wocjan Pawel
Yard Jon
No associations
LandOfFree
The Jones polynomial: quantum algorithms and applications in quantum complexity theory 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 The Jones polynomial: quantum algorithms and applications in quantum complexity theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Jones polynomial: quantum algorithms and applications in quantum complexity theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-447629