  The driving force in the pursuit for quantum computation is the exciting
possibility that quantum algorithms can be more efficient than their classical
analogues. Research on the subject has unraveled several aspects of how that
can happen. Clever quantum algorithms have been discovered in recent years,
although not systematically, and the field remains under active investigation.
Richard Feynman was one of the pioneers who foresaw the power of quantum
computers. In this issue dedicated to him, I give an introduction to how
particle and wave aspects contribute to the power of quantum computers. Shor's
and Grover's algorithms are analysed as examples.

Quantum Physics;Computational Physics;Physics Education