Classical and Quantum Polynomial Reconstruction via Legendre Symbol Evaluation
نویسندگان
چکیده
We consider the problem of recovering a hidden monic polynomial f(X) of degree d ≥ 1 over a finite field Fp of p elements given a black box which, for any x ∈ Fp, evaluates the quadratic character of f(x). We design a classical algorithm of complexity O(d2pd+ε) and also show that the quantum query complexity of this problem is O(d). Some of our results extend those of Wim van Dam, Sean Hallgren and Lawrence Ip obtained in the case of a linear polynomial f(X) = X+s (with unknown s); some are new even in this case.
منابع مشابه
Numerical Solution of Interval Volterra-Fredholm-Hammerstein Integral Equations via Interval Legendre Wavelets Method
In this paper, interval Legendre wavelet method is investigated to approximated the solution of the interval Volterra-Fredholm-Hammerstein integral equation. The shifted interval Legendre polynomials are introduced and based on interval Legendre wavelet method is defined. The existence and uniqueness theorem for the interval Volterra-Fredholm-Hammerstein integral equations is proved. Some examp...
متن کاملEfficient Quantum Algorithms for Shifted Quadratic Character Problems
We introduce the Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them. The problems and their algorithms are different from previous work on quantum computation in that they do not appear to fit into the framework of the Hidden Subgroup Problem. The classical complexity of the problem is unknown, despite the various results on the irregularity ...
متن کاملPseudospectral Fourier reconstruction with IPRM
The Inverse Polynomial Reconstruction Method (IPRM) has been recently introduced by J.-H. Jung and B. Shizgal in order to remedy the Gibbs phenomenon, see [2], [3], [4], [5]. Their main idea is to reconstruct a given function from its n Fourier coefficients as an algebraic polynomial of degree n− 1. This leads to an n × n system of linear equations, which is solved to find the Legendre coeffici...
متن کاملA prime sensitive Hankel determinant of Jacobi symbol enumerators
Abstract We show that the determinant of a Hankel matrix of odd dimension n whose entries are the enumerators of the Jacobi symbols which depend on the row and the column indices vanishes iff n is composite. If the dimension is a prime p, then the determinant evaluates to a polynomial of degree p−1 which is the product of a power of p and the generating polynomial of the partial sums of Legendr...
متن کاملAn algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order
We describe a method for the numerical evaluation of normalized versions of the associated Legendre functions P−μ ν and Q −μ ν of degrees 0 ≤ ν ≤ 1, 000, 000 and orders −ν ≤ μ ≤ ν on the interval (−1, 1). Our algorithm, which runs in time independent of ν and μ, is based on the fact that while the associated Legendre functions themselves are extremely expensive to represent via polynomial expan...
متن کامل