20 citations · 60 across the 10 of their papers we have counts for
Showing 2002 · quant-phShow all
2 papers · 2 filters
quant-ph2002★ 2 cited
Classical and Quantum Polynomial Reconstruction via Legendre Symbol Evaluation
Alexander Russell, Igor Shparlinski
We consider the problem of recovering a hidden monic polynomial f(X) of degree d > 0 over the finite field F of p elements given a black box which, for any x in F, evaluates the qu…
quant-ph2002★ 19 cited
The Hidden Subgroup Problem in Affine Groups: Basis Selection in Fourier Sampling
Cristopher Moore, Daniel Rockmore, Alexander Russell +1
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a hidden subgroup problem, in which a subgroup H of a group G mu…