Hidden Subgroup Problem (HSP)
==============================

A family of problems where a function hides some structure (a period, a
secret string, a subgroup) and the goal is to recover it with as few queries
to the function as possible. This is where quantum algorithms show some of
their biggest speedups over classical ones, from Deutsch-Jozsa's one query
to Shor's exponential speedup for factoring.

.. toctree::
   :maxdepth: 1
   :caption: Algorithms

   deutsch_jozsa
   cluster