1996/02/21 by David Beckman, Amalavoyal N. Chari, Srikrishna Devabhaktuni +1 · 3 citations
Physics and Astronomy · #quant-ph
paper · pdf · doi:10.1103/physreva.54.1034
published as Phys. Rev.A54:1034-1063,1996 · 56 pages, 22 figures, uses REVTeX, epsf
arxiv created 1996/02/21 · arxiv updated 2009/12/01
We 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 K3 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 K3 elementary quantum gates; implementation using a linear ion trap would require about 396 K3 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.