A fast quantum mechanical algorithm for database search

Explore this paper's citation graph

Summary

In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .

Type
article
Published
1996-05-29
Cited by
10,283
References
23
Access
Open access

Keywords

Citation, Computer science, Information retrieval, Database, Algorithm

References

Cited by

Related papers