Physicists have long known that quantum mechanics leads to paradoxical effects. Recently, it has been realized that these effects can be made use of in expediting certain computations. One application where quantum mechanics gives a significant advantage is the exhaustive search problem where it is possible to search N records in only sqrt(N) steps (a classical computer would need N steps.) This talk introduces quantum computation by using the search algorithm as an example.