相关论文: The Jones polynomial: quantum algorithms and appli…

In this article we shall give an account of certain developments in knot theory which followed upon the discovery of the Jones polynomial in 1984. The focus of our account will be recent glimmerings of understanding of the topological…

Obtaining a closed-form expression for the colored HOMFLY-PT polynomials of knots from $3$-strand braids carrying arbitrary $SU(N)$ representation is a challenging problem. In this paper, we confine our interest to twisted generalized…

This is a systematic introduction for physicists to the theory of algebras and groups with braid statistics, as developed over the last three years by the author. There are braided lines, braided planes, braided matrices and braided groups…

In an earlier paper the first author defined a non-commutative A-polynomial for knots in 3-space, using the colored Jones function. The idea is that the colored Jones function of a knot satisfies a non-trivial linear q-difference equation.…

We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…

Many structures in science, engineering, and art can be viewed as curves in 3-space. The entanglement of these curves plays a crucial role in determining the functionality and physical properties of materials. Many concepts in knot theory…

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed…

Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

We address the question: Does there exist a non-trivial knot with a trivial Jones polynomial? To find such a knot, it is almost certainly sufficient to find a non-trivial braid on four strands in the kernel of the Burau representation. I…

We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…

In the first 36 pages of this paper, we provide polynomial quantum algorithms for additive approximations of the Tutte polynomial, at any point in the Tutte plane, for any planar graph. This includes as special cases the AJL algorithm for…

We investigate the braid group representations arising from categories of representations of twisted quantum doubles of finite groups. For these categories, we show that the resulting braid group representations always factor through finite…

We establish an identification between the spaces of $\alpha$-fusion trees in non-semisimple topological quantum computation (NSS TQC) and a family of homological representations of the braid group known as the Lawrence representations…

We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…

The fundamental group $\pi_1(L)$ of a knot or link $L$ may be used to generate magic states appropriate for performing universal quantum computation and simultaneously for retrieving complete information about the processed quantum states.…

We introduce an algebraic theory of integration on quantum planes and other braided spaces. In the one dimensional case we obtain a novel picture of the Jackson $q$-integral as indefinite integration on the braided group of functions in one…

Measuring the entanglement complexity of collections of open curves in 3-space has been an intractable, yet pressing mathematical problem, relevant to a plethora of physical systems, such as in polymers and biopolymers. In this manuscript,…

The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…

We present an elementary introduction to one of the most important today knot theory approaches, which gives rise to a representation for a class of knot polynomials in terms of quantum groups. Historically, the approach was at the same…