title: 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.
authors.affiliation: IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, USA. smolin@alum.mit.edu
authors.forename: John A
authors.initials: JA
authors.lastname: Smolin
authors.forename: Graeme
authors.initials: G
authors.lastname: Smith
authors.forename: Alexander
authors.initials: A
authors.lastname: Vargo