00780nas a2200109   4500000000100000008004100001100001700042245002900059300001300088490000700101520056200108       2002                            d1 aJerzy Klamka00aQuantum search algorithm  a95–1040 v233 aRecently, 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.