Journal
NATURE
Volume 499, Issue 7457, Pages 163-165Publisher
NATURE PUBLISHING GROUP
DOI: 10.1038/nature12290
Keywords
-
Categories
Funding
- IARPA [W911NF-10-1-0324]
- DARPA QUEST [HR0011-09-C-0047]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available