Skip to main page content
Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
, 499 (7457), 163-5

Oversimplifying Quantum Factoring

Affiliations

Oversimplifying Quantum Factoring

John A Smolin et al. Nature.

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.

Similar articles

See all similar articles

Cited by 2 PubMed Central articles

References

    1. Sci Rep. 2013 Oct 28;3:3023 - PubMed
    1. Phys Rev Lett. 2000 Oct 2;85(14):3049-52 - PubMed
    1. Phys Rev Lett. 2007 Dec 21;99(25):250504 - PubMed
    1. Phys Rev Lett. 2007 Dec 21;99(25):250505 - PubMed
    1. Phys Rev Lett. 1996 Apr 22;76(17):3228-3231 - PubMed

Publication types

LinkOut - more resources

Feedback