Quantum Dual Adversary For Hidden Subgroups And Beyond

UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, UCNC 2019（2019）

引用 0|浏览27

暂无评分

摘要

An explicit quantum dual adversary for the S-isomorphism problem is constructed. As a consequence, this gives an alternative proof that the query complexity of the dihedral hidden subgroup problem is polynomial.

查看译文

关键词

Quantum algorithms, Hidden subgroup problem, Property testing, Isomorphism testing, Quantum aversary bound

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要