We present a proposal addressing the foundational question of whether quantum mechanics can be reformulated in a computable way. Using a rational, and deterministic framework based on arbitrary-length integers and algebra. Departing from traditional models that rely on real numbers, complex amplitudes, and probabilistic interpretations, we propose a rational-number-based formulation of quantum mechanics. We demonstrate this approach through the exact eigenvalue formulation of the Schrödinger equation, a harmonization of general relativity with QM, and a reworking of Shor's algorithm using only finite, rational arithmetic (ISA). Our results suggest that quantum theory can be grounded in exact, computable logic that aligns with physical measurement, quantum computing, and existing digital hardware.
We present a proposal addressing the foundational question of whether quantum mechanics can be reformulated in a computable way. Using a rational, and deterministic framework based on arbitrary-length integers and algebra. Departing from traditional models that rely on real numbers, complex amplitudes, and probabilistic interpretations, we propose a rational-number-based formulation of quantum mechanics. We demonstrate this approach through the exact eigenvalue formulation of the Schrödinger equation, a harmonization of general relativity with QM, and a reworking of Shor's algorithm using only finite, rational arithmetic (ISA). Our results suggest that quantum theory can be grounded in exact, computable logic that aligns with physical measurement, quantum computing, and existing digital hardware.
We present a proposal addressing the foundational question of whether quantum mechanics can be reformulated in a computable way. Using a rational, and deterministic framework based on arbitrary-length integers and algebra. Departing from traditional models that rely on real numbers, complex amplitudes, and probabilistic interpretations, we propose a rational-number-based formulation of quantum mechanics. We demonstrate this approach through the exact eigenvalue formulation of the Schrödinger equation, a harmonization of general relativity with QM, and a reworking of Shor's algorithm using only finite, rational arithmetic (ISA). Our results suggest that quantum theory can be grounded in exact, computable logic that aligns with physical measurement, quantum computing, and existing digital hardware.
We present a proposal addressing the foundational question of whether quantum mechanics can be reformulated in a computable, rational, and deterministic framework. Departing from traditional models that rely on real numbers, complex amplitudes, and probabilistic interpretations, we propose a rational-number-based formulation of quantum mechanics. We demonstrate this approach through the exact eigenvalue formulation of the Schrödinger equation and a reworking of Shor's algorithm using only finite, rational arithmetic (ISA). Our results suggest that quantum theory can be grounded in exact, computable logic that aligns with both physical measurement, quantum computing, and digital hardware.
AbstractStandard quantum mechanics is formulated using complex Hilbert spaces, real-valued probabilities, continuous one-parameter dynamics, and—where particles and fields have continuous degrees of freedom —function spaces constructed over continua such as R3 . In that precise mathematical sense, the real and complex continua are deeply embedded in the standard theory. It does not follow, however, that experiments have demonstrated the physical existence of an uncountable set of exact real numbers, still less that individual quantum systems physically “store” infinitely many digits. Every preparation, control operation, and measurement has finite precision, and many quantum predictions can be approximated arbitrarily closely using countable or finite descriptions.This distinction matters because the continuum is sometimes blamed for quantum theory's conceptual strangeness. That diagnosis is mostly unsupported. Superposition, interference, uncertainty, noncommutativity, entanglement, contextuality, Bell-inequality violations, and no-cloning already occur in finite-dimensional quantum systems and do not depend in any straightforward way on continuous position space or arbitrary irrational numbers. Restricting a Hilbert space to rational, algebraic, computable, or finitely specified states therefore does not automatically produce classical physics. Indeed, dense restricted subsets can approximate ordinary quantum predictions to arbitrary finite accuracy, although turning such a subset into a complete physical theory requires much more: closed dynamics, a composition rule, a measurement theory, robustness, and new empirical predictions.A particularly developed contemporary alternative is Tim Palmer's Invariant Set Theory and its recent formulation as Rational Quantum Mechanics (RaQM). RaQM is not accurately described as simply “quantum mechanics with irrational numbers banned.” It restricts the bases in which states are physically defined through number-theoretic rationality conditions, represents admissible states using finite bit strings, invokes a fractal invariant state space equipped with a non-Euclidean, p-adic-like metric, and violates Bell measurement independence at the level of exact counterfactual settings. Palmer's 2026 proposal further predicts a finite qubit-information capacity and an eventual saturation of quantum computational advantage. These are genuine, potentially falsifiable proposals, but they remain speculative and have not displaced standard quantum theory.The strongest conclusion is consequently asymmetric. There is a serious foundational question about whether the continuum is an ontological feature of nature or an extraordinarily efficient mathematical completion. Finite precision prevents existing experiments from proving a literal continuum. But there is presently little evidence that continuum mathematics causes quantum phenomena. Any discrete replacement must still account quantitatively for interference, contextuality, Bell correlations, entanglement, spectroscopy, atomic structure, and quantum computation. Discreteness can change quantum physics only when it is accompanied by additional physical postulates—and those postulates, rather than discreteness alone, must ultimately face experiment.
Motivated in part by John Wheeler's assertion that the continuum nature of Hilbert Space conceals the "it-from-bit" information-theoretic character of the quantum wavefunction, a theory of quantum physics (Rational Quantum Mechanics-RaQM) is proposed based on a specific discretization of complex Hilbert Space. The Schrödinger equation is not modified in RaQM, even during measurement. However, the bases in which the quantum state is defined must satisfy certain rational-number constraints. These constraints lead to the notion of finite qubit information capacity [Formula: see text]: For any [Formula: see text] qubit state, there is insufficient information in the [Formula: see text] qubits (linearly growing in [Formula: see text]) to allocate even one bit to each of all [Formula: see text] continuum degrees of freedom (exponentially growing in [Formula: see text]) associated with quantum mechanics/theory (QM, where [Formula: see text]). It is proposed that the discretization of Hilbert Space in RaQM is due to gravity, hence QM is the (singular) continuum limit of RaQM at [Formula: see text]. On this basis, it is estimated that [Formula: see text] lies between about 200 and 400 for current qubit technologies, and will never exceed 1,000. While QM and RaQM are experimentally indistinguishable for small numbers of qubits, RaQM predicts that the exponential advantage of quantum algorithms which, like Shor's, require bases with maximal [Formula: see text]-qubit superposition/entanglement, will have saturated at 1,000 perfect qubits. Hence, insofar as a classical computer will never factor a 2,048-bit RSA integer, RaQM predicts that a quantum computer will not either. This predicted breakdown of QM could be testable in less than 5 y.
This work presents a comprehensive and rigorous examination of quantum computing, spanning its mathematical foundations, physical principles, algorithmic developments, hardware architectures, and philosophical implications. Beginning with linear algebra over Hilbert spaces and the postulates of quantum mechanics, the manuscript develops the formal structure of quantum information theory, including qubits, entanglement, quantum channels, and noise models. The work provides in-depth treatments of the quantum circuit model, alternative computation paradigms such as measurement-based, adiabatic, and topological quantum computation, and the theoretical framework of quantum error correction, including stabilizer and surface codes. Foundational and modern quantum algorithms are analysed in detail, including Shor’s factoring algorithm, Grover’s search, variational quantum eigensolvers, QAOA, and emerging quantum machine learning approaches. Beyond algorithms and implementations, the manuscript addresses scalability challenges, fault tolerance, computational complexity limits, and the implications of quantum computing for cryptography and the extended Church–Turing thesis. The concluding sections explore philosophical questions concerning interpretation, measurement, and the relationship between computation and physical reality. This work is intended as both a reference text and a research-level synthesis for advanced students, researchers, and practitioners in quantum computing, theoretical computer science, and quantum physics.
This work introduces a complete and self-consistent framework for quantum computation within the domain of real-valued quantum mechanics. Standard quantum computation is predicated on the manipulation of states in a complex Hilbert space, where a complex phase is a critical resource. We demonstrate that this complex structure is not fundamental but can be fully reproduced by a real-operator algebra. Our formalism is built upon a rigorous algebraic isomorphism between the imaginary unit i and the temporal Hilbert transform operator Ht, which acts as a physical generator of phase. Leveraging this isomorphism, we systematically redefine the fundamental quantum logic gates-including the Pauli, Hadamard, phase rotation, and CNOT gates-entirely within a real operator algebra. We prove that each gate's action on a real-valued qubit state representation is mathematically and operationally equivalent to its conventional complex counterpart. The Pauli-Y, phase, and controlled-phase gates, which are intrinsically complex in the standard model, are shown to correspond to real-operator matrices involving the Hilbert transform. This formulation provides a physically grounded interpretation of quantum logic, where abstract phase manipulation corresponds to the application of a concrete, albeit non-local, integral transform. We demonstrate how this framework correctly reproduces the generation of quantum entanglement and establishes a consistent measurement theory via an Analytic Born Rule in Unified Quantum Mechanics. This work solidifies the viability of a complete real-valued model for quantum information processing and suggests new paradigms for the physical implementation of quantum hardware.