Related papers: The Jones polynomial: quantum algorithms and appli…
Higher braiding gates, a new kind of quantum gate, are introduced. These are matrix solutions of the polyadic braid equations (which differ from the generalized Yang-Baxter equations). Such gates support a special kind of multi-qubit…
In this work, we present an efficient method for computing in the generalized Jacobian of special singular curves, nodal curves. The efficiency of the operation is due to the representation of an element in the Jacobian group by a single…
We present an algorithm that takes as input any element $B$ of the loop braid group and constructs a polynomial $f:\mathbb{R}^5\to\mathbb{R}^2$ such that the intersection of the vanishing set of $f$ and the unit 4-sphere contains the…
There is a $p$-differential on the triply-graded Khovanov--Rozansky homology of knots and links over a field of positive characteristic $p$ that gives rise to an invariant in the homotopy category finite-dimensional $p$-complexes. A…
Exchanging particles on graphs, or more concretely on networks of quantum wires, has been proposed as a means to perform fault tolerant quantum computation. This was inspired by braiding of anyons in planar systems. However, exchanges on a…
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 describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
We study the algebraic property of the representation of the mapping class group of a closed oriented surface of genus 2 constructed by VFR Jones [Annals of Math. 126 (1987) 335-388]. It arises from the Iwahori-Hecke algebra representations…
We continue the study of the genus of knot diagrams, deriving a new description of generators using Hirasawa's algorithm. This description leads to good estimates on the maximal number of crossings of generators and allows us to complete…
We study the bit complexity of two related fundamental computational problems in linear algebra and control theory. Our results are: (1) An $\tilde{O}(n^{\omega+3}a+n^4a^2+n^\omega\log(1/\epsilon))$ time algorithm for finding an…
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 introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…
Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…
Knot and link invariants naturally arise from any braided Hopf algebra. We consider the computational complexity of the invariants arising from an elementary family of finite-dimensional Hopf algebras: quantum doubles of finite groups…
Homotopy braid group description including cyclotron motion of charged interacting 2D particles at strong magnetic field presence is developed in order to explain, in algebraic topology terms, Laughlin correlations in fractional quantum…
The traditional method for computation in either the surface code or in the Raussendorf model is the creation of holes or "defects" within the encoded lattice of qubits that are manipulated via topological braiding to enact logic gates.…
In this paper, we prove a formula for the 2-head of the colored Jones polynomial for an infinite family of pretzel knots. Following Hall, the proof utilizes skein-theoretic techniques and a careful examination of higher order stability…
We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…
We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…
Following the theory of principal $\infty$-bundles of Niklaus-Schreiber-Steveson, we develop a homotopy categorification of Hopf algebras, which model quantum groups. We study their higher-representation theory in the setting of…