相关论文: A Polynomial Quantum Algorithm for Approximating t…
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…
In this paper we give a quantum statistical interpretation for the bracket polynomial state sum <K> and for the Jones polynomial. We use this quantum mechanical interpretation to give a new quantum algorithm for computing the Jones…
This paper is a memory of the work and influence of Vaughan Jones. It is an exposition of the remarkable breakthroughs in knot theory and low dimensional topology that were catalyzed by his work. The paper recalls the inception of the Jones…
We use deep neural networks to machine learn correlations between knot invariants in various dimensions. The three-dimensional invariant of interest is the Jones polynomial $J(q)$, and the four-dimensional invariants are the Khovanov…
Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is…
This is a survey talk on one of the best known quantum knot invariants, the colored Jones polynomial of a knot, and its relation to the algebraic/geometric topology and hyperbolic geometry of the knot complement. We review several aspects…
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a…
The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…
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…
This paper gives a generalization of the AJL algorithm and unitary braid group representation for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle of the Jones parameter. We show that our…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
The Slope Conjecture relates a quantum knot invariant, (the degree of the colored Jones polynomial of a knot) with a classical one (boundary slopes of incompressible surfaces in the knot complement). The degree of the colored Jones…
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…
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…
The Jones polynomial of a knot in 3-space is a Laurent polynomial in $q$, with integer coefficients. Many people have pondered why is this so, and what is a proper generalization of the Jones polynomial for knots in other closed…
We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…
Let K be a 3-stranded knot (or link), and let L denote the number of crossings in K. Let $\epsilon_{1}$ and $\epsilon_{2}$ be two positive real numbers such that $\epsilon_{2}$ is less than or equal to 1. In this paper, we create two…
We devise a polynomial-time approximation scheme for the classical geometric problem of finding an approximate short path amid weighted regions. In this problem, a triangulated region P comprising of n vertices, a positive weight associated…
In this manuscript we introduce a method to measure entanglement of curves in 3-space that extends the notion of knot and link polynomials to open curves. We define the bracket polynomial of curves in 3-space and show that it has real…
Univariate polynomial root-finding has been studied for four millennia and very intensively in the last decades. Our new near-optimal root-finders approximate all zeros of a polynomial p almost as fast as one accesses its coefficients with…