Related papers: On zeros of exponential polynomials and quantum al…
Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…
Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solutions which are significantly worse than random. This enables…
In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean complex is non-positively curved. In particular, given such a complex we show how to define a boolean…
We give an efficient algorithm to evaluate a certain class of exponential sums, namely the periodic, quadratic, multivariate half Gauss sums. We show that these exponential sums become $\#\mathsf{P}$-hard to compute when we omit either the…
Let $N_n(a, b)$ denote the number of real zeros of Gaussian elliptic polynomials of degree $n$ on the interval $(a, b)$, where $a$ and $b$ may vary with $n$. We obtain a precise formula for the variance of $N_n(a, b)$ and utilize this…
Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…
We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…
Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…
We consider an extremal problem for polynomials, which is dual to the well-known Smale mean value problem. We give a rough estimate depending only on the degree.
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
Variational quantum algorithms (VQAs) that estimate values of widely used physical quantities such as the rank, quantum entropies, the Bures fidelity and the quantum Fisher information of mixed quantum states are developed. In addition,…
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…