Related papers: Quantum interpolation of polynomials
We introduce the subsum polynomial of a partition $\lambda=(\lambda_1, \lambda_2, \ldots, \lambda_k)$ defined by $\mathrm{sp}(\lambda, x)=\prod_{i=1}^k(1+x^{\lambda_i})$. We study the sum of reciprocals of $\mathrm{sp}(\lambda, x)$ over all…
We consider quasi-interpolation with a main application in radial basis function approximations and compression in this article. Constructing and using these quasi-interpolants, we consider wavelet and compression-type approximations from…
We study sampling and interpolation arrays with multiplicities for the spaces P_k of holomorphic polynomials of degree at most k. We find that the geometric conditions satisfied by these arrays are in accordance with the conditions…
We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…
This paper considers the extension of classical Lagrange interpolation in one real or complex variable to "polynomials of one quaternionic variable". To do this we develop some aspects of the theory of such polynomials. We then give a…
In this paper we present a Mathematica notebook for computing nonsymmetric and interpolation Macdonald polynomials. We present the new recursive generation algorithm employed within the notebook and the theory required for its development.…
We provide some statistics about an irreducibility/reducibility test for multivariate polynomials over finite fields based on counting points. The test works best for polynomials in a large number of variables and can also be applied to…
The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence…
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given. This solution, an algorithm computing approximate zeros of complex polynomial systems in average polynomial time, assumed infinite…
We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that we choose the degrees randomly based on…
We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a…
For a division ring $\mathbb F$, the polynomials $f\in\mathbb F$ can be evaluated "on the left" and "on the right" giving rise to left and right Lagrange interpolation problems. The problems containig interpolation conditions of the same…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
We study a polynomial sequence $C_n(x|q)$ defined as a solution of a $q$-difference equation. This sequence, evaluated at $q$-integers, interpolates Carlitz-Riordan's $q$-ballot numbers. In the basis given by some kind of $q$-binomial…
$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
A polynomial map $F=(P,Q)\in \Z [x,y]^2$ with Jacobian $JF:=P_xQ_y-P_yQ_x\equiv 1$ has a polynomial inverse of integer coefficients if the complex plane curve P=0 has infinitely many integer points.