Rational quantum mechanics: Testing quantum theory with quantum computers.

Abstract

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.