相关论文: A Polynomial Quantum Algorithm for Approximating t…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
The survey we are presenting is over 22 years old but it has still some ideas which where never published (except in Polish). This survey is the base of the third Chapter of my book: KNOTS: From combinatorics of knot diagrams to…
This paper will be an exposition of the Kauffman bracket polynomial model of the Jones polynomial, tangle methods for computing the Jones polynomial, and the use of these methods to produce non-trivial links that cannot be detected by the…
A simple geometric way is suggested to derive the Ward identities in the Chern-Simons theory, also known as quantum $A$- and $C$-polynomials for knots. In quasi-classical limit it is closely related to the well publicized augmentation…
We compute the Jones polynomial for a three-parameter family of links, the twisted torus links of the form $T((p,q),(2,s))$ where $p$ and $q$ are coprime and $s$ is nonzero. When $s = 2n$, these links are the twisted torus knots…
Two geometric spaces are in the same topological class if they are related by certain geometric deformations. We propose machine learning methods that automate learning of topological invariance and apply it in the context of knot theory,…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
The Jones problem is a question whether there is a non-trivial knot with the trivial Jones polynomial in one variable $q$. The answer to this fundamental question is still unknown despite numerous attempts to explore it. In braid…
Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the underdefined…
Many structures in science, engineering, and art can be viewed as curves in 3-space. The entanglement of these curves plays a crucial role in determining the functionality and physical properties of materials. Many concepts in knot theory…
The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a…
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…
In 1948, Fritz John proposed a theorem stating that every convex body has a unique maximal volume inscribed ellipsoid, known as the John ellipsoid. The John ellipsoid has become fundamental in mathematics, with extensive applications in…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…
Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial…
Combinatorial optimization - a field of research addressing problems that feature strongly in a wealth of scientific and industrial contexts - has been identified as one of the core potential fields of applicability of quantum computers. It…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…
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…
Solutions to both the diffeomorphism and the hamiltonian constraint of quantum gravity have been found in the loop representation, which is based on Ashtekar's new variables. While the diffeomorphism constraint is easily solved by…
Quantum neural networks (QNNs) are an analog of classical neural networks in the world of quantum computing, which are represented by a unitary matrix with trainable parameters. Inspired by the universal approximation property of classical…