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 (0)

There are currently no matching articles.
See all articles in the same topic Create my own version