Efficient networks for quantum factoring
- California Institute of Technology, Pasadena, California 91125 (United States)
We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory quantum bits (qubits) and the number of operations required to perform factorization, using the algorithm suggested by Shor [in {ital Proceedings} {ital of} {ital the} 35{ital th} {ital Annual} {ital Symposium} {ital on} {ital Foundations} {ital of} {ital Computer} {ital Science}, edited by S. Goldwasser (IEEE Computer Society, Los Alamitos, CA, 1994), p. 124]. A {ital K}-bit number can be factored in time of order {ital K}{sup 3} using a machine capable of storing 5{ital K}+1 qubits. Evaluation of the modular exponential function (the bottleneck of Shor{close_quote}s algorithm) could be achieved with about 72{ital K}{sup 3} elementary quantum gates; implementation using a linear ion trap would require about 396{ital K}{sup 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. {copyright} {ital 1996 The American Physical Society.}
- OSTI ID:
- 434679
- Journal Information:
- Physical Review A, Journal Name: Physical Review A Journal Issue: 2 Vol. 54; ISSN 1050-2947; ISSN PLRAAN
- Country of Publication:
- United States
- Language:
- English
Similar Records
Decoherence bounds on the capabilities of cold trapped ion quantum computers
Determining constants in Shor`s discrete log algorithm over Zp