Related papers: An efficient quantum algorithm for colored Jones p…
We study the head and tail of the colored Jones polynomial while focusing mainly on alternating links. Various ways to compute the colored Jones polynomial for a given link give rise to combinatorial identities for those power series. We…
The process of translating a quantum algorithm into a form suitable for implementation on a quantum computing platform is crucial but yet challenging. This entails specifying quantum operations with precision, a typically intricate task. In…
We present an end-to-end reconfigurable algorithmic pipeline for solving a famous problem in knot theory using a noisy digital quantum computer, namely computing the value of the Jones polynomial at the fifth root of unity within additive…
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 show the $n$ colored Jones polynomials of a highly twisted link approach the Kauffman bracket of an $n$ colored skein element. This is in the sense that the corresponding categorifications of the colored Jones polynomials approach the…
A function of several variables is called holonomic if, roughly speaking, it is determined from finitely many of its values via finitely many linear recursion relations with polynomial coefficients. Zeilberger was the first to notice that…
Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…
We prove that the coefficients of the colored Jones polynomial of alternating links stabilize under increasing the number of twists in the twist regions of the link diagram. This gives us an infinite family of $q$-power series derived from…
Given a knot, we develop methods for finding the braid representative that minimizes the number of simple walks. Such braids lead to an efficient method for computing the colored Jones polynomial of $K$, following an approach developed by…
We construct 3D $\mathcal{N}=2$ abelian gauge theories on $\mathbb{S}^2 \times \mathbb{S}^1$ labeled by knot diagrams whose K-theoretic vortex partition functions, each of which is a building block of twisted indices, give the colored Jones…
The SL_3 colored Jones polynomial of the trefoil knot is a $q$-holonomic sequence of two variables with natural origin, namely quantum topology. The paper presents an explicit set of generators for the annihilator ideal of this…
We extend the table of Garoufalidis, Le and Zagier concerning conjectural Rogers-Ramanujan type identities for tails of colored Jones polynomials to all alternating knots up to 10 crossings. We then prove these new identities using q-series…
The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q= root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin…
A multi-component electron model on a lattice is constructed whose ground state exhibits a spontaneous ordering which follows the rule of map-coloring used in the solution of the four color problem. The number of components is determined by…
We formulate a stability conjecture for the coefficients of the colored Jones polynomial of a knot, colored by irreducible representations in a fixed ray of a simple Lie algebra, and verify it for all torus knots and all simple Lie algebras…
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…
We study the quantum plane associated to the coloured quantum group GL_{q}^{\lambda,\mu}(2) and solve the problem of constructing the corresponding differential geometric structure. This is achieved within the R-matrix framework…
Motivated from the theory of quantum error correcting codes, we investigate a combinatorial problem that involves a symmetric $n$-vertices colourable graph and a group of operations (colouring rules) on the graph: find the minimum sequence…
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…
Coloured Alexander polynomials form a sequence of non-semisimple quantum invariants coming from the representation theory of the quantum group $U_q(sl(2))$ at roots of unity. This sequence recovers the original Alexander polynomial as the…