Creating Very True Quantum Algorithms for Quantum Energy Based Computing

An interpretation of quantum mechanics is discussed. It is assumed that quantum is energy. An algorithm by means of the energy interpretation is discussed. An algorithm, based on the energy interpretation, for fast determining a homogeneous linear function f(x) := s.x = s₁x₁ + s₂x₂ + ⋯ + s_Nx_N is proposed. Here x = (x₁, … , x_N), x_j ∈ R and the coefficients s = (s₁, … , s_N), s_j ∈ N. Given the interpolation values (f(1) , f(2) ,.. , f(N)) = y→ , the unknown coefficients s= (s₁(y→) , … , s_N(y→)) of the linear function shall be determined, simultaneously. The speed of determining the values is shown to outperform the classical case by a factor of N. Our method is based on the generalized Bernstein-Vazirani algorithm to qudit systems. Next, by using M parallel quantum systems, M homogeneous linear functions are determined, simultaneously. The speed of obtaining the set of M homogeneous linear functions is shown to outperform the classical case by a factor of N × M.