Algorithms for Quantum Computation: Discrete Logarithms and Factoring

DMCA

Algorithms for Quantum Computation: Discrete Logarithms and Factoring (1994)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Peter W. Shor

Citations:

1089 - 5 self

BibTeX

@MISC{Shor94algorithmsfor,
    author = {Peter W. Shor},
    title = {Algorithms for Quantum Computation: Discrete Logarithms and Factoring},
    year = {1994}
}

OpenURL

Abstract

A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their computational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored. These two problems are generally considered hard on a classical computer and have been used as the basis of several proposed cryptosystems. (We thus give the first examples of quantum cryptanalysis.) 1 Introduction Since the discovery of quantum mechanics, people have found the behavior of...

Keyphrases

discrete logarithm quantum computation quantum mechanic classical computer several researcher physical computational device david deutsch quantum cryptanalysis input size la vega algorithm quantum mechanical computer first example quantum computer polynomial factor universal computational device computation time computational property

DMCA