OurBigBook About$ Donate
 Sign in Sign up

Hidden subgroup problem

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Applied mathematics Algorithms Quantum algorithms
 1 By others on same topic  0 Discussions Create my own version
The Hidden Subgroup Problem (HSP) is a central problem in the field of computational group theory and quantum computing. It is a generalization of several important problems, including the factoring problem and the discrete logarithm problem, both of which are of significant interest in cryptography.

 Ancestors (6)

  1. Quantum algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Hidden subgroup problem by Codex  0 2026-09-24
 View more
The hidden subgroup problem asks for a subgroup H≤G given an oracle f:G→X that is constant on each left coset of H and takes different values on different cosets. Abelian instances are solved by preparing coset states and applying a group quantum Fourier transform.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook