Ultimate Algorithm for Quantum Computers
Koji Nagata, Tadao Nakamura · viXra · 2019
We first propose herein a novel parallel computation, even though today's algorithm methodology for quantum computing, for all of the combinations of values in variables of a logical function. Our concern so far has been to obtain an attribute of some function. In fact such a task is only for one task problem solving. However, we could treat positively the plural evaluations of some logic function in parallel instead of testing the function for finding out its attribute. In fact, these evaluations of the function are naturally included and evaluated, in parallel, in normal quantum computing discussing a function in a Boolean algebra stemmed from atoms in it. As is naturally understandable with mathematics, quantum computing with qubit systems naturally is included and exemplified by a Boolean algebra, which treats only both 0 and 1. Namely, the theory in this paper is quite natural in logical sense even though physics domain. Therefore, quantum computing has an ability to solve some mathematical problems described in a Boolean algebra. The reason why we positively introduce a Boolean algebra here is because we have multiple evaluations of a function in quantum computing general.