Preprint
Aug 2026
Quantum Algorithms and Hardness for Point-Count Approximation over Finite Fields
By exploiting a point-counting formula derived from character sums over finite fields, this work develops an alternative approach that efficiently approximates the number of points without assuming the existence of an oracle.
Yota Maeda, Hiroshi Yano
· 0 citations