The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts

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 group $G$ must be determined from a quantum state $\psi$ over $G$ that is uniformly supported on a left coset of $H$. These hidden subgroup problems are typically solved by Fourier sampling: the quantum Fourier transform of $\psi$ is computed and measured. When the underlying group is nonabelian, two important variants of the Fourier sampling paradigm have been identified: the weak standard method, where only representation names are measured, and the strong standard method, where full measurement (i.e., the row and column of the representation, in a suitably chosen basis, as well as its name) occurs. It has remained open whether the strong standard method is indeed stronger, that is, whether there are hidden subgroups that can be reconstructed via the strong method but not by the weak, or any other known, method. In this article, we settle this question in the affirmative. We show that hidden subgroups $H$ of the $q$-hedral groups, i.e., semidirect products ${\mathbb Z}_q \ltimes {\mathbb Z}_p$, where $q \mid (p-1)$, and in particular the affine groups $A_p$, can be information-theoretically reconstructed using the strong standard method. Moreover, if $|H| = p/ {\rm polylog}(p)$, these subgroups can be fully reconstructed with a polynomial amount of quantum and classical computation. We compare our algorithms to two weaker methods that have been discussed in the literature—the “forgetful” abelian method, and measurement in a random basis—and show that both of these are weaker than the strong standard method. Thus, at least for some families of groups, it is crucial to use the full power of representation theory and nonabelian Fourier analysis, namely, to measure the high-dimensional representations in an adapted basis that respects the group's subgroup structure. We apply our algorithm for the hidden subgroup problem to new families of cryptographically motivated hidden shift problems, generalizing the work of van Dam, Hallgren, and Ip on shifts of multiplicative characters. Finally, we close by proving a simple closure property for the class of groups over which the hidden subgroup problem can be solved efficiently.

[1]  Richard Jozsa,et al.  Quantum factoring, discrete logarithms, and the hidden subgroup problem , 1996, Comput. Sci. Eng..

[2]  Jean-Pierre Serre,et al.  Linear representations of finite groups , 1977, Graduate texts in mathematics.

[3]  Emanuel Knill,et al.  The quantum query complexity of the hidden subgroup problem is polynomial , 2004, Inf. Process. Lett..

[4]  Sean Hallgren,et al.  Quantum Fourier sampling simplified , 1999, STOC '99.

[5]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Greg Kuperberg A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem , 2005, SIAM J. Comput..

[7]  Sean Hallgren,et al.  Quantum algorithms for some hidden shift problems , 2003, SODA '03.

[8]  T. Beth,et al.  Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups , 1998, quant-ph/9812070.

[9]  Robert Beals,et al.  Quantum computation of Fourier transforms over symmetric groups , 1997, STOC '97.

[10]  Igor E. Shparlinski,et al.  Character Sums with Exponential Functions and their Applications: Applications to Coding Theory and Combinatorics , 1999 .

[11]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[12]  Alexander Russell,et al.  Generic quantum Fourier transforms , 2004, SODA '04.

[13]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[14]  Frédéric Magniez,et al.  Hidden translation and orbit coset in quantum computing , 2002, STOC '03.

[15]  Dave Bacon,et al.  From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[16]  P. Høyer Efficient Quantum Transforms , 1997, quant-ph/9702028.

[17]  J. Rotman An Introduction to the Theory of Groups , 1965 .

[18]  Sean Hallgren,et al.  An improved quantum Fourier transform algorithm and applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[19]  Joe Harris,et al.  Representation Theory: A First Course , 1991 .

[20]  Mark Ettinger,et al.  On Quantum Algorithms for Noncommutative Hidden Subgroups , 1998, STACS.

[21]  Umesh V. Vazirani,et al.  Quantum mechanical algorithms for the nonabelian hidden subgroup problem , 2001, STOC '01.

[22]  Frédéric Magniez,et al.  Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem , 2001, SPAA '01.

[23]  Ivan Damgård,et al.  On the Randomness of Legendre and Jacobi Sequences , 1990, CRYPTO.

[24]  Alexander Russell,et al.  For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets , 2007, Quantum Inf. Comput..

[25]  P. S. Aleksandrov,et al.  An introduction to the theory of groups , 1960 .

[26]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[27]  Alexander Russell,et al.  Normal subgroup reconstruction and quantum computation using group representations , 2000, STOC '00.