Fast versions of Shor's quantum factoring algorithm

Simple item page
dc.creatorZalka, Christof
dc.date1998-06-24
dc.date.accessioned2026-07-07T06:15:15Z
dc.date.available2026-07-07T06:15:15Z
dc.descriptionWe present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer multiplication. The quick reader can just read the introduction and the ``Results'' section.
dc.description37 pages, LaTeX, 1 figure
dc.identifierhttps://arxiv.org/abs/quant-ph/9806084
dc.identifierhttp://arxiv.org/abs/quant-ph/9806084
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93739
dc.subjectQuantum Physics
dc.titleFast versions of Shor's quantum factoring algorithm
dc.typetext

Files

Collections

arXiv