相关论文: The Jones polynomial: quantum algorithms and appli…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…

In this paper we prove that the family of colored Jones polynomials of a knot in $S^3$ determines the family of ADO polynomials of this knot. More precisely, we construct a two variables knot invariant unifying both the ADO and the colored…

In this paper, we classify a type of abstract groups by the central products of dihedral groups and quaternion groups. We recognize them as abstract error groups which are often not isomorphic to the Pauli groups in the literature. We show…

We show that a non-trivial, non-central normal subgroup of the braid groups contains a braid whose closure is a hyperbolic knot with arbitrary large genus. This shows that non-faithfulness of a quantum representation implies that the…

This paper aims to develop a grafting method to address Majid's conjecture, which enables the construction of a larger target quantum group by grafting two given smaller ones. This method is significant for advancing the understanding of…

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…

Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an…

We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary…

We investigate coincidences of the (one-variable) Jones polynomial amongst rational knots, what we call `Jones rational coincidences'. We provide moves on the continued fraction expansion of the associated rational which we prove do not…

We review the q-deformed spin network approact to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. These methods produce a concise proof…

In this paper we give an algorithm for solving a main case of the conjugacy problem in the braid groups. We also prove that half-twists satisfy a special root property which allows us to reduce the solution for the conjugacy problem in…

We show in detail how the Jordan-Wigner transformation can be used to simulate any fermionic many-body Hamiltonian on a quantum computer. We develop an algorithm based on appropriate qubit gates that takes a general fermionic Hamiltonian,…

We present a general theory of braided quantum groups in the C*-algebraic framework using the language of multiplicative unitaries. Starting with a manageable multiplicative unitary in the representation category of the quantum codouble of…

Solving and visualizing the potential roots of complex functions is essential in both theoretical and applied domains, yet often computationally intensive. We present a hardware-accelerated algorithm for complex function roots density graph…

A new method for deriving universal \v{R} matrices from braid group representation is discussed. In this case, universal \v{R} operators can be defined and expressed in terms of products of braid group generators. The advantage of this…

The colored Jones function of a knot is a sequence of Laurent polynomials. It was shown by TTQ. Le and the author that such sequences are $q$-holonomic, that is, they satisfy linear $q$-difference equations with coefficients Laurent…

Bialgebras and Hopf (bi)modules are typical algebraic structures with several interacting operations. Their structural and homological study is therefore quite involved. We develop the machinery of braided systems, tailored for handling…

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…

A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions. However, for many other classes such…