Show simple item record

dc.contributor.authorBrockmann, Andrew
dc.date.accessioned2018-08-08T18:49:21Z
dc.date.available2018-08-08T18:49:21Z
dc.date.issued2018-08-08T18:49:21Z
dc.identifier.citationTR1852
dc.identifier.urihttp://digital.library.wisc.edu/1793/78673
dc.description.abstractA 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.isoen_USen
dc.relation.ispartofseriestech reports;TR1852
dc.subjectquantum computingen
dc.subjectfactoringen
dc.subjectnumber theoryen
dc.titleOverreliance on Classical Computing in Quantum Factorizationen
dc.typeTechnical Reporten


Files in this item

Thumbnail

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

Show simple item record