Note on Developable Surfaces in Hyperspace

Here, we present various new forms of the Bernstein-Vazirani algorithm beyond qubit systems. First, we review the Bernstein-Vazirani algorithm for determining a bit string. Second, we discuss the generalized Bernstein-Vazirani algorithm for determining a natural number string. The result is the most notable generalization. Thirdly, we discuss the generalized Bernstein-Vazirani algorithm for determining an integer string. Finally, we discuss the generalized Bernstein-Vazirani algorithm for determining a complex number string. The speed of determining the strings is shown to outperform the best classical case by a factor of the number of the systems in every cases. Additionally, we propose a method for calculating many different matrices simultaneously. The speed of solving the problem is shown to outperform the classical case by a factor of the number of the elements of them. We hope our discussions will give a first step to the quantum simulation problem.