A Test of Whether One Math Rule Links Smooth Fields to Quantum Results

In the paper's words

A family of contemporary foundational programs asserts that reality is a continuum of local deterministic fields and that quantum mechanics is the unique calculus bridging this continuum to discrete measurement outcomes. If that uniqueness claim were correct, research seeking additional physical principles behind quantum statistics could stop; if it is wrong, the specific failure localizes where extra structure must be added. This paper formalizes the proposed bridge as a thresholded amplification map M:RtoO and tests uniqueness by construction.

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

Numbers it reports

1. Within the axiom class of continuous local deterministic fields plus irreversible discrete readout, we exhibit two distinct calculi — a linear threshold and a quadratic (intensity-like) threshold — that yield detection probabilities $0.1587$ and $0.3174$ respectively for a unit-variance Gaussian field at threshold $\Theta=1$, a structural factor of exactly $2$ that persists at other thresholds.

   from Abstract

2. A slope-matched noisy threshold detector with $\sigma_n=\sqrt{2/\pi}\approx0.7978846$ reproduces the two-outcome Born rule only approximately, with maximum deviation $0.1050$ and root-mean-square deviation $0.0602$ over a five-point angular grid.

   from Abstract

3. We prove the CHSH bound $|S|\le2$ for every deterministic local thresholded readout, against the quantum prediction $|S|=2\sqrt{2}\approx2.8284$.

   from Abstract

4. The Post-Quantum Synthesis program states a no-collapse theorem in which a threshold crossing within the detector produces the discrete outcome during continuous Hamiltonian evolution [10], and it derives joint measurement statistics for entangled systems as $P(o_1,o_2)=\sum_i |c_i|^2 P_1(o_1|\phi_1^i)P_2(o_2|\phi_2^i)$ [10].

   from 1. Introduction

5. Our contributions are: An explicit two-calculus counterexample: linear and quadratic thresholded amplifiers, both satisfying the axioms exactly, yield detection probabilities $P_1^{(L)}=0.1587$ and $P_1^{(Q)}=0.3174$ for a unit-variance Gaussian field at $\Theta=1$, a structural factor of exactly $2$ that persists at $\Theta=4$ (Sections 4.1–4.3, 4.8).

   from 1. Introduction

6. A quantitative bound on Born-rule reproduction: the best locally slope-matched noisy threshold detector, with $\sigma_n=\sqrt{2/\pi}\approx0.7978846$, deviates from the Born rule by up to $0.1050$ (at $\alpha=0$, where certainty is demanded) with root-mean-square deviation $0.0602$ over a five-point angular grid, and the deviation at certainty points is structural for any finite noise (Section 4.4).

   from 1. Introduction

How it is done

1. We prove the CHSH bound $|S|\le2$ for every deterministic local thresholded readout, against the quantum prediction $|S|=2\sqrt{2}\approx2.8284$.

   from Abstract

2. Today there is no shared, explicit procedure for testing that uniqueness claim: the assertions circulate as foundational theses, and acceptance or rejection rests on taste rather than on a computed counterexample or a computed agreement check.

   from 1. Introduction

3. The axiomatic approach of [3] characterizes all the possible statistical properties of apparatuses measuring an observable with nondegenerate spectrum allowed in standard quantum mechanics, treating an apparatus as inputting a state $\rho$ and outputting a classical outcome ${\bf x}$ together with the conditional state $\rho_{\{{\bf x}=x\}}$, with the statistical property consisting of the output distribution and the state reduction.

   from 2. Background and Related Work

4. These axioms are a faithful formalization of the programs under test: the amplification-and-threshold-crossing stage of the no-collapse theorem in [10] is A3, and the locality of physical influence in its no-spooky-action theorem [10] is A2.

   from 3.1 Axioms

What would falsify it

1. We prove the CHSH bound $|S|\le2$ for every deterministic local thresholded readout, against the quantum prediction $|S|=2\sqrt{2}\approx2.8284$.

   from Abstract

2. Today there is no shared, explicit procedure for testing that uniqueness claim: the assertions circulate as foundational theses, and acceptance or rejection rests on taste rather than on a computed counterexample or a computed agreement check.

   from 1. Introduction

3. If uniqueness fails, the failure localizes exactly which additional structure a classical ontology must supply — and programs that omit it are making a falsifiable error, not a philosophical choice.

   from 1. Introduction

Where the claim stops

1. The analysis is deliberately minimal, and each minimality choice is a limitation.

   from 6. Discussion

2. Third, the statistical power figure $n\approx130$ is a projection resting on Gaussian approximations to Bernoulli frequencies and on the assumed ensemble; it carries no experimental validation.

   from 6. Discussion

3. The non-uniqueness result would fail if the programs' wording were read as fixing the amplifier class more narrowly than A1–A3 do — for example, if "nonlinear amplification" were stipulated to exclude the affine member $\mathcal{C}_L$, or if a physical principle (such as energy-like detection) were independently postulated to select $\mathcal{C}_Q$.

   from 6. Discussion

Where to read

1. Abstract201 words · 1 min
2. 1. Introduction685 words · 3 min
3. 2. Background and Related Work1,405 words · 6 min
4. 3. Methods562 words · 2 min
5. 4. Analysis903 words · 4 min
6. 5. Results183 words · 1 min
7. 6. Discussion428 words · 2 min
8. 7. Practical Implications and Engineering Pathways504 words · 2 min
9. 8. Conclusion153 words · 1 min
10. Provenance and AI Involvement225 words · 1 min