Rational quantum mechanics: Testing quantum theory with quantum computers
Proceedings of the National Academy of Sciences · 24.03.2026 · 123 (12)
DOI: 10.1073/pnas.2523350123 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the National Academy of Sciences, online erschienen am 16.03.2026. Verfasst von Tim Palmer. Beteiligte Einrichtung: Department of Physics, University of Oxford, Oxford OX1 3PU, United Kingdom. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
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 N max : For any N > N max qubit state, there is insufficient information in the N qubits (linearly growing in N ) to allocate even one bit to each of all 2 N + 1 − 2 continuum degrees of freedom (exponentially growing in N ) associated with quantum mechanics/theory (QM, where N max = ∞ ). 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 G = 0 . On this basis, it is estimated that N max 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 N -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.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Department of Physics, University of Oxford, Oxford OX1 3PU, United Kingdom.
ORCID-Profile: Tim Palmer
Zitieren
APA
Palmer, T. (2026). Rational quantum mechanics: Testing quantum theory with quantum computers. Proceedings of the National Academy of Sciences, 123(12). https://doi.org/10.1073/pnas.2523350123
Vancouver
Palmer T. Rational quantum mechanics: Testing quantum theory with quantum computers. Proceedings of the National Academy of Sciences. 2026;123(12). doi:10.1073/pnas.2523350123
BibTeX
@article{Palmer2026,
author = {Palmer, Tim},
title = {Rational quantum mechanics: Testing quantum theory with quantum computers},
journal = {Proceedings of the National Academy of Sciences},
year = {2026},
volume = {123},
number = {12},
doi = {10.1073/pnas.2523350123}
}
EUVIMED