相关论文: Topological Quantum Computing and the Jones Polyno…
We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are given as explicit exp-log expressions. We provide a method…
An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…
Computing many-body ground state energies and resolving electronic structure calculations are fundamental problems for fields such as quantum chemistry or condensed matter. Several quantum computing algorithms that address these problems…
The Jones polynomial of a knot in 3-space is a Laurent polynomial in $q$, with integer coefficients. Many people have pondered why is this so, and what is a proper generalization of the Jones polynomial for knots in other closed…
We present a simple phenomenological formula which approximates the hyperbolic volume of a knot using only a single evaluation of its Jones polynomial at a root of unity. The average error is just $2.86$% on the first $1.7$ million knots,…
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…
We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function $f$ is computable by a 1-query quantum algorithm with error bounded by $\epsilon<1/2$ iff $f$ can be…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…
In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases…
Quantum algorithms provide a potential strategy for solving computational problems that are intractable by classical means. Computing the topological invariants of topological matter is one central problem in research on quantum materials,…
Measuring the entanglement complexity of collections of open curves in 3-space has been an intractable, yet pressing mathematical problem, relevant to a plethora of physical systems, such as in polymers and biopolymers. In this manuscript,…
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…
Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of p steps; in each step a…
In topological quantum computing, information is encoded in "knotted" quantum states of topological phases of matter, thus being locked into topology to prevent decay. Topological precision has been confirmed in quantum Hall liquids by…
We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler (2020). The task is to distinguish whether an input set $x\subseteq [n]$ has size either $k$ or…
The EPR Hamiltonian is a family of 2-local quantum Hamiltonians introduced by King (arXiv:2209.02589). We introduce a polynomial time $\frac{1+\sqrt{5}}{4}\approx 0.809$-approximation algorithm for the problem of computing the ground energy…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
By introducing the "comparison and replacement" (CNR) operation, we propose a general-purpose pure quantum approximate optimization algorithm and derive its core optimization mechanism quantitatively. The algorithm is constructed to a…
The analytic solutions of the one-dimensional Schroedinger equation for the trigonometric Rosen-Morse potential reported in the literature rely upon the Jacobi polynomials with complex indices and complex arguments. We first draw attention…