Related papers: A Polynomial Quantum Algorithm for Approximating t…
Functions are a fundamental object in mathematics, with countless applications to different fields, and are usually classified based on certain properties, given their domains and images. An important property of a real-valued function is…
The quantum k-Local Hamiltonian problem is a natural generalization of classical constraint satisfaction problems (k-CSP) and is complete for QMA, a quantum analog of NP. Although the complexity of k-Local Hamiltonian problems has been well…
We develop an explicit skein theoretical algorithm to compute the Alexander polynomial of a 3-manifold from a surgery presentation employing the methods used in the construction of quantum invariants of 3-manifolds. As a prerequisite we…
We present a classical algorithm that, for any 3D geometrically-local, polylogarithmic-depth quantum circuit $C$ acting on $n$ qubits, and any bit string $x\in\{0,1\}^n$, can compute the quantity $|< x |C|0^{\otimes n}>|^2$ to within any…
For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$ the polynomial interpolation problem (PIP) is to determine a \emph{generic node set} $P \subseteq \mathbb{R}^m$ and the coefficients of…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
An extension of the method and results of A. Schwarz for evaluating the partition function of a quadratic functional is presented. This enables the partition functions to be evaluated for a wide class of quadratic functionals of interest in…
It has previously been established that the logarithmic-depth approximate quantum Fourier transform (AQFT) provides a suitable replacement for the regular QFT in many quantum algorithms. Since the AQFT is less accurate by definition,…
In this paper, we investigate twist sequences for Kauffman finite-type invariants and Goussarov-Polyak-Viro finite-type invariants. It is shown that one obtains a Kauffman or GPV type of degree $\le n$ if and only if an invariant is a…
In this paper we discuss progress made in the study of the Jones polynomial from the point of view of quantum mechanics. This study reduces to the understanding of the quantization of the moduli space of flat SU(2)-connections on a surface…
We consider some known and some new properties of the family of polynomials introduced by Ted Suffridge in 1969. We begin by giving a brief overview of their extremal properties in classic and more recent work. We also give a compact form…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
Motivated by the study of ribbon knots we explore symmetric unions, a beautiful construction introduced by Kinoshita and Terasaka in 1957. For symmetric diagrams we develop a two-variable refinement $W_D(s,t)$ of the Jones polynomial that…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
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 study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
We use the Chern-Simons quantum field theory in order to prove a recently conjectured limitation on the 1/K expansion of the Jones polynomial of a knot and its relation to the Alexander polynomial. This limitation allows us to derive a…
It is known that the minimal degree of the Jones polynomial of a positive knot is equal to its genus, and the minimal coefficient is 1. We extend this result to almost positive links and partly identify the 3 following coefficients for…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
This is the first article in a series devoted to the study of the asymptotic expansions of various quantum invariants related to the twist knots. In this paper, by using the saddle point method developed by Ohtsuki, we obtain an asymptotic…