期刊
NATURE
卷 499, 期 7457, 页码 163-165出版社
NATURE PUBLISHING GROUP
DOI: 10.1038/nature12290
关键词
-
资金
- IARPA [W911NF-10-1-0324]
- DARPA QUEST [HR0011-09-C-0047]
Shor's quantum factoring algorithm exponentially outperforms known classical methods. Previous experimental implementations have used simplifications dependent on knowing the factors in advance. However, as we show here, all composite numbers admit simplification of the algorithm to a circuit equivalent to flipping coins. The difficulty of a particular experiment therefore depends on the level of simplification chosen, not the size of the number factored. Valid implementations should not make use of the answer sought.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据