On exponential polynomials and quantum computing

Details On exponential polynomials and quantum computing On exponential polynomials and quantum computing

2009-08-07

arxiv.org/abs/0908.1027v1

Physics

Quantum Physics

7pages, LaTeX

Scientific paper

We calculate the zeros of an exponential polynomial of three 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 compare the case of van Dam and Shparlinski with our case by considering the ratio (classical/quantum) of the time complexity. Then we can observe the ratio decreases.

Affiliated with

Also associated with

No associations

Rating

On exponential polynomials and quantum computing 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 exponential polynomials and quantum computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On exponential polynomials and quantum computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-153117