隐藏子群问题的核心性质
The central nature of the Hidden Subgroup problem
摘要:
我们表明,在量子计算中突出的几个问题,包括隐藏陪集,隐藏移位和轨道陪集,是等价的或可还原为隐藏子群的各种群体。我们还证明了,在置换群上,隐子群的判定版本和搜索版本是多项式时间等价的。对于二面体群上的隐子群,如果群的阶是光滑的,则可以得到这样一个等价。最后,我们给出了隐子群的非自适应程序检测器及其判定形式。
英文摘要:
We show that several problems that figure prominently in quantum computing, including Hidden Coset, Hidden Shift, and Orbit Coset, are equivalent or reducible to Hidden Subgroup for a large variety of groups. We also show that, over permutation groups, the decision version and search version of Hidden Subgroup are polynomial-time equivalent. For Hidden Subgroup over dihedral groups, such an equivalence can be obtained if the order of the group is smooth. Finally, we give nonadaptive program checkers for Hidden Subgroup and its decision version.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。