Quantum Information Processing

, Volume 9, Issue 3, pp 419–427 | Cite as

On zeros of exponential polynomials and quantum algorithms

  • Yoshitaka SasakiEmail author


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.


Quantum computing Exponential congruence Discrete logarithm Character sum 


02.10.De 03.67.Lx 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boyer M., Brassard G., Høyer P., Tapp A.: Tight bounds on quantum searching. Fortschr. Phys. 46, 493–505 (1998)CrossRefGoogle Scholar
  2. 2.
    Crandall R., Pomerance C.: Prime Numbers: A Computational Perspective. Springer, Berlin (2005)zbMATHGoogle Scholar
  3. 3.
    Grover, L.: A fast quantum-mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC ’96), pp. 212–219 (1996)Google Scholar
  4. 4.
    Ivić A.: The Riemann Zeta-Function. Wiley, New York (1985)zbMATHGoogle Scholar
  5. 5.
    Lidl R., Niederreiter H.: Finite Fields, Encyclopedia of Mathematics and Its Applications, vol. 20. Cambridge University Press, Cambridge (1997)Google Scholar
  6. 6.
    Ohno, Y., Sasaki, Y., Yamazaki, C.: On exponential polynomials and quantum computing, report, arXiv:0908.1027[quant-ph].Google Scholar
  7. 7.
    Shor P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    van Dam, W.: Quantum computing and zeroes of zeta functions (preprint) arXiv:0405081[quant-ph].Google Scholar
  9. 9.
    van Dam, W., Shparlinski, E.: Classical and quantum algorithms for exponential congruences. In: Proceedings of the 3rd Workshop on Theory of Quantum Computation, Communication and Cryptography (TQC 2008), Lecture Notes in Computer Science, vol. 5106, pp. 1–10 (2008)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Interdisciplinary Graduate School of Science and EngineeringKinki UniversityHigashi-Osaka, OsakaJapan

Personalised recommendations