本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2010
摘要
Daniel Simon's 1994 discovery of an efficient 量子 algorithm for finding "hidden shifts" of Z(2)(n) provided the first algebraic problem for which 量子 computers are exponentially faster than their classical counterparts. In this article, we study the generalization of Simon's problem to arbitrary groups. Fixing a finite group G, this is the problem of recovering an involution (m) over right arrow = (m(1),..., m(n)) is an element of G(n) from an oracle f with the property that f ((x) over right arrow.(y) over right arrow) = f ((x) over right arrow) double left right arrow (y) over right arrow is an element of {(1) over right arrow, (m) over right arrow}. In the current parlance, this is the hidden subgroup problem (HSP) over groups of the form G(n), where G is a nonabelian group of constant si
※ 此為已發表論文，全文需透過期刊付費取得