# Query and Search

**English** · <a href="../../../zh/manual/algorithms/groups/search.html">简体中文</a>

The family for inputs that are Boolean functions, or cases where a solution subspace must be decided and amplified: Grover search, amplitude amplification and its initial-state-oblivious variants, fixed-point search, and the counting-type algorithms built around amplitude estimation. Entries come mainly from the `search` module of `common`.

```{toctree}
:maxdepth: 1

../grover
../amplitude-amplification
../oblivious-amplification
../fixed-point-search
../qae
../quantum-counting
```