On zeros of exponential polynomials and quantum algorithms

Authors:
Yoshitaka Sasaki
Affiliations:
Interdisciplinary Graduate School of Science and Engineering, Kinki University, Higashi-Osaka, Osaka, Japan 577-8502
Venue:
Quantum Information Processing
Year:
2010

Citing 3
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Finite fields

Finite fields
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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.