Daniel Simon\&$\#$39;s 1994 discovery of an efficient quantum algorithm for finding \“hidden shifts\” of Z2n provided the first algebraic problem for which quantum computers are exponentially faster than their classical counterparts. In this article, we study the generalization of Simon\&$\#$39;s problem to arbitrary groups. Fixing a finite group G, this is the problem of recovering an involution m = (m1,\…,mn) \∈ Gn from an oracle f with the property that f(x \⋅ y) = f(x) \⇔ y \∈ {1, m}. In the current parlance, this is the hidden subgroup problem (HSP) over groups of the form Gn, where G is a nonabelian group of constant size, and where the hidden subgroup is either trivial or has order two.

Although groups of the form Gn have a simple product structure, they share important representation--theoretic properties with the symmetric groups Sn, where a solution to the HSP would yield a quantum algorithm for Graph Isomorphism. In particular, solving their HSP with the so-called \“standard method\” requires highly entangled measurements on the tensor product of many coset states.

In this article, we provide quantum algorithms with time complexity 2O(\√n) that recover hidden involutions m = (m1,\…mn) \∈ Gn where, as in Simon\&$\#$39;s problem, each mi is either the identity or the conjugate of a known element m which satisfies κ(m) = \−κ(1) for some κ \∈ Gh. Our approach combines the general idea behind Kuperberg\&$\#$39;s sieve for dihedral groups with the \“missing harmonic\” approach of Moore and Russell. These are the first nontrivial HSP algorithms for group families that require highly entangled multiregister Fourier sampling.

}, doi = {https://doi.org/10.1145/1644015.1644034}, author = {Gorjan Alagic and Cristopher Moore and Alexander Russell} } @article {2613, title = {Quantum Algorithms for Simon{\textquoteright}s Problem over General Groups}, journal = {SODA {\textquoteright}07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms}, year = {2007}, month = {1/25/2007}, pages = {1217{\textendash}1224}, abstract = {Daniel Simon\&$\#$39;s 1994 discovery of an efficient quantum algorithm for solving the hidden subgroup problem (HSP) over Zn2 provided one of the first algebraic problems for which quantum computers are exponentially faster than their classical counterparts. In this paper, we study the generalization of Simon\&$\#$39;s problem to arbitrary groups. Fixing a finite group G, this is the problem of recovering an involution m = (m1,...,mn) ε Gn from an oracle f with the property that f(x) = f(x \· y) \⇔ y ε {1, m}. In the current parlance, this is the hidden subgroup problem (HSP) over groups of the form Gn, where G is a nonabelian group of constant size, and where the hidden subgroup is either trivial or has order two.

Although groups of the form Gn have a simple product structure, they share important representation-theoretic properties with the symmetric groups Sn, where a solution to the HSP would yield a quantum algorithm for Graph Isomorphism. In particular, solving their HSP with the so-called \"standard method\" requires highly entangled measurements on the tensor product of many coset states.

Here we give quantum algorithms with time complexity 2O(\√n log n) that recover hidden involutions m = (m1,..., mn) ε Gn where, as in Simon\&$\#$39;s problem, each mi is either the identity or the conjugate of a known element m and there is a character X of G for which X(m) = - X(1). Our approach combines the general idea behind Kuperberg\&$\#$39;s sieve for dihedral groups with the \"missing harmonic\" approach of Moore and Russell. These are the first nontrivial hidden subgroup algorithms for group families that require highly entangled multiregister Fourier sampling.

}, doi = {https://dl.acm.org/doi/10.5555/1283383.1283514}, url = {https://arxiv.org/abs/quant-ph/0603251}, author = {Gorjan Alagic and Cristopher Moore and Alexander Russell} } @article {2611, title = {Strong Fourier Sampling Fails over Gn}, year = {2005}, month = {11/7/2005}, abstract = {We present a negative result regarding the hidden subgroup problem on the powers Gn of a fixed group G. Under a condition on the base group G, we prove that strong Fourier sampling cannot distinguish some subgroups of Gn. Since strong sampling is in fact the optimal measurement on a coset state, this shows that we have no hope of efficiently solving the hidden subgroup problem over these groups with separable measurements on coset states (that is, using any polynomial number of single-register coset state experiments). Base groups satisfying our condition include all nonabelian simple groups. We apply our results to show that there exist uniform families of nilpotent groups whose normal series factors have constant size and yet are immune to strong Fourier sampling.

}, url = {https://arxiv.org/abs/quant-ph/0511054}, author = {Gorjan Alagic and Cristopher Moore and Alexander Russell} }