Efficient Networks for Quantum Factoring

Simple item page
dc.creatorBeckman, David
dc.creatorChari, Amalavoyal N.
dc.creatorDevabhaktuni, Srikrishna
dc.creatorPreskill, John
dc.date1996-02-21
dc.date.accessioned2026-07-07T12:20:34Z
dc.date.available2026-07-07T12:20:34Z
dc.descriptionWe consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm suggested by Shor. A $K$-bit number can be factored in time of order $K^3$ using a machine capable of storing $5K+1$ qubits. Evaluation of the modular exponential function (the bottleneck of Shor's algorithm) could be achieved with about $72 K^3$ elementary quantum gates; implementation using a linear ion trap would require about $396 K^3$ laser pulses. A proof-of-principle demonstration of quantum factoring (factorization of 15) could be performed with only 6 trapped ions and 38 laser pulses. Though the ion trap may never be a useful computer, it will be a powerful device for exploring experimentally the properties of entangled quantum states.
dc.description56 pages, 22 figures, uses REVTeX, epsf
dc.identifierhttps://arxiv.org/abs/quant-ph/9602016
dc.identifierhttp://arxiv.org/abs/quant-ph/9602016
dc.identifierPhys. Rev.A54:1034-1063,1996
dc.identifierdoi:10.1103/PhysRevA.54.1034
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/213100
dc.subjectQuantum Physics
dc.titleEfficient Networks for Quantum Factoring
dc.typetext

Files

Collections

arXiv