Quantum factoring, discrete logarithms, and the hidden subgroup problem

  • Richard Jozsa
  • Published 2001 in Computing in Science and Engineering

Abstract

Amongst the most remarkable successes of quantum computation are Shor’s efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential ingredients of these algorithms and draw out the unifying generalization of the so-called abelian hidden subgroup problem… (More)
DOI: 10.1109/5992.909000

Topics

Statistics

051015'02'04'06'08'10'12'14'16'18
Citations per Year

64 Citations

Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Jozsa2001QuantumFD, title={Quantum factoring, discrete logarithms, and the hidden subgroup problem}, author={Richard Jozsa}, journal={Computing in Science and Engineering}, year={2001}, volume={3}, pages={34-43} }