The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem
The complexity of the abelian StateHSP is settled in both the previously studied sample model and a new query model, which is a stronger and operationally natural generalization that provides access to the state-preparation unitary and its inverse.