Search

Here, we discuss the generalized Bernstein-Vazirani algorithm for determining a complex number string. The generalized algorithm presented here has the following structure. Given the set of complex values {a1, a2, a3,..., aN} and a special function g : C → C , we determine N real parts of values of the function l(a1), l(a2), l(a3),..., l(aN) and N imaginary parts of values of the function h(a1), h(a2), h(a3),..., h(aN) simultaneously. That is, we determine the N complex values g(aj) = l(aj) + ih(aj) simultaneously. We mention the two computing can be done in parallel computation method simultaneously. The speed of determining the string of complex values is shown to outperform the best classical case by a factor of N. Additionally, we propose a method for calculating many different matrices A, B, C,... into g(A), g(B), g(C),... 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. [ABSTRACT FROM AUTHOR]

It is demonstrated that a probability loophole exists for Einstein local hidden variables to violate the Clauser, Horne, Shimony, and Holt contrast. [ABSTRACT FROM AUTHOR]

In this paper a type D breakdown of the Navier Stokes (NS) in with , is demonstrated. The element of the breakdown also occurs in the Euler equation. We consider the fact that in , Ladyzhenskaya found an exact type B solution. The discussion revolves around the notion, also found in quantum spin theory, that in the behavior of a system can be quite different from the behavior in . Concerning applications, our resolution of the problem implies that e.g. hydrology problems formulated as a NS equation can only be solved in computational approximation. [ABSTRACT FROM AUTHOR]

Here, we consider the Bell experiment for a system described by multipartite states in the case where n-dichotomic observables are measured per site. If n is two, we consider a two-setting Bell experiment. If n is three, we consider a three-setting Bell experiment. Two-setting model is an explicit local realistic model for the values of a correlation function, given in a two-setting Bell experiment. Three-setting model is an explicit local realistic model for the values of a correlation function, given in a three-setting Bell experiment. In the non-contextual scenario, there is not the difference between three-setting model and two-setting model. And we cannot classify local realistic theories in this case. This says that we can construct three-setting model from two-setting model. Surprisingly we can discuss incompleteness in the Bell theorem using non-contextual model. On the other hand, in the contextual scenario, there is the difference between three-setting model and two-setting model. This says that we must distinguish three-setting model from two-setting model. And we can classify local realistic theories in this case. [ABSTRACT FROM AUTHOR]

Two quantum algorithms of finding the roots of a polynomial function f(x) = xm + am− 1xm− 1 +... + a1x + a0 are discussed by using the Bernstein-Vazirani algorithm. One algorithm is presented in the modulo 2. The other algorithm is presented in the modulo d. Here all the roots are in the integers Z. The speed of solving the problem is shown to outperform the best classical case by a factor of m in both cases. [ABSTRACT FROM AUTHOR]

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 {a1,a2,a3,…,aN} and a function g:R→{0,1}, we shall determine the following values {g(a1),g(a2),g(a3),…,g(aN)} simultaneously. The speed of determining the values is shown to outperform the classical case by a factor of N. Next, we consider it as a number in binary representation; M1 = (g(a1),g(a2),g(a3),…,g(aN)). By using M parallel quantum systems, we have M numbers in binary representation, simultaneously. The speed of obtaining the M numbers is shown to outperform the classical case by a factor of M. Finally, we calculate the product; M1×M2×⋯×MM. The speed of obtaining the product is shown to outperform the classical case by a factor of N × M. [ABSTRACT FROM AUTHOR]

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 = s1x1 + s2x2 + ⋯ + sNxN is proposed. Here x = (x1, …, xN), xj ∈ R and the coefficients s = (s1, …, sN), sj ∈ N. Given the interpolation values (f(1),f(2),...,f(N))=y→, the unknown coefficients s=(s1(y→),…,sN(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. [ABSTRACT FROM AUTHOR]