相关论文: Quantum Computation of Jones' Polynomials
Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…
We describe an algorithm for computing certain quaternionic quotients of the Bruhat-Tits tree for GL2(Qp). As an application, we describe an algorithm to obtain (conjectural) equations for the canonical embedding of Shimura curves.
Governed by locality, we explore a connection between unitary braid group representations associated to a unitary $R$-matrix and to a simple object in a unitary braided fusion category. Unitary $R$-matrices, namely unitary solutions to the…
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…
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…
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most…
We continue our study of the degree of the colored Jones polynomial under knot cabling started in "Knot Cabling and the Degree of the Colored Jones Polynomial" (arXiv:1501.01574). Under certain hypothesis on this degree, we determine how…
Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G.…
In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting…
Quantum computing has attracted a lot of attention in recent years. It is one of the promising candidates for the next-generation computing paradigms. Basically, there are two technical lines to realize quantum computing. One is composing…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
Gradient-based algorithms, popular strategies to optimization problems, are essential for many modern machine-learning techniques. Theoretically, extreme points of certain cost functions can be found iteratively along the directions of the…
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous…
It is known that each of the successive quotient groups of the grope and solvable filtrations of the knot concordance group has an infinite rank subgroup. The generating knots of these subgroups are constructed using iterated doubling…
This article contains general formulas for Tutte and Jones polynomials for families of knots and links given in Conway notation and "portraits of families"-- plots of zeroes of their corresponding Jones polynomials.
We consider two Laurent polynomials in two variables associated to a braid, given by {\em graded intersections} between {\em fixed Lagrangians in configuration spaces}. In order to get link invariants, we notice that we have to quotient by…
This article gives the foundations of the colored Jones polynomial for singular knots. We extend Masbum and Vogel's algorithm to compute the colored Jones polynomial for any singular knot. We also introduce the tail of the colored Jones…
$\mathbb{Z}_d$ Parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case $d=2$. In contrast to Majorana fermions, braiding of parafermions with $d>2$ allows to perform an entangling…
Trivalent plane graphs are used in various areas of mathematics which relate for instance to the colored Jones polynomial, invariants of 3-manifolds and quantum computation. Their evaluation is based on computations in the Temperley-Lieb…
We show that there are infinitely many pairs of alternating pretzel knots whose Jones polynomials are identical.