Title

The Jones Polynomial: Quantum Algorithms And Applications In Quantum Complexity Theory

Keywords

Quantum algorithms; Quantum complexity theory; Topological quantum computation

Abstract

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. © Rinton Press.

Publication Date

1-1-2008

Publication Title

Quantum Information and Computation

Volume

8

Issue

1-2

Number of Pages

147-180

Document Type

Article

Personal Identifier

scopus

Socpus ID

49349101553 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/49349101553

This document is currently not available here.

Share

COinS