Grover's algorithm is one of the most popular quantum algorithms that solves the problem of "quantum search." But what is this problem, and what are its characteristics.
When considering other famous problems, like integer factorization, they are organized into complexity classes. Integer factorization, for example, is believed to be in the NP-intermediate class (the class of problems in NP that are not in P or NP-complete). Of course, it isn't a decision problem, so it should actually be in TFNP.
But where in the complexity hierarchy does "quantum search" lie?