Related papers: On exponential polynomials and quantum computing

We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…

The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…

A method of calculating probability values from a system of marginal constraints is presented. Previous systems for finding the probability of a single attribute have either made an independence assumption concerning the evidence or have…

We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the…

We consider multiple orthogonal polynomials associated with the exponential cubic weight e^{-x^3} over two contours in the complex plane. We study the basic properties of these polynomials, including the Rodrigues formula and…

We extend the conforming virtual element method to the numerical resolution of eigenvalue problems with potential terms on a polytopal mesh. An important application is that of the Schrodinger equation with a pseudopotential term. This…

The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…

Non-separable $D-$dimensional partial differential Schr\"{o}dinger equations are considered at $D=2$ and $D=3$, with the even-parity local potentials $V(x,y,\ldots)$ which are polynomials of degree four (cusp catastrophe resembling case)…

We present a procedure for computing the convolution of exponential signals without the need of solving integrals or summations. The procedure requires the resolution of a system of linear equations involving Vandermonde matrices. We apply…

We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced…

We present a quantum algorithm for simulating the classical dynamics of $2^n$ coupled oscillators (e.g., $2^n$ masses coupled by springs). Our approach leverages a mapping between the Schr\"odinger equation and Newton's equation for…

This paper combines probabilistic and algebraic techniques for computing quantum expectations of operator exponentials (and their products) of quadratic forms of quantum variables in Gaussian states. Such quadratic-exponential functionals…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum-Shub-Smale model with square root. It…

We give asymptotic approximations of the zeros of certain high degree polynomials. The zeros can be used to compute the filter coefficients in the dilation equations which define the compactly supported orthogonal Daubechies wavelets.…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

We present new polynomial-based methods for discrete-time quaternionic systems, highlighting how noncommutative multiplication modifies classical control approaches. Defining quaternionic polynomials via a backward-shift operator, we…

We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a different…

In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…