Abstract:

Quantum computers are emerging as one of the most novels technologies nowadays. These computers work through quantum circuits which, unlike classic computer circuits, follow the set of rules determined by quantum mechanics. However, those rules are counterintuitive, and it is necessary to define appropriate techniques to explain them to students. This work aims to improve the existing approaches to explain Grover’s search algorithm, which is known for demonstrating that quantum computers can outperform the traditional ones. We propose a new methodology to teach it that avoids complicated descriptions and uses a simple application example, namely, the classical division. In this context, the division is seen as the search of a number X that is equal to the dividend when multiplied by the divisor. We develop a complete explanation of the algorithm for this example. It covers the beginning, evolution, and finalization of the method conceptually and physically while also exposing its pros and cons. With this example, it is not necessary knowledge about quantum mechanics, nor neither geometry, only basic knowledge about quantum computing is necessary (which is also introduced in this work). Although there are better ways to solve divisions, we believe it is a perfect example to explain Grover’s algorithm. The objective of this paper is that Computer Engineering students understand the behavior and the bases of Quantum Computation and Grover's algorithm in particular. Therefore, the proposed methodology has been designed for being included in current degrees in Computer Engineering, which do not generally cover this topic despite its future potential.

Keywords:

Education, Computer science, quantum computation.