Related papers: Quantum Algorithms for the Jones Polynomial
We generalize Kauffman's famous formula defining the Jones polynomial of an oriented link in 3-space from his bracket and the writhe of an oriented diagram. Our generalization is an epimorphism between skein modules of tangles in compact…
A braid-like isotopy for links in 3-space is an isotopy which uses only those Reidemeister moves which occur in isotopies of braids. We define a refined Jones polynomial and its corresponding Khovanov homology which are, in general, only…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a…
In quantum mechanics, geometry has been demonstrated as a useful tool for inferring non-classical behaviors and exotic properties of quantum systems. One standard approach to illustrate the geometry of quantum systems is to project the…
An elementary introduction to Khovanov construction of superpolynomials. Despite its technical complexity, this method remains the only source of a definition of superpolynomials from the first principles and therefore is important for…
To each local field (including the real or complex numbers) we associate a quantum dilogarithm and show that it satisfies a pentagon identity and some symmetries. Using an angled version of these quantum dilogarithms, we construct three…
This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…
The kernel polynomial method allows to sample overall spectral properties of a quantum system, while sparse diagonalization provides accurate information about a few important states. We present a method combining these two approaches…
This work presents formulas for the Kauffman bracket and Jones polynomials of 3-bridge knots using the structure of Chebyshev knots and their billiard table diagrams. In particular, these give far fewer terms than in the Skein relation…
In this paper, a method is given to calculate the Jones polynomial of the 6-plat presentations of knots by using a representation of the braid group $\mathbb{B}_6$ into a group of $5\times 5$ matrices. We also can calculate the Jones…
We study a quantum version of the $n$-dimer model from statistical mechanics, based on the formalism from quantum topology developed by Reshetikhin and Turaev (the latter which, in particular, can be used to construct the Jones polynomial…
In this paper we discuss progress made in the study of the Jones polynomial from the point of view of quantum mechanics. This study reduces to the understanding of the quantization of the moduli space of flat SU(2)-connections on a surface…
Clustering is one of the most important tools for analysis of large datasets, and perhaps the most popular clustering algorithm is Lloyd's algorithm for $k$-means. This algorithm takes $n$ vectors $V=[v_1,\dots,v_n]\in\mathbb{R}^{d\times…
A Cartan Calculus of Lie derivatives, differential forms, and inner derivations, based on an undeformed Cartan identity, is constructed. We attempt a classification of various types of quantum Lie algebras and present a fairly general…
Linear Regression is a seminal technique in statistics and machine learning, where the objective is to build linear predictive models between a response (i.e., dependent) variable and one or more predictor (i.e., independent) variables. In…
The Jones problem is a question whether there is a non-trivial knot with the trivial Jones polynomial in one variable $q$. The answer to this fundamental question is still unknown despite numerous attempts to explore it. In braid…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
We develop a diagrammatic calculus for representations of unrolled quantum $\mathfrak{sl}_2$ at a fourth root of unity. This allows us to prove Seifert-Torres type formulas for certain splice links using quantum algebraic methods, rather…