The Valuation Reading of the Qubit Delusion: Is the Adelic Kernel Load-Bearing?

In the paper's words

The Qubit Delusion (https://papers.qnfo.org/papers/paper-the-qubit-delusion/) argues that the qubit-gate-circuit model of quantum computation imports a particle ontology inconsistent with quantum field theory, and that the field's failure to deliver commercially viable hardware after $35 billion of investment is an epistemic crisis, not merely an engineering delay. The Adelic Core Research Program (ACRP) has developed a valuation-theoretic framework — Ostrowski's theorem, p-adic valuations, Bruhat-Tits trees, adeles — as a candidate mathematical substrate for quantum computation. The K3 audit (ACRP-01, https://papers.qnfo.org/papers) found that the Qubit Delusion makes NO explicit use of this kernel.

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

Numbers it reports

1. The Qubit Delusion cites the error-correction overhead wall as empirical evidence for its thesis: surface codes require thousands of physical qubits to encode a single logical qubit, fault-tolerant machines are projected for the 2030s, and the field has absorbed $ 35 billion with zero commercially viable machines.

   from 4.1 The Qubit Delusion's Claim

2. Strength: [WEAK] — anchored to the ACRP-08 forecast's own calibration, which registers ultrametric QEC threshold-comparability as an unbuilt construction with probability 0.12–0.25 by 2036 [5].

   from 7 Calibration Register

3. Risk: "The bound was always implicit in stabilizer theory; the valuation-theoretic framing merely made it visible." [CHECK: 2030-12] If the bridge becomes load-bearing, it will be via a threshold.

   from 7 Calibration Register

How it is done

1. The Adelic Core Research Program (ACRP) has developed a valuation-theoretic framework — Ostrowski's theorem, p-adic valuations, Bruhat-Tits trees, adeles — as a candidate mathematical substrate for quantum computation.

   from Abstract

2. Its central claim is that non-Archimedean mathematics — p-adic valuations $v_p$, Bruhat-Tits trees, Ostrowski's theorem, and the adele ring — provides the correct state-space geometry for fundamental physics and quantum computation [2].

   from 1 Introduction

3. The kernel's contribution to the overhead wall is a possibility (a tree-based code with surface-code-comparable thresholds), not a bound (a proof that Archimedean codes must fail).

   from 4.3 Why It Is Not Load-Bearing

4. "Beyond the Qubit" [3] argues that computation IS a physical process and the substrate IS the algorithm — pointing toward thermodynamic, neuromorphic, and optical architectures where physics does the computing directly.

   from 5.1 The Claim

What would falsify it

1. Strength: [WEAK] — this is a conditional prediction: if a load-bearing junction emerges, it will be this one.

   from 7 Calibration Register

2. The ACRP program's value is as a constructive alternative: it proposes a specific mathematical substrate and registers falsifiable predictions (ACRP-08's nine calibration entries [5]) that can be evaluated on their own terms.

   from 8 Practical Applications

Where the claim stops

1. At every candidate junction, the valuation kernel is aesthetic, not load-bearing: the particle-ontology critique does not require tree geometry, the error-correction overhead wall is a fact about stabilizer codes rather than about Archimedean geometry, and the substrate-is-algorithm thesis is compatible with any substrate hypothesis.

   from 9 Conclusion

2. As a signal: the Qubit Delusion's critique does not need the kernel — it stands or falls on its own terms, and the kernel's absence is evidence that the two programs are orthogonal.

   from 2 The K3 Audit Finding and the Kernel Membership Framework

3. The candidate load-bearing claim would be: the particle ontology of the qubit-gate-circuit model fails because it uses Archimedean (real) state-space geometry, and the correct geometry is the ultrametric tree.

   from 3.2 The Kernel's Candidate Contribution

Where to read

1. Abstract193 words · 1 min
2. 1 Introduction245 words · 1 min
3. 2 The K3 Audit Finding and the Kernel Membership Framework175 words · 1 min
4. 3 Junction 1: The Particle-Ontology Critique321 words · 1 min
5. 4 Junction 2: The Error-Correction Overhead Wall309 words · 1 min
6. 5 Junction 3: The Substrate-Is-Algorithm Thesis197 words · 1 min
7. 6 The Honest Verdict129 words · 1 min
8. 7 Calibration Register333 words · 1 min
9. 8 Practical Applications136 words · 1 min
10. 9 Conclusion178 words · 1 min
11. Declarations183 words · 1 min