Feynman-Shor Quantum Bifurcation

In the paper's words

This analysis reconstructs the divergent phylogenetic lineages of quantum computing, termed Feynman-Shor bifurcation. The field has split into two distinct ontologies: path A (mimetic simulation), rooted in Feynman’s original 1982 vision of structural isomorphism, which is inherently robust to noise and viable on current hardware; and path B (algorithmic calculation), defined by Shor’s 1994 factoring algorithm, which remains practically intractable due to the fragility of phase estimation without fault tolerance. While this bifurcation defines the current era of hardware development, the two paths are projected to converge at the ultimate physical limits of scale and fidelity, resolving into a single, universal paradigm of quantum computation.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. For example, in the 2024 model, where path B fails completely, path A retains a utility score of 0.50, indicating a 50% effective fidelity—often more than sufficient for extracting key physical insights like the location of a phase transition.

   from 1.5 Physics of Resilience

2. As shown in the 2026 model, a 1000-qubit machine with a respectable error rate of $5 \times 10^{-4}$ still fails completely, with the model indicating a need for 200,000 qubits to achieve the necessary error correction.

   from 1.6 Physics of Fragility

3. The context for this model is the era of processors with over 100 qubits and gate fidelities approaching the crucial $10^{-3}$ level, a significant improvement over the 2018 baseline.

   from 4.3 Empirical Wall

4. The hardware, despite its impressive scale of 10,000 qubits, still falls short by a factor of twenty.

   from 4.5 Resource Gap

5. The “Physics Limit” model from the numerical analysis embodies this limit, pairing a modest, near-term processor of 1,000 qubits with a miraculous, physically impossible gate error rate of $10^{-9}$.

   from 4.9 Physics Limit

6. A classical simulation step based on this would require an event to happen, for instance, “-10% of the time,” a concept that is physically meaningless and computationally un-implementable in any direct probabilistic sense.

   from 2.4 Negative Probability

How it is done

1. The field has split into two distinct ontologies: path A (mimetic simulation), rooted in Feynman’s original 1982 vision of structural isomorphism, which is inherently robust to noise and viable on current hardware; and path B (algorithmic calculation), defined by Shor’s 1994 factoring algorithm, which remains practically intractable due to the fragility of phase estimation without fault tolerance.

   from Physical

2. However, the paradigm shifted dramatically in 1994 with Peter Shor’s discovery of an algorithm that could solve an abstract mathematical problem—integer factorization—with exponential speedup, recasting the quantum computer as a universal mathematical engine with profound cryptographic implications.

   from 1.1 Central Dichotomy

3. The most compelling evidence for the necessity of this approach lies in the sheer scale of the quantum state space.

   from 1.2 Structural Isomorphism

4. This stands in stark philosophical opposition to the isomorphic approach, which embraces the physics of the hardware as the computational medium itself.

   from 1.3 Algorithmic Abstraction

What would falsify it

1. As Feynman originally argued, the resources required to store the full probability amplitudes for a system of just a few hundred spin-1/2 particles would exceed the number of atoms in the observable universe.

   from 1.2 Structural Isomorphism

2. The Noisy Intermediate-Scale Quantum (NISQ) era represents the modern crucible where the theoretical ambitions of the Feynman and Shor lineages are tested against physical reality, with the hardware itself acting as the ultimate arbiter.

   from 1.4 NISQ Era Constraints

3. If a simulation using floating-point numbers can predict the weather or the folding of a protein to within an acceptable margin of error, then it has succeeded in its scientific purpose, and the question of its mathematical exactness is a philosophical one with no practical bearing.

   from 2.1 Discretization Hypothesis

Where the claim stops

1. However, the paradigm shifted dramatically in 1994 with Peter Shor’s discovery of an algorithm that could solve an abstract mathematical problem—integer factorization—with exponential speedup, recasting the quantum computer as a universal mathematical engine with profound cryptographic implications.

   from 1.1 Central Dichotomy

2. The same hardware, when tasked with a Shor-style calculation for a trivial 16-bit integer, fails completely; the analysis indicates a requirement for a code distance of 25 to suppress errors, necessitating approximately 600,000 physical qubits—a shortfall of more than three orders of magnitude.

   from 1.1 Central Dichotomy

3. The simulator does not calculate the evolution of the target system’s state vector in a vast numerical space; instead, it physically embodies that evolution by mapping the target’s Hilbert space directly onto its own.

   from 1.2 Structural Isomorphism

Where to read

1. 1.0 Introduction5,199 words · 23 min
2. 2.0 Foundational Schism4,856 words · 21 min
3. 3.0 Technical Divergence4,200 words · 18 min
4. 4.0 Analysis:7,472 words · 32 min
5. Appendix C: Glossary of Terms |458 words · 2 min