Given a divisor q of p-1 of intermediate size, a bounded-error quantum algorithm computes n! mod p in time O~(q^c + sqrt(p/q)), breaking the square-root barrier.
On Jacobi Sums, Multinomial Coefficients, andp-adic Hypergeometric Func- tions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Algorithms for Modular Factorials
Given a divisor q of p-1 of intermediate size, a bounded-error quantum algorithm computes n! mod p in time O~(q^c + sqrt(p/q)), breaking the square-root barrier.