The Internet Archive has a preservation copy of this work in our general collections.
The file type is
One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve the problem. In this paper, we present general bounds for the sample complexity of the identification and decision versions of the hidden subgroup problem. As a consequence of the bounds, we show that the sample complexity for both of the decision and identification versions is Θ(||/ p) for a candidate set of hiddenarXiv:quant-ph/0604174v3 fatcat:o5yz5vlv5newfpvszzvh4xrqdq