The Physical Impossibility of Quantum Computational Speedup: Two Independent Arguments from Quantum-Geometry Dynamics Quantum computing promises computational advantages that are, in the most celebrated cases, exponential. Shor's algorithm factors integers exponentially faster than the best known classical algorithm; Grover's algorithm searches an unstructured database with a quadratic speedup. These results are mathematically rigorous within their assumed framework. This paper asks not whether the mathematics is correct but whether the physical assumptions underlying it are. I argue that Quantum-Geometry Dynamics (QGD) — an axiomatic framework for physics derived from the discreteness of space and the kinetic nature of matter — establishes two independent foundational preclusions of quantum computational speedup. These are not engineering obstacles or decoherence problems that better technology can overcome. They are consequences of the physical structure of discrete space, and no improvement in qubit isolation, error correction, or fabrication technique can supply a physical resource that does not exist. The first preclusion concerns physical states. In QGD, matter is composed of preons⁺ that propagate through quantum-geometrical space by preonic leaps, each of which is a definite transition from one spatial unit to the next in the direction of the momentum vector. A preon(+) always occupies a definite position. There is no ontological superposition. What quantum mechanics represents as a superposed state is, in QGD, an epistemic description of our ignorance of the system's actual preonic microstate. Since ontological superposition is the physical resource on which quantum parallelism depends, its absence means that no physical system can instantiate the state required for exponential speedup. The second preclusion concerns physical processes. Causal succession in discrete space is categorically and structurally irreversible: every preonic leap has a definite direction, and no physical process can reverse the causal order of preonic states. This is not thermodynamic irreversibility arising from large numbers but a property of every individual preonic transition. Since the quantum circuit model is built on reversible unitary gates, and reversible computation has no physical instantiation in a discrete-space framework, the operational basis of quantum computing is equally precluded. I show how both arguments bite at specific steps in Shor's algorithm and Grover's algorithm. In Shor's algorithm, the first preclusion destroys the state preparation step and the second destroys the quantum Fourier transform. In Grover's algorithm, the first preclusion destroys the uniform superposition and the second destroys the diffusion operator and oracle. Either preclusion alone is sufficient; together they attack quantum speedup at both ends — what goes in and how it is processed. The black hole information paradox, correctly understood within QGD, provides independent confirmation: the paradox dissolves precisely because physical states are always definite and physical evolution is categorically irreversible — the same two features that preclude quantum speedup. The Uniqueness Theorem for QGD further strengthens the claim: if the two-axiom discrete-space structure is the unique viable foundational description of physical reality, these preclusions are not features of one possible framework among many but consequences of the physical structure of the universe. This paper supersedes the earlier paper Quantum Computing Under Quantum-Geometry Dynamics (Zenodo, DOI: 10.5281/zenodo.19522137) and should be read in its place. This paper is part of the Minimal Physically Derivable Theory (MPDT) programme.
The Physical Impossibility of Quantum Computational Speedup: Two Independent Arguments from Quantum-Geometry Dynamics Quantum computing promises computational advantages that are, in the most celebrated cases, exponential. Shor's algorithm factors integers exponentially faster than the best known classical algorithm; Grover's algorithm searches an unstructured database with a quadratic speedup. These results are mathematically rigorous within their assumed framework. This paper asks not whether the mathematics is correct but whether the physical assumptions underlying it are. I argue that Quantum-Geometry Dynamics (QGD) — an axiomatic framework for physics derived from the discreteness of space and the kinetic nature of matter — establishes two independent foundational preclusions of quantum computational speedup. These are not engineering obstacles or decoherence problems that better technology can overcome. They are consequences of the physical structure of discrete space, and no improvement in qubit isolation, error correction, or fabrication technique can supply a physical resource that does not exist. The first preclusion concerns physical states. In QGD, matter is composed of preons⁺ that propagate through quantum-geometrical space by preonic leaps, each of which is a definite transition from one spatial unit to the next in the direction of the momentum vector. A preon(+) always occupies a definite position. There is no ontological superposition. What quantum mechanics represents as a superposed state is, in QGD, an epistemic description of our ignorance of the system's actual preonic microstate. Since ontological superposition is the physical resource on which quantum parallelism depends, its absence means that no physical system can instantiate the state required for exponential speedup. The second preclusion concerns physical processes. Causal succession in discrete space is categorically and structurally irreversible: every preonic leap has a definite direction, and no physical process can reverse the causal order of preonic states. This is not thermodynamic irreversibility arising from large numbers but a property of every individual preonic transition. Since the quantum circuit model is built on reversible unitary gates, and reversible computation has no physical instantiation in a discrete-space framework, the operational basis of quantum computing is equally precluded. I show how both arguments bite at specific steps in Shor's algorithm and Grover's algorithm. In Shor's algorithm, the first preclusion destroys the state preparation step and the second destroys the quantum Fourier transform. In Grover's algorithm, the first preclusion destroys the uniform superposition and the second destroys the diffusion operator and oracle. Either preclusion alone is sufficient; together they attack quantum speedup at both ends — what goes in and how it is processed. The black hole information paradox, correctly understood within QGD, provides independent confirmation: the paradox dissolves precisely because physical states are always definite and physical evolution is categorically irreversible — the same two features that preclude quantum speedup. The Uniqueness Theorem for QGD further strengthens the claim: if the two-axiom discrete-space structure is the unique viable foundational description of physical reality, these preclusions are not features of one possible framework among many but consequences of the physical structure of the universe. This paper supersedes the earlier paper Quantum Computing Under Quantum-Geometry Dynamics (Zenodo, DOI: 10.5281/zenodo.19522137) and should be read in its place. This paper is part of the Minimal Physically Derivable Theory (MPDT) programme.
Quantum computing's most consequential claim — that quantum computers provide exponential computational speedup over classical computation — rests on a specific physical assumption: that superposition is ontologically real, that a qubit genuinely and simultaneously occupies multiple states, and that quantum algorithms exploit this simultaneity as a physical resource. A quantum computer with n qubits is claimed to process 2ⁿ computational paths in parallel by virtue of this simultaneous occupation. This paper argues that all three foundational assumptions are precluded by Quantum-Geometry Dynamics (QGD), the physical theory derived from the Minimal Physically Derivable Theories (MPDT) framework established by the Uniqueness Theorem. In QGD, physical reality is strictly and absolutely deterministic. Every fundamental constituent — every preon(+) — has a definite position and definite intrinsic momentum at every moment. There are no indeterminate states, no superpositions, and no wave function collapse at the fundamental level. What quantum mechanics describes as superposition is not a physical state of simultaneous occupation but an epistemic description of ignorance of the deterministic microstate of a preonic configuration. The wave function is a probabilistic description of deterministic preonic dynamics — a calculational tool that correctly predicts statistical outcomes — not a description of a physical state in which a system genuinely occupies multiple configurations simultaneously. This distinction has a direct and specific consequence for quantum computing. Quantum computing devices are genuine physical systems that exploit real quantum mechanical phenomena — phenomena that QGD derives from the deterministic dynamics of preons(+) and preons(−) in the finite discrete preon(−) lattice. The MPDT framework does not forbid the construction or operation of quantum computing devices. What QGD precludes is the ontological foundation on which the exponential speedup argument rests. A quantum computing device is a deterministic preonic configuration occupying one microstate at each moment. The 2ⁿ simultaneous amplitude states of the quantum formalism are elements of a probabilistic description of that microstate — not physical states simultaneously instantiated in the device. Quantum parallelism is a feature of the formalism, not of the underlying physics. The paper develops this argument systematically across eight sections. Section 2 establishes QGD's account of quantum phenomena as emergent from deterministic preonic dynamics, including the derivation of wave-like interference patterns and Bell correlations without superposition. Section 3 examines precisely what superposition is and is not in QGD, culminating in the formal statement that a qubit in the state α|0⟩ + β|1⟩ is not a system simultaneously occupying both states but a deterministic preonic configuration whose microstate determines measurement outcomes but is not individually accessible at the observational level. Section 4 identifies the exact point at which the exponential speedup argument fails: the physical resource it invokes — simultaneous occupation of 2ⁿ states — does not exist in the physical universe that QGD describes. Sections 5 examines three specific quantum algorithms: Shor's factoring algorithm, whose polynomial-time complexity is demonstrated within the quantum formalism but whose underlying preonic complexity remains an open question; Grover's search algorithm, whose quadratic speedup rests on the same ontological assumption; and quantum simulation, which survives the critique more robustly because it does not require exponential parallelism as a resource. Section 6 addresses decoherence, reinterpreting it not as an engineering challenge to be solved by better isolation but as a fundamental feature of reality — the inevitable influence of the instantaneous gravitational field of the entire preon(−) lattice on every qubit configuration, which cannot be shielded against in principle. Sections 7 and 8 develop the implications for the quantum computing programme and conclude. The argument connects directly to the P vs NP analysis in the companion Physicality of Logic paper. Shor's algorithm is the canonical example of a quantum algorithm claimed to solve a classically hard problem — integer factoring — in polynomial time, with significant implications for the security of RSA encryption. If QGD is correct and the exponential speedup argument fails, the classical hardness of factoring is preserved and the cryptographic implications attributed to quantum computing do not follow. The paper does not claim that quantum computing devices are useless — it claims that the specific resource driving the most dramatic projections for quantum computing does not physically exist, and that whatever computational advantages quantum devices possess must be explained within the deterministic preonic framework rather than by appeal to quantum parallelism. The paper is intended for physicists working on quantum computing and quantum foundations, philosophers of physics, and computer scientists working on computational complexity. It is submitted to Foundations of Physics. It is a companion to the author's papers on the Uniqueness Theorem and the Physicality of Logic, and to the book Quantum-Geometry Dynamics: An Axiomatic Approach to Physics.
For quantum computation, we investigate the conjecture that the superposition of macroscopically distinct states is necessary for a large quantum speedup. Although this conjecture was supported for a circuit-based quantum computer performing Shor's factoring algorithm [A. Ukena and A. Shimizu, Phys. Rev. A69 (2004) 022301], it needs to be generalized for it to be applicable to a large class of algorithms and/or other models such as measurement-based quantum computers. To treat such general cases, we first generalize the indices for the superposition of macroscopically distinct states. We then generalize the conjecture, using the generalized indices, in such a way that it is unambiguously applicable to general models if a quantum algorithm achieves exponential speedup. On the basis of this generalized conjecture, we further extend the conjecture to Grover's quantum search algorithm, whose speedup is large but quadratic. It is shown that this extended conjecture is also correct. Since Grover's algorithm is a representative algorithm for unstructured problems, the present result further supports the conjecture.
This chapter highlights quantum algorithms as a gate-based computational framework that exploits superposition, entanglement, and phase-coherent interference to realize demonstrable complexity reductions on selected problems. It begins by formally distinguishing quantum algorithms from classical deterministic and randomized computation through reversible unitary evolution, oracle-based problem access, and the measurement constraint that collapses quantum state information, thereby motivating amplitude-engineering strategies that amplify correct outcomes while suppressing incorrect ones. This chapter then surveys quantum speedup as a nuanced concept, clarifying that advantage is problem-dependent, often derived under idealized fault-tolerant assumptions, and practically bounded in noisy intermediate-scale quantum devices by decoherence, gate infidelity, circuit-depth overhead, and benchmarking/verification limitations. Two canonical algorithmic families are developed in depth: Shor’s algorithm, framed as reduction of integer factorization to order/period finding via coherent modular exponentiation and the quantum Fourier transform with explicit resource and cryptographic implications; and Grover’s algorithm, formulated as optimal unstructured search through oracle phase marking, diffusion (inversion about the mean), and its generalization to amplitude amplification as a reusable primitive. Building on these exemplars, this chapter distills design principles for constructing effective quantum algorithms, including superposition management, oracle synthesis and state manipulation, and systematic minimization of gate count, depth, and expensive non-Clifford resources under hardware constraints. It concludes by mapping these foundations to active research directions—quantum approximation methods such as quantum approximate optimization algorithm, hybrid quantum–classical variational workflows, and quantum machine learning—highlighting how practical progress depends on hardware-aware compilation, resource optimization, and interference-driven algorithm design.
Grover’s algorithm is one of the primary algorithms offered as evidence that quantum computers can provide an advantage over classical computers. It involves an “oracle” (external quantum subroutine), which must be specified for a given application and whose internal structure is not part of the formal scaling of the quadratic quantum speedup guaranteed by the algorithm. Grover’s algorithm also requires exponentially many calls to the quantum oracle (approximately 2 n calls where n is the number of qubits) to succeed, raising the question of its implementation on both noisy and error-corrected quantum computers. In this work, we construct a quantum-inspired algorithm executable on a classical computer that performs Grover’s task in a linear number of calls to (simulations of) the oracle—an exponentially smaller number than Grover’s algorithm—and demonstrate this algorithm explicitly for Boolean satisfiability problems. The complexity of our algorithm depends on the cost to simulate the oracle once, which may or may not be exponential, depending on its internal structure. Indeed, Grover’s algorithm does not have an quantum speedup as soon as one is given access to the “source code” of the oracle, which may reveal an internal structure of the problem. Our findings illustrate this point explicitly, as our algorithm exploits the structure of the quantum circuit used to program the quantum computer to speed up the search. There are still problems where Grover’s algorithm would provide an asymptotic speedup if it could be run accurately for large enough sizes. Our quantum-inspired algorithm provides lower bounds, in terms of the quantum-circuit complexity, for the quantum hardware to beat classical approaches for these problems. These estimates, combined with the unfavorable scaling of the success probability of Grover’s algorithm, which in the presence of noise decays as the exponential of the exponential of the number of qubits, makes a practical speedup unrealistic even under extremely optimistic assumptions of the evolution of both hardware quality and availability. Published by the American Physical Society 2024
Quantum computing represents a revolutionary leap in computational power, leveraging the principles of quantum mechanics to process information in fundamentally new ways. Unlike classical computers, which use bits to represent data as 0s or 1s, quantum computers use quantum bits or qubits, enabling the phenomena of superposition and entanglement to perform complex calculations more efficiently (Nielsen & Chuang, 2010). This article explores the basic principles of quantum computing, the different models and algorithms that have been developed, and the current state of quantum hardware. The power of quantum computing lies in its ability to solve certain types of problems exponentially faster than classical computers. For instance, Shor's algorithm can factorize large integers in polynomial time, posing a significant threat to classical encryption methods (Shor, 1997). Similarly, Grover's algorithm provides a quadratic speedup for unstructured search problems, showcasing the potential for dramatic improvements in database search capabilities (Grover, 1996). These algorithms exemplify how quantum computing can revolutionize fields that rely on complex computations. Quantum hardware, however, is still in its nascent stage, with significant challenges to be overcome. Current quantum computers, such as those developed by IBM and Google, have demonstrated quantum supremacy but are limited by issues of qubit coherence and error rates (Arute et al., 2019). Quantum error correction and the development of more stable qubit technologies are critical areas of ongoing research (Preskill, 2018). Despite these challenges, recent advancements in quantum hardware and algorithms continue to drive the field forward, promising transformative impacts on industries such as cryptography, drug discovery, and artificial intelligence. As quantum computing continues to advance, it holds the promise of solving problems that are currently intractable for classical computers, paving the way for unprecedented technological and scientific advancements (Shor, 1997; Grover, 1996). This article provides a comprehensive overview of the current landscape of quantum computing, discussing its foundational principles, key algorithms, hardware challenges, and potential applications. By understanding these aspects, we can better appreciate the profound implications of quantum computing for the future of technology and science.
Bell-type experiments are the most precisely tested quantum mechanical predictions and the most frequently cited evidence for non-locality in physics. This paper derives the quantum mechanical correlation function E(a,b) = −cos(θ_ab) for spin-½ particle pairs in the singlet state from the first principles of Quantum-Geometry Dynamics (QGD), without invoking non-locality, without treating the Born rule as a primitive, and without positing any causal layer above the preonic level. The derivation proceeds in two stages. The first establishes four symmetry constraints that any preonic account of spin-½ must satisfy: rotational isotropy of the preonic structure of space, the zero-total-momentum condition defining the singlet state in preonic terms, the binary outcome constraint, and conservation of intrinsic momentum between creation and measurement. These constraints are necessary conditions derived from the three QGD axioms and are shown to be sufficient to determine the correlation function uniquely given a specified measurement weighting function P(+1|θ). The second stage demonstrates that the p-gravity binding structure of a spin-½ preonic aggregate naturally produces an internal angular distribution of preon(+) momentum directions — proposed as f(α) ∝ (1 + cosα) — that leads to the measurement weighting function P(+1|θ) = cos²(θ/2). Given this weighting, and conditional on the companion calculation establishing that the (1 + cosα) p-gravity distribution supplies the factor-of-3 required to pass from the naive spherical integral result −(1/3)cosθ_{ab} to the full cosine correlation, the four symmetry constraints yield E(a,b) = −cos(θ_ab) and the Tsirelson bound of 2√2 follows as a geometric consequence. The full derivation of P(+1|θ) = cos²(θ/2) from p-gravity equilibrium requires the particle formation account of the QGD book as input and is identified as the subject of a companion calculation. Three extensions beyond the idealised case are developed. First, what is measured in Bell experiments are objects in the sense of the Physicality of Scales: structures whose response to any force is entirely describable by total mass and resultant momentum vector. The Definition of Object justifies treating the resultant P⃗₁ as the relevant measurement quantity and explains why the internal preon(+) degrees of freedom are not independently accessible to the detector. Second, the p-gravity coupling geometry is determined by the particle's mass-velocity regime: p-gravity couples at very low angles over long, potentially galactic-scale distances, and the coupling profile for each particle type determines its internal preon(+) distribution and hence the form of P(+1|θ). The companion calculation must derive this profile from the book's particle formation account. Third, no Bell experiment is perfectly isolated from the n-gravity field of distant matter distributions. This field introduces a small systematic perturbation to the particles' resultant momenta during transit, producing a deviation from the ideal cosine correlation: E(a,b) = −cos(θ_ab) + ε, where ε depends on transit geometry, local preonic field density, and the cosmological expansion state. This constitutes a testable signature prediction distinguishing QGD from standard quantum mechanics, in principle observable at sufficiently long baselines or in cosmological Bell experiments. Bell's theorem is satisfied in QGD for a precise reason: the preonic configurations of the two particles are correlated from creation through the shared causal history of the source interaction, violating the statistical independence assumption of Bell's theorem — but without any non-local influence at the moment of measurement. The account is fully local and fully deterministic. The paper compares this account with Bohmian mechanics (which achieves local determinism through a non-local pilot wave that QGD does not require), retrocausal models (which violate the temporal arrow that QGD preserves), and the many-worlds interpretation (which posits an ontological surplus that QGD avoids by treating superposition as epistemic). The refutation of top-down causation established in the Axiomatic Localism paper closes one further interpretational option: the possibility that macro-level causal autonomy could provide a non-preonic mechanism for producing the correlations. No such mechanism is admissible in QGD. The measurement setting influences the outcome only through the local preonic field interaction of the detector with the particle, and the experimenter's deliberative state is itself a preonic configuration whose causal effects are mediated entirely by local preonic interactions. The Bell correlations arise entirely from the preonic initial conditions established at the source, preserved by the deterministic causal succession, and revealed by local measurements. The standard Bell loopholes are examined in the preonic framework. The locality loophole is irrelevant by construction. The detection loophole does not arise at the fundamental preonic level. The freedom loophole is addressed by the Axiomatic Localism refutation: measurement settings are preonic configurations causally connected to the source only through the ordinary causal history of the universe, with no special non-local channel.