Editing Quantum algorithm (section)

===Estimating Gauss sums===
A [[Gauss sum]] is a type of [[exponential sum]]. The best known classical algorithm for estimating these sums takes exponential time. Since the discrete logarithm problem reduces to Gauss sum estimation, an efficient classical algorithm for estimating Gauss sums would imply an efficient classical algorithm for computing discrete logarithms, which is considered unlikely. However, quantum computers can estimate Gauss sums to polynomial precision in polynomial time.<ref>
{{Cite arXiv
 | last1=van Dam |first1=W.
 | last2=Seroussi |first2=G.
 | year =2002
 | title = Efficient Quantum Algorithms for Estimating Gauss Sums
 | eprint = quant-ph/0207131
}}</ref>