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}
}
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
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 87 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Proc

  • D. Deutsch
  • R. Soc. London A 400, 96 (1985); 425, 73
  • 1989
Highly Influential
16 Excerpts

Int

  • R. P. Feynman
  • J. Theor. Phys. 21, 467
  • 1982
Highly Influential
18 Excerpts

and R

  • A. Barenco, D. Deutsch, A. Ekert
  • Jozsa, Phys. Rev. Lett. 74, 4083
  • 1995
Highly Influential
6 Excerpts

Develop

  • C. H. Bennett, IBM J. Res
  • 17, 525
  • 1973
Highly Influential
5 Excerpts

18

  • C. H. Bennett, SIAM J. Comput
  • 766
  • 1989
Highly Influential
8 Excerpts

Quantum networks,” in Quantum Computing, JASON Report JSR

  • A. Despain
  • (The MITRE Corporation,
  • 1996
2 Excerpts

Shor’s quantum algorithm for factorising numbers,

  • A. Ekert, R. Jozsa
  • to appear in Rev. Mod. Phys
  • 1996
2 Excerpts

Phys

  • C. Monroe, D. M. Meekhof, B. E. King, W. M. Itano, D. J. Wineland
  • Rev. Lett. 75, 4714
  • 1995

Similar Papers

Loading similar papers…