本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2010-10-01
摘要
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in 量子 computation are obtained by solving instances of the HSP. A common feature of the resulting algorithms is the use of 量子 coset states, which encode the hidden subgroup. An open question has been how hard it is to use these states to solve graph isomorphism. It was recently shown by Moore, Russell, and Schulman [30] that only an exponentially small amount of 資訊 is available from one, or a pair of coset states. A potential source of power to exploit are entangled 量子 measurements that act jointly on many states at once. We show that entangled 量子 measurements on at least Ω(n log n) coset states are necessary to get useful 資訊 for the case of graph iso
※ 此為已發表論文，全文需透過期刊付費取得