Oversimplifying quantum factoring
Abstract
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.
 Publication:

Nature
 Pub Date:
 July 2013
 DOI:
 10.1038/nature12290
 arXiv:
 arXiv:1301.7007
 Bibcode:
 2013Natur.499..163S
 Keywords:

 Quantum Physics
 EPrint:
 15 pages including 3 figures and supplementary material