Related papers: Estimating Jones and HOMFLY polynomials with One C…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
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…
In this work, we give a formula for the logarithmic invariant of knots in terms of certain derivatives of the colored Jones invariant. This invariant is related to the logarithmic conformal field theory, and was defined by using the centers…
In this paper it is shown that given a sufficient number of (noisy) random binary linear equations, the Learning from Parity with Noise (LPN) problem can be solved in essentially cube root time in the number of unknowns. The techniques used…
With the help of the evolution method we calculate all HOMFLY polynomials in all symmetric representations [r] for a huge family of (generalized) pretzel links, which are made from g+1 two strand braids, parallel or antiparallel, and depend…
Using an involved study of the Jones polynomial, we determine, as our main result, the crossing numbers of (prime) amphicheiral knots. As further applications, we show that several classes of links, including semiadequate links and…
Circuit topology employs fundamental units of entanglement, known as soft contacts, for constructing knots from the bottom up, utilising circuit topology relations, namely parallel, series, cross, and concerted relations. In this article,…
We show that the family of colored Jones polynomials of the closure of a braid compute weighted sums of abelianized Lefschetz numbers associated with the action of the braid on configuration spaces. The sum is over the number of…
Explicit answer is given for the HOMFLY polynomial of the figure eight knot $4_1$ in arbitrary symmetric representation R=[p]. It generalizes the old answers for p=1 and 2 and the recently derived results for p=3,4, which are fully…
Khovanov homology is a categorification of the Jones polynomial, so it may be seen as a kind of quantum invariant of knots and links. Although polynomial quantum invariants are deeply involved with Vassiliev (aka. finite type) invariants,…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…
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…
In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well…
Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G.…
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We compare several different possible definitions. Our main…
In the first of these two lectures, I describe a gauge theory approach to understanding quantum knot invariants as Laurent polynomials in a complex variable q. The two main steps are to reinterpret three-dimensional Chern-Simons gauge…
We propose a quantum machine learning task that is provably easy for quantum computers and arguably hard for classical ones. The task involves predicting quantities of the form $\mathrm{Tr}[f(H)\rho]$, where $f$ is an unknown function,…
This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…
Jones and Boston conjectured that the factorization process for iterates of irreducible quadratic polynomials over finite fields is approximated by a Markov model. In this paper, we find unexpected and intricate behavior for some quadratic…