Quantum Algorithms for Minimum Generating Set

In this paper, we present a polynomial-time quantum algorithm for computing a minimum-sized generating set of solvable black-box groups. Next, we consider the class ${\mathrm{\Gamma }}_d$ of black-box groups, where every non-abelian composition factor is isomorphic to a subgroup of the symmetric group $S_d$ for a fixed $d$. We design polynomial-time quantum algorithms to compute the direct product decomposition of abelian factor groups and solve the constructive membership problem for factor groups of groups from ${\mathrm{\Gamma }}_d$. With the help of these algorithms, we design a quantum algorithm for computing a chief series of black-box groups from ${\mathrm{\Gamma }}_d$. Using the chief series, we construct a polynomial-time quantum algorithm for computing minimum generating sets of black-box groups from ${\mathrm{\Gamma }}_d$. Finally, we show that the minimum generating set problem for general black-box groups is in $\text{NP}\cap \text{coAM}$.