On zeros of exponential polynomials and quantum algorithms

DOI10.1007/s11128-009-0148-3zbMath1194.81050arXiv0908.1657OpenAlexW2006704394MaRDI QIDQ989909

Yoshitaka Sasaki

Publication date: 23 August 2010

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.1657

zbMATH Keywords

character sumquantum computingdiscrete logarithmexponential congruence

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Characteristic roots for two-lag linear delay differential equations ⋮ ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Classical and Quantum Algorithms for Exponential Congruences

This page was built for publication: On zeros of exponential polynomials and quantum algorithms