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

In the context of high-energy particle physics, a reliable theory-experiment confrontation requires precise theoretical predictions. This translates into accessing higher-perturbative orders, and when we pursue this objective, we inevitably…

We present a differentiable joint pruning and quantization (DJPQ) scheme. We frame neural network compression as a joint gradient-based optimization problem, trading off between model pruning and quantization automatically for hardware…

A braid-like isotopy for links in 3-space is an isotopy which uses only those Reidemeister moves which occur in isotopies of braids. We define a refined Jones polynomial and its corresponding Khovanov homology which are, in general, only…

In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower…

This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…

We generalize the braid algebra to the case of loops with intersections. We introduce the Reidemeister moves for 4 and 6-valent vertices to have a theory of rigid vertex equivalence. By considering representations of the extended braid…

In this paper we present recent results on the computation of skein modules of 3-manifolds using braids and appropriate knot algebras. Skein modules generalize knot polynomials in $S^3$ to knot polynomials in arbitrary 3-manifolds and they…

In this work, we present an efficient method for computing in the Generalized Jacobian of special singular curves. The efficiency of the operation is due to representation of an element in the Jacobian group by a single polynomial.

A central problem in quantum computing is to identify computational tasks which can be solved substantially faster on a quantum computer than on any classical computer. By studying the hardest such tasks, known as BQP-complete problems, we…

We prove that for knots, the evaluation of the Jones polynomial at the sixth root of unity, as well as the evaluation of the $Q$-polynomial at the reciprocal of the golden ratio, are uniquely determined by the oriented homeomorphism type of…

For a closed n-braid L with a full positive twist and with k negative crossings, 0\leq k \leq n, we determine the first n-k+1 terms of the Jones polynomial V_L(t). We show that V_L(t) satisfies a braid index constraint, which is a gap of…

The Jones-Witten theory gives rise to representations of the (extended) mapping class group of any closed surface Y indexed by a semi-simple Lie group G and a level k. In the case G=SU(2) these representations (denoted V_A(Y)) have a…

Quantum computing allows for the potential of significant advancements in both the speed and the capacity of widely used machine learning techniques. Here we employ quantum algorithms for the Hopfield network, which can be used for pattern…

In this paper, I give a method to calculate the HOMFLY polynomials of knots by using a representation of the braid group B4 into a group of 3 ? 3 matrices. Also, I will give examples of a 2-bridge knot and a 3-bridge knot that have the same…

We develop a method to deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan-Wigner form for evaluation on quantum computers. Symmetries, such as point-group symmetries in molecules, are apparent in the…

Given a knot complement X and its p-fold cyclic cover X_p, we identify twisted polynomials associated to 1-dimensional linear representations of the fundamental group of X_p with twisted polynomials associated to related p-dimensional…

Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…

We give an explicit algorithm for calculating the Kauffman bracket of a link diagram from a Goeritz matrix for that link. Further, we show how the Jones polynomial can be recovered from a Goeritz matrix when the corresponding checkerboard…

Protein folding processes are a vital aspect of molecular biology that is hard to simulate with conventional computers. Quantum algorithms have been proven superior for certain problems and may help tackle this complex life science…

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…