Related papers: Quantum Algorithms for the Jones Polynomial
This work is dedicated to the consideration of the construction of a representation of braid group generators from vertex models with $N$-states, which provides a great way to study the knot invariant. An algebraic formula is proposed for…
We apply big data techniques, including exploratory and topological data analysis, to investigate quantum invariants. More precisely, our study explores the Jones polynomial's structural properties and contrasts its behavior under four…
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…
It has been argued based on electric-magnetic duality and other ingredients that the Jones polynomial of a knot in three dimensions can be computed by counting the solutions of certain gauge theory equations in four dimensions. Here, we…
We study the representation theory of the smallest quantum group and its categorification. The first part of the paper contains an easy visualization of the 3j-symbols in terms of weighted signed line arrangements in a fixed triangle and…
In previous work of the first and third authors, we proposed a conjecture that the Kauffman bracket skein module of any knot in $S^3$ carries a natural action of the rank 1 double affine Hecke algebra $SH_{q,t_1, t_2}$ depending on 3…
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…
Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial…
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 quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
We give an explicit algorithm for calculating the Kauffman bracket of a link diagram from a Goeritz matrix for that link. Further, we show how the Jones polynomial can be recovered from a Goeritz matrix when the corresponding checkerboard…
Quantum enhancement polynomials are invariants for oriented links, defined in association with an algebraic structure called a tribracket. In this paper, we focus on the particular case of the canonical two-element tribracket. We prove…
We propose a new representation for gauge theories and quantum gravity. It can be viewed as a generalization of the loop representation. We make use of a recently introduced extension of the group of loops into a Lie Group. This extension…
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.…
In this paper we will present a homological model for Coloured Jones Polynomials. For each colour $N \in \mathbb {N}$, we will describe the invariant $J_N(L,q)$ as a graded intersection pairing of certain homology classes in a covering of…
We have developed methods for performing qudit quantum computation in the Jaynes-Cummings model with the qudits residing in a finite subspace of individual harmonic oscillator modes, resonantly coupled to a spin-1/2 system. The first method…
We study three-dimensional Chern-Simons theory with complex gauge group SL(2,C), which has many interesting connections with three-dimensional quantum gravity and geometry of hyperbolic 3-manifolds. We show that, in the presence of a single…
We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…
We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by…
In order to realize supersymmetric quantum mechanics methods on a four dimensional classical phase-space, the complexified Clifford algebra of this space is extended by deforming it with the Moyal star-product in composing the components of…