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.
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.
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.
Rational Quantum Mechanics (RaQM) is a theory consistent with Gerard ’t Hooft’s proposals about the locally causal nature of quantum physics. Based on a specific discretization of the Riemann Sphere, the quantum state only is only defined in bases where squared amplitudes and complex phases (divided by [Formula: see text]) are rational numbers. These “rational bases” correspond to ’t Hooft’s ontological bases in which the quantum state has a beable representation. Bell’s inequality is violated without breaking realism, locality or free choice. Instead, for each run in a Bell experiment, a number-theoretic property of the cosine function ensures that the squared amplitude of the singlet state is an irrational number in at least one of the two counterfactual pairs of bases needed to derive Bell’s inequality. Hence, the Measurement Independence (MI) assumption is violated — not for the nominal settings under the experimenters’ free control, but for the exact settings which were never under their control anyway. None of the grotesque conspiracies that plague conventional superdeterministic explanations of Bell’s Theorem applies. Bell’s Theorem implies RaQM is a holistic theory. As such, implications for models of cosmology are discussed. An experimental test of RaQM, achievable in about 5 years, is described.
In this section we introduce the framework of quantum mechanics as it pertains to the types of systems we will consider for quantum computing. Here we also introduce the notion of a quantum bit or ‘qubit’, which is a fundamental concept for quantum computing. At the beginning of the twentieth century, it was believed by most that the laws of Newton and Maxwell were the correct laws of physics. By the 1930s, however, it had become apparent that these classical theories faced serious problems in trying to account for the observed results of certain experiments. As a result, a new mathematical framework for physics called quantum mechanics was formulated, and new theories of physics called quantum physics were developed in this framework. Quantum physics includes the physical theories of quantum electrodynamics and quantum field theory, but we do not need to know these physical theories in order to learn about quantum information. Quantum information is the result of reformulating information theory in this quantum framework. We saw in Section 1.6 an example of a two-state quantum system: a photon that is constrained to follow one of two distinguishable paths. We identified the two distinguishable paths with the 2-dimensional basis vectors and then noted that a general ‘path state’ of the photon can be described by a complex vector with |α0|2 +|α1|2 = 1. This simple example captures the essence of the first postulate, which tells us how physical states are represented in quantum mechanics. Depending on the degree of freedom (i.e. the type of state) of the system being considered, H may be infinite-dimensional. For example, if the state refers to the position of a particle that is free to occupy any point in some region of space, the associated Hilbert space is usually taken to be a continuous (and thus infinite-dimensional) space. It is worth noting that in practice, with finite resources, we cannot distinguish a continuous state space from one with a discrete state space having a sufficiently small minimum spacing between adjacent locations. For describing realistic models of quantum computation, we will typically only be interested in degrees of freedom for which the state is described by a vector in a finite-dimensional (complex) Hilbert space.
In computational physics it is standard to approximate continuum systems with discretised representations. Here we consider a specific discretisation of the continuum complex Hilbert space of quantum mechanics - a discretisation where squared amplitudes and complex phases are rational numbers. The fineness of this discretisation is determined by a finite (prime-number) parameter p. As p→∞, unlike standard discretised representations in computational physics, this model does not tend smoothly to the continuum limit. Instead, the state space of quantum mechanics is a singular limit of the discretised model at p=∞. Using number theoretic properties of trigonometric functions, it is shown that for large enough values of p, discretised Hilbert space accurately describes ensemble representations of quantum systems within an inherently superdeterministic framework, one where the Statistical Independence assumption in Bell's theorem is formally violated. In this sense, the discretised model can explain the violation of Bell inequalities without appealing to nonlocality or indefinite reality. It is shown that this discretised framework is not fine tuned (and hence not conspiratorial) with respect to its natural state-space p-adic metric. As described by Michael Berry, old theories of physics are typically the singular limits of new theories as a parameter of the new theory is set equal to zero or infinity. Using this, we can answer the challenge posed by Scott Aaronson, critic of superderminism: to explain when a great theory in physics (here quantum mechanics) has ever been `grudgingly accommodated' rather than `gloriously explained' by its candidate successor theory (here a superdeterministic theory of quantum physics based on discretised Hilbert space).
Quantum mechanics has proven its position as the primary theory for accurately describing microscopic domains. Numerous fields in physics utilize quantum mechanics to great effects, with one prominent application being quantum computing. Quantum computing extends the field of quantum mechanics to information theory, striving to perform computational tasks utilizing quantum phenomena with notably greater efficiency compared to classical alternatives. In this thesis, I will go through the basics required in the field of quantum computing. To understand quantum computing demands adapting a new type of matrix mechanical view. This involves considering Hilbert spaces, which are linear vector space having a well defined inner product. Hilbert spaces contain state vectors describing quantum states, as well as operators for altering and measuring these states. The dynamics of quantum systems are governed by three quantum postulates. These specify Hilbert spaces and state vectors as the fundamental components of quantum systems, Hermitian operators as providing the physical manifestation of these systems, and finally, the Schrödinger's equation to describe the time evolution of such systems. These notions are required in producing quantum computing. Quantum computing uses qubits as the computational basis, analogous to classical bits but with the added capability of quantum superposition. Qubits are represented as two-state vectors, and can be physically realized with any quantum-behaving binary-valued system, like the electron spins. Qubits can be combined into higher dimensional states with the use of tensor products, causing the system's Hilbert space to expand as 2^n with n being the number of qubits, allowing for exponential computational speedup. Computational logic can be constructed by acting on the qubits using unitary operators, known as quantum gates. The combinations of qubits and quantum gates can be visualized as quantum circuits, depicted using specialized circuit diagram notations. An essential part of quantum computing, and the phenomena enabling exponential computational speedup, is quantum entanglement. Entanglement arises in interacting qubits, intertwining them so that the individual states become correlated. Entanglement can be characterized by being unable to reduce a combined state into its pure constituents. The amount of entanglement in a system can be measured using von Neumann entropy, analogous to Shannon entropy in classical information theory. Entanglement serves various purposes in quantum computing and is a defining feature distinguishing it from the classical domain. In this thesis, the entanglement properties of a periodic four-qubit circuit with alternating quantum gates were simulated. The simulation was performed computationally, and measured entanglement entropy as a function of the amount of circuit periods. The results demonstrated different characteristics of entanglement depending on the parameters used for the quantum gates, with the entanglement either being periodic, non-occurring or chaotic in nature.
A conceptual difficulty in the foundations of quantum mechanics is the quantum measurement problem (QMP), essentially concerned with the apparent non-unitarity of the measurement process and the classicality of macroscopic systems. In an information theoretic approach proposed by us earlier (Quantum Information Processing 2, 153, 2003), which we clarify and elaborate here, QMP is understood to signal a fundamental finite resolution of quantum states, or, equivalently, a discreteness of Hilbert space. This was motivated by the notion that physical reality is a manifestation of information stored and discrete computations performed at a deeper, sub-physical layer. This model entails that states of sufficiently complex, entangled systems will be unresolvable, or, {\em computationally unstable}. Wavefunction collapse is postulated as an error preventive response to such computational instability. In effect, sufficiently complex systems turn classical because of the finiteness of the computational resources available to the physical universe. We show that this model forms a reasonable complement to decoherence for resolving QMP, both in respect of the problem of definite outcomes and of the preferred basis problem. The model suggests that QMP, as a window on the sub-physical universe, serves as a witness to Wheeler's koan ``it from bit''. Some implications for quantum computation and quantum gravity are examined.