Related papers: Parameterized complexity of quantum invariants
We express the colored Jones polynomial as the inverse of the quantum determinant of a matrix with entries in the $q$-Weyl algebra of $q$-operators, evaluated at the trivial function (plus simple substitutions). The Kashaev invariant is…
Given any oriented link diagram, two types of new knot invariants are constructed. They satisfy some generalized skein relations. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations of those…
Eisermann has shown that the Jones polynomial of a $n$-component ribbon link $L\subset S^3$ is divided by the Jones polynomial of the trivial $n$-component link. We improve this theorem by extending its range of application from links in…
We briefly review 3-dimensional untwisted Dijkgraaf-Witten theory over a finite group $\Gamma$, and present a method of computing untwisted Dijkgraaf-Witten invariants for arborescent links. Some explicit formulas are given when…
In the prequel of this paper, Kauffman and Ogasa introduced new topological quantum invariants of compact oriented 3-manifolds with boundary where the boundary is a disjoint union of two identical surfaces. The invariants are constructed…
We define a polynomial invariant $J_n^T$ of links in the thickened torus. We call $J^T_n$ the $n$th toroidal colored Jones polynomial, and show it satisfies many properties of the original colored Jones polynomial. Most significantly,…
We review quantum field theory approach to the knot theory. Using holomorphic gauge we obtain the Kontsevich integral. It is explained how to calculate Vassiliev invariants and coefficients in Kontsevich integral in a combinatorial way…
We refine the Polyak-Viro Gauss diagram formula for the Vassiliev invariant of order two in a very simple way for the 2-cable of a framed long knot. Surprisingly, the resulting isotopy invariant of framed knots can detect already the…
Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them…
Gauss diagram formulas are extensively used to study Vassiliev link invariants. Now we apply this approach to invariants of 3-manifolds, considering manifolds given by surgery on framed links in the 3-sphere. We study the lowest degree case…
For a generic $n$-qubit system, local invariants under the action of $SL(2,\mathbb{C})^{\otimes n}$ characterize non-local properties of entanglement. In general, such properties are not immediately apparent and hard to construct. Here we…
It has recently been shown that starting with a classical query algorithm (decision tree) and a guessing algorithm that tries to predict the query answers, we can design a quantum algorithm with query complexity $O(\sqrt{GT})$ where $T$ is…
We define a variation of Khovanov homology with an explicit description in terms of the spanning trees of a link projection. We prove that this new theory is a link invariant and describe some of its properties. Finally, we provide some the…
Each knot invariant can be extended to singular knots according to the skein rule. A Vassiliev invariant of order at most $n$ is defined as a knot invariant that vanishes identically on knots with more than $n$ double points. A chord…
First, I introduce quantum graph theory. I also discuss a known lower bound on the independence numbers and derive from it an upper bound on the chromatic numbers of quantum graphs. Then, I construct a family of quantum graphs that can be…
In the k-Path problem, the input is a directed graph $G$ and an integer $k\geq 1$, and the goal is to decide whether there is a simple directed path in $G$ with exactly $k$ vertices. We give a deterministic algorithm for k-Path with time…
We show that multivariable colored link invariants are derived from the roots of unity representations of $U_q(g)$. We propose a property of the Clebsch-Gordan coefficients of $U_q(g)$, which is important for defining the invariants of…
We introduce the 2-colour parity. It is a theory of parity for a large class of virtual links, defined using the interaction between orientations of the link components and a certain type of colouring. The 2-colour parity is an extension of…
We introduce new topological quantum invariants of compact oriented 3-manifolds with boundary where the boundary is a disjoint union of two identical surfaces. The invariants are constructed via surgery on manifolds of the form $F \times I$…
Given an edge-weighted graph $G$ on $n$ nodes, the NP-hard Max-Cut problem asks for a node bipartition such that the sum of edge weights joining the different partitions is maximized. We propose a fixed-parameter tractable algorithm…