Efficient Networks for Quantum Factoring

Details Efficient Networks for Quantum Factoring Efficient Networks for Quantum Factoring

1996-02-21

arxiv.org/abs/quant-ph/9602016v1

Phys. Rev.A54:1034-1063,1996

Physics

Quantum Physics

56 pages, 22 figures, uses REVTeX, epsf

Scientific paper

10.1103/PhysRevA.54.1034

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 $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.

Affiliated with

Also associated with

No associations

Rating

Efficient Networks for Quantum Factoring does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Networks for Quantum Factoring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Networks for Quantum Factoring will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-597888