36 citations · 170 across the 13 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
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…
quant-ph2002
Quantum and Stochastic Branching Programs of Bounded Width
Farid Ablayev, Cristopher Moore, Chris Pollett
In this paper we show that one qubit polynomial time computations are at least as powerful as $\NC^1$ circuits. More precisely, we define syntactic models for quantum and stochasti…