19 citations · 28 across the 3 of their papers we have counts for
3 papers · 1 filter
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
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 an unknown subgroup H of a g…
Generic Quantum Fourier Transforms
Cristopher Moore, Daniel Rockmore, Alexander Russell
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient…
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…