dc.contributor.author Brockmann, Andrew dc.date.accessioned 2018-08-08T18:49:21Z dc.date.available 2018-08-08T18:49:21Z dc.date.issued 2018-08-08T18:49:21Z dc.identifier.citation TR1852 dc.identifier.uri http://digital.library.wisc.edu/1793/78673 dc.description.abstract A 2012 quantum experiment factored 143 after performing some simplifications classically. Further research demonstrated that that experiment arguably performed the quantum factorizations of other numbers too, such as 56153. This paper characterizes the numbers factored by the 2012 experiment, demonstrates that there are infinitely many of these numbers if the Bateman-Horn conjecture is correct, and provides $N_{2000} \approx 7.86 \cdot 10^{2000}$ as an explicit example. Finally, we show that, in asymptotic terms, most of the work in these factorizations was done classically. These quantum factorizations therefore do not seem to indicate progress toward factoring large RSA moduli. en dc.language.iso en_US en dc.relation.ispartofseries tech reports;TR1852 dc.subject quantum computing en dc.subject factoring en dc.subject number theory en dc.title Overreliance on Classical Computing in Quantum Factorization en dc.type Technical Report en
﻿

### This item appears in the following Collection(s)

• CS Technical Reports
Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison