The GOOGLE and XPRIZE Award for How to Use Quantum Computers Practically: the Problem of the “P” Versus “NP” Outputs of Any Quantum Computer and the Pathway for Its Resolving

EasyChair Preprint 15705

Abstract

The GOOGLE and XPRIZE $5,000,000 for the practical and socially useful utilization of the quantum computer is the starting point for ontomathematical reflections for what it can really serve. Its “output by measurement” is opposed to the conjecture for a coherent ray able alternatively to deliver the ultimate result of any quantum calculation immediately as a Dirac -function therefore accomplishing the transition of the sequence of increasingly narrow probability density distributions to their limit. The GOOGLE and XPRIZE problem’s solution needs the initial understanding that the result of any quantum calculation is a wave function, or respectively, a probability (density or not) distribution unlike the Turing machine one, and only a “calculating ray” is able to transform the former into the later without any “curving” disturbances. Thus, the unique capability of the quantum computer due to its inherent quantum parallelism can be conserved for all Gödel unresolvable problems, only on the fast “NP” track of which the quantum computer “Achilles” is able practically to overrun the Turing machine “Tortoise” since the latter can “sprint” only by any “P” calculating speed even on it and unlike “Achilles” himself able for “NP” velocities as well. The way for any material body to “calculate” the certain trajectory of least action also resolves the “traveling salesman problem” in fact, therefore illustrating furthermore what the “NP” output of a quantum computer by a “calculating ray” should mean. Another example is the problem of the number of all prime numbers less than “N”, which is suggested to visualize once again the quantum computer capability to resolve problems by a “NP” speed and thus qualitatively to overrun any competing Turing machine. The technically implemented idea of laser is now reinterpreted to “radiate a wave function” in order to explain the “calculating ray” option for a quantum computer “NP” output.

Keyphrases: Turing machine, class of all Gödel insoluble problems, problem of the number of prime numbers, quantum Turing machine, quantum and classical information, quantum computer, qubits and bits, “N vs NP” problem, “Yang-Mills existence and mass gap problem”, “traveling salesman” problem

@booklet{EasyChair:15705,
  author    = {Vasil Penchev},
  title     = {The GOOGLE and XPRIZE Award for How to Use Quantum Computers Practically: the Problem of the “P” Versus “NP” Outputs of Any Quantum Computer and the Pathway for Its Resolving},
  howpublished = {EasyChair Preprint 15705},
  year      = {EasyChair, 2025}}