Quantum interpolation of polynomials
Quantum Physics
2010-03-19 v2 Computational Complexity
Abstract
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 lower bounds for this problem, even in the case where 0 is among the possible values of x_i.
Keywords
Cite
@article{arxiv.0909.5683,
title = {Quantum interpolation of polynomials},
author = {Daniel M. Kane and Samuel A. Kutin},
journal= {arXiv preprint arXiv:0909.5683},
year = {2010}
}
Comments
8 pages; version 2 updates references