Dihedral Hidden Subgroup Problem: A Survey

• Item type: Journal(1)
• 公開日: 2005-10-15
• タイトル: Dihedral Hidden Subgroup Problem: A Survey
• タイトル / 言語: en
• タイトル: Dihedral Hidden Subgroup Problem: A Survey
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 特集：量子計算と量子情報
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• その他タイトル / その他のタイトル: 招待論文
• 著者所属: Foundations of Information Research Division National Institute of Informatics.The earlier draft of this paper was written while at the Quantum Computation and Information Project Exploratory Research for Advanced Study Japan Science and Technology Agency.
• 著者所属: Department of Computer Science Graduate School of Information Science and Technology The University of Tokyo. Quantum Computation and Information Project Exploratory Research for Advanced Study Japan Science and Technology Agency.
• 著者所属(英): en
• 著者所属(英): Foundations of Information Research Division, National Institute of Informatics.The earlier draft of this paper was written while at the Quantum Computation and Information Project, Exploratory Research for Advanced Study, Japan Science and Technology Agency.
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo.,Quantum Computation and Information Project, Exploratory Research for Advanced Study, Japan Science and Technology Agency.
• 著者名: Hirotada, Kobayashi; FrancoisLeGall
• 著者名(英): Hirotada, Kobayashi; Francois, LeGall
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 46, 号 10, p. 2409-2416, 発行日 2005-10-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764