On zeros of exponential polynomials and quantum algorithms

DOI10.1007/S11128-009-0148-3zbMATH Open1194.81050arXiv0908.1657OpenAlexW2006704394MaRDI QIDQ989909FDOQ989909

Yoshitaka Sasaki

Publication date: 23 August 2010

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

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 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.

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

Recommendations

• scientific article
• On the Complexity of Polynomial Zeros
• Polynomials, quantum query complexity, and Grothendieck's inequality
• Quantum algorithms and approximating polynomials for composed functions with shared inputs
• Classical and Quantum Algorithms for Exponential Congruences
• Quantum computation of zeta functions of curves
• scientific article; zbMATH DE number 3974292
• Efficient quantum algorithms of finding the roots of a polynomial function
• A note on quantum algorithms and the minimal degree of \(\varepsilon\)-error polynomials for symmetric functions
• STACS 2005

zbMATH Keywords

discrete logarithmquantum computingcharacter sumexponential congruence

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical and Quantum Algorithms for Exponential Congruences

Cited In (4)

• Title not available (Why is that?)
• Classical and Quantum Algorithms for Exponential Congruences
• ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES
• Characteristic roots for two-lag linear delay differential equations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989909)