An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups

  title={An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups},
  author={G{\'a}bor Ivanyos and Luc Sanselme and Miklos Santha},
Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in extraspecial groups. Our approach is quite different from the recent algorithms presented in [17] and [2] for the Heisenberg group, the extraspecial p-group of size p3 and exponent p. Exploiting certain nice automorphisms of the extraspecial groups we define… 
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups
It is shown that the hidden subgroup problem in nil-2 groups, that is in groups of nilpotency class at most 2, can be solved efficiently by a quantum procedure, and the existence of a solution is guaranteed by the Chevalley-Warning theorem.
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
This work shows that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer and uses Clebsch-Gordan decompositions to combine and reduce tensor products of irreducible representations.
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
Efficient quantum algorithm for identifying hidden polynomials
A aquantum algorithm is presented that correctly identifies hidden m-variate polynomials for all but a finitenumber of values of d with constant probability and that has a running time that is onlypolylogarithmic in d.
The Hidden Subgroup Problem for Universal Algebras
This work identifies a class of algebras for which the generalized HSP exhibits super-polynomial speedup on a quantum computer compared to a classical one and proves a complete classification of every such power as quantum tractable, quantum intractable, or classicallyintractable.
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems
The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input consists of several level set superpositions, a more difficult version of the problem than the one where the input is given by an oracle.
Abelian Hypergroups and Quantum Computation
A stabilizer formalism using abelian hypergroups and an associated classical simulation theorem is developed and a new, hypergroup-based algorithm for the HNSP on nilpotent groups is developed.
Efficient Quantum Algorithm for the Hidden Parabola Problem
The success probability and the implementation of this measurement to certain classical problems involving polynomial equations are related and an efficient algorithm for hidden parabola is presented by establishing that the success probability of the measurement is lower bounded by a constant and that it can be implemented efficiently.
The Hidden Subgroup Problem
An overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1, and analyse Regev's algorithm for the poly(n)-uniqueSVP, proving how the degree of the polynomial is related to the oracle complexity used and suggesting several variants.
The computational power of normalizer circuits over black-box groups
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems, and finds that normalizer circuits are powerful enough to factorize and solve classically-hard problems in the black-box setting.


Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
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
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.
Normal subgroup reconstruction and quantum computation using group representations
It is shown that an immediate generalization of the Abelian case solution to the non-Abelian case does not efficiently solve Graph Isomorphism.
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
The results show that entangled measurements across multiple copies of hidden subgroup states can be useful for efficiently solving the nonabelian HSP.
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group
It is shown that the random strong method can be quite powerful under certain conditions on the group G and that the HSP can be solved using polynomially many random strong Fourier samplings followed by a possibly exponential classical post-processing without further queries.
Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups
An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being the core of this
Quantum measurements and the Abelian Stabilizer Problem
  • A. Kitaev
  • Mathematics
    Electron. Colloquium Comput. Complex.
  • 1996
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator.
Quantum error correction via codes over GF(4)
In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product.
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups
It is shown that hidden subgroups of semidirect products of the form ℤ<inf><i>q</i></inf> ×ℤ <i>p</i</i>, can be efficiently determined by the strong standard method and a simple closure property is proved for the class of groups over which the hidden subgroup problem can be solved efficiently.
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
We provide positive and negative results concerning the “standard method” of identifying a hidden subgroup of a nonabelian group using a quantum computer.