Expanding the scope of quantum annealing applicability

With the emergence of D-wave’s quantum annealing machine, the power of quantum computing has become tangible, and the development of quantum computers is accelerating rapidly. Unfortunately, at present, the minimum value search that D-wave’s quantum annealing machine can handle is limited to quadratic functions of binary integer variables. This constraint is due to both hardware and software limitations. If this constraint was to be lifted, it would undoubtedly bring about a revolution in the world. Therefore, in this study, we obtained the basic mathematics of using quantum annealing, which enables hyper-parallel computing using qubits, to find the global minimum of any minimum value problem. Furthermore, we conducted simple simulations using classical computers to demonstrate the effectiveness of the ideas and algorithms. Furthermore, we conducted simple simulations using classical computers to demonstrate the effectiveness of the ideas and algorithms. We obtained also the mathematical method of using quantum annealing in learning neural networks and solving linear equations.