Highly Influenced

# Efficient networks for quantum factoring.

@article{Beckman1996EfficientNF, title={Efficient networks for quantum factoring.}, author={Beckman and A A Chari and Devabhaktuni and Preskill}, journal={Physical review. A, Atomic, molecular, and optical physics}, year={1996}, volume={54 2}, pages={1034-1063} }

- Published 1996 in Physical review. A, Atomic, molecular, and…

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 Proceedings of the 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser ~IEEE Computer Society, Los Alamitos, CA, 1994!, p. 124#. A K-bit number can be factored in time of order K using a machine… CONTINUE READING