In this note, we present deterministic algorithms for the Hidden Subgroup Problem. The algorithm for abelian groups achieves the same asymptotic query complexity as the optimal randomized algorithm. The algorithm for non-abelian groups comes within a polylogarithmic factor of the optimal randomized query complexity.

翻译：在本说明中,我们为隐藏分组问题展示了决定性的算法。 亚伯利亚集团的算法与最佳随机化算法具有相同的微调查询复杂性。 非亚美利亚集团的算法属于最佳随机化查询复杂性的多元数系数。