Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

  title={Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem},
  author={G{\'a}bor Ivanyos and Fr{\'e}d{\'e}ric Magniez and Miklos Santha},
  journal={Int. J. Found. Comput. Sci.},
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups, finding hidden subgroups of groups with small commutator subgroup and of groups admitting an elementary Abelian normal 2-subgroup of small index or with cyclic factor group. 
Finding hidden Borel subgroups of the general linear group
  • G. Ivanyos
  • Mathematics, Computer Science
    Quantum Inf. Comput.
  • 2012
We present a quantum algorithm for solving the hidden subgroup problem in the general linear group over a finite field where the hidden subgroup is promised to be a conjugate of the group of the
The Hidden Subgroup Problem and Quantum Computation Using Group Representations
A natural generalization of the algorithm for the abelian case to the nonabelian case is analyzed and it is shown that the algorithm determines the normal core of a hidden subgroup: in particular, normal subgroups can be determined.
An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint and detailed proofs are supplied which give very concrete algorithms and bounds for the finite abelian case with little out- side references.
Solution to the Hidden Subgroup Problem for a Class of Noncommutative Groups
A new polynomial-time quantum algorithm is presented that solves the HSP over the group $p/q= \up{poly}(\log p^r)$ and uses the abelian quantum Fourier transform and a reduction procedure that simplifies the problem to find cyclic subgroups.
Quantum algorithms for solvable groups
  • J. Watrous
  • Mathematics, Computer Science
    STOC '01
  • 2001
An important byproduct of this polynomial-time quantum algorithm is able to produce a pure quantum state that is uniform over the elements in any chosen subgroup of a solvable group, which yields a natural way to apply existing quantum algorithms to factor groups of solvable groups.
A quantum approach to the hidden subgroup problem using group representations and automorphisms
The hidden subgroup problem is a fundamental problem in quantum computation. It has many interesting instances for which we do not yet have an efficient classical algorithm and want to find or have
Permutation groups, minimal degrees and quantum computing
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group H ≤ Sn of minimal degree m and on
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
This paper presents a quantum algorithm solving instances of the nonabelian group isomorphism problem exponentially faster than the best known classical algorithms.
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
The hidden subgroup problem (HSP) over the class of semidirect product groups Zpr ⋊ Zq, for p and q prime is considered, and a polynomial-time quantum algorithm solving the HSP over all the groups of one of these classes is described.
The Hidden Subgroup Problem and Post-quantum Group-based Cryptography
  • Kelsey Horan, Delaram Kahrobaei
  • Computer Science, Mathematics
  • 2018
The relationship between HSP and other computational problems is reviewed, an optimal solution method is discussed, and the known results about the quantum complexity of HSP are reviewed.