## Abstract

Several quantum algorithms are described, in particular, the Deutsch, Deutsch-Jozsa, Simon and quantum teleportation algorithms, chosen because they do not require any specialist mathematical background. Deutsch’s algorithm is presented from different viewpoints with the goal of exploring the quantum computing paradigm. The Deutsch-Jozsa algorithm is described using some of the material developed in regard to the Deutsch algorithm. Both the Deutsch and Deutsch-Jozsa algorithms are rather academic, but they are useful for illustrating thinking processes in quantum computing. Simon’s algorithm, which focuses on finding the period for a given function, is quite practical and relies on both quantum and conventional procedures. We conclude with a discussion and illustration of quantum teleportation, emphasizing the fact that only information is teleported, not any physical device or person. We also note that both quantum channels and conventional channels are needed for teleportation, which explains why teleportation cannot be faster than the speed of light in a vacuum.