An approximate Fourier transform useful in quantum factoring

Simple item page
dc.creatorCoppersmith, D.
dc.date2002-01-16
dc.date.accessioned2026-07-07T06:03:32Z
dc.date.available2026-07-07T06:03:32Z
dc.descriptionWe define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is currently under investigation by Peter Shor. (1994 IBM Internal Report)
dc.identifierhttps://arxiv.org/abs/quant-ph/0201067
dc.identifierhttp://arxiv.org/abs/quant-ph/0201067
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89976
dc.subjectQuantum Physics
dc.titleAn approximate Fourier transform useful in quantum factoring
dc.typetext

Files

Collections

arXiv