Algorithms for Quantum Computation: The Derivatives of Discontinuous Functions

Abstract

We hope this work allows one to calculate large prime numbers directly, not by trial-and-error, but following a physical law. We report—contrary to conventional assumptions—that differentiation of discontinuous functions (DDF) exists in the set Q, which becomes central to algorithms for quantum computation. DDF have been thought to exist not in the classical sense, but using distributions. However, DDF using distributions still is defined in terms of mathematical real-numbers (MRN), and do not address the Problem of Closure, here investigated. These facts lead to contradictions using MRN, solved by this work, providing a new unbounded class of physical solutions using physical numbers in quantum mechanics (QM), that were always there (just hidden), allowing DDF without distributions, or MRN. It is worthwhile to see this only in mathematics, to avoid the prejudices found in physics, as this reforms both general relativity and QM. This confirms the opinions of Nicolas Gisin that MRN are non-computable with probability 1, and Niels Bohr that physics is not reality, it is a fitting story about reality. Mathematics can get closer to reality, surprisingly. We just have to base mathematics on nature, not on how it defines nature.