On zeros of exponential polynomials and quantum algorithms |
| |
| Authors: | Yoshitaka Sasaki |
| |
| Affiliation: | (1) Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL 32611, USA;(2) Computer Science Department, Technion, Haifa, 32000, Israel;(3) Electrical Engineering Department, UCLA, Los Angeles, CA 90095, USA;(4) Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA 91109, USA;; |
| |
| Abstract: | We calculate the zeros of an exponential polynomial of some variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the time complexity of those cases. Further we consider the ratio (classical/quantum) of the exponent in the time complexity. Then we can observe the ratio is virtually 2 when the number of the variables is sufficiently large. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
