| Abstrakt |
Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations. It now appears that, at least theoretically, quantum computations may be much faster than classical computations for solving certain problems including for example search problems. In the present paper the fundamental Grover’s search algorithm of quantum computation is discussed. Fundamental quantum operators for Grover’s search algorithm are presented. Moreover, several remarks and comments concerning quantum computations are also given. |
