Abstract
We present a new method of more speedily calculating a multiplication by using the generalized Bernstein-Vazirani algorithm and many parallel quantum systems. Given the set of real values and a function , we shall determine the following values simultaneously. The speed of determining the values is shown to outperform the classical case by a factor of . Next, we consider it as a number in binary representation; M (1) = (g(a (1)),g(a (2)),g(a (3)),aEuro broken vertical bar,g(a (N) )). By using parallel quantum systems, we have numbers in binary representation, simultaneously. The speed of obtaining the numbers is shown to outperform the classical case by a factor of . Finally, we calculate the product; The speed of obtaining the product is shown to outperform the classical case by a factor of N x M.