On zeros of exponential polynomials and quantum algorithms

Details On zeros of exponential polynomials and quantum algorithms On zeros of exponential polynomials and quantum algorithms

2009-08-12

arxiv.org/abs/0908.1657v1

Physics

Quantum Physics

8 pages, LaTex

Scientific paper

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 complexity of those cases. Further we consider the ratio (classical/quantum) of the complexity. Then we can observe the ratio is virtually 2 when the number of the variables is sufficiently large.

Affiliated with

Also associated with

No associations

Rating

On zeros of exponential polynomials and quantum algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On zeros of exponential polynomials and quantum algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On zeros of exponential polynomials and quantum algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370307