Dihedral Hidden Subgroup Problem: A Survey

情報処理学会 Web Site

書誌事項

タイトル別名
  • 招待論文

この論文をさがす

説明

After Shor's discovery of an efficient quantum algorithm for integer factoring hidden subgroup problems play a central role in developing efficient quantum algorithms. In spite of many intensive studies no efficient quantum algorithms are known for hidden subgroup problems for many non-Abelian groups. Of particular interest are the hidden subgroup problems for the symmetric group and for the dihedral group because an efficient algorithm for the former implies an efficient solution to the graph isomorphism problem and that for the latter essentially solves a certain lattice-related problem whose hardness is assumed in cryptography. This paper focuses on the latter case and gives a comprehensive survey of known facts related to the dihedral hidden subgroup problem.

After Shor's discovery of an efficient quantum algorithm for integer factoring, hidden subgroup problems play a central role in developing efficient quantum algorithms. In spite of many intensive studies, no efficient quantum algorithms are known for hidden subgroup problems for many non-Abelian groups. Of particular interest are the hidden subgroup problems for the symmetric group and for the dihedral group, because an efficient algorithm for the former implies an efficient solution to the graph isomorphism problem, and that for the latter essentially solves a certain lattice-related problem whose hardness is assumed in cryptography. This paper focuses on the latter case and gives a comprehensive survey of known facts related to the dihedral hidden subgroup problem.

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ