Preprint
Sep 2026
The power of oracle access: Optimal sample and query complexity of the abelian state hidden subgroup problem
In the quest to identify further quantum algorithms exhibiting superpolynomial speed-ups, a recurring theme is that the complexity of a problem is largely shaped by the input access model. Here, we study this phenomenon for the state hidden subgroup problem (StateHSP), a quantum generalization of the hidden subgroup pr...
Yu-Han Liu, Jose Carrasco, J. Eisert et al.
· 1 citation