QNFO Papers
PapersAsk the corpusIdeasArchiveAboutWork with me

Quick read · plain language

How Quantum Rules May Come From Counting Choices

A plain-language version of “Finite-Distinction Quantum Mechanics: Unitary Evolution and Superposition as the Large-Distinction Limit of Stochastic Thermodynamics”

6 min readNo jargon, no mathematicsPhysics

The short version

This paper says that ordinary quantum mechanics might be a simple pattern. The pattern appears when you look at very large numbers of yes-or-no choices. The author builds this idea in three steps. The author lists exact tests that could prove it wrong.

Why the idea starts here

The author begins with a known fact about information. A single point on a smooth line carries endless yes-or-no bits. These bits hide in its endless decimal places. But any real piece of the world can only hold a finite amount of information. So a smooth line cannot be the true bottom layer of reality. The author adopts a refined version of this rule. Three things are usually mixed together when people talk about smooth lines. First, between any two points you can always find another point. This is needed for motion and cause and effect. So it stays real. Second, the endless uncountable crowd of points. This has no physical meaning. You could never check it. Third, a number system where closeness is measured by shared prime factors. This works like organizing items by which shelves they share. It carries real quantum structure. But it works differently from ordinary geometry. What finiteness rules out is only the endless uncheckable precision. The useful structure stays.

How a world of finite choices is shaped

If the world is made of finite yes-or-no distinctions, what shape does its space of states take? The author says it is combinatorial. At any fixed grain size, two states are either different or the same. There is no smooth almost-the-same. This makes states group into a tree of nested boxes. The natural distance between two states is the height of the smallest box that holds both. This kind of distance obeys a strong rule. The direct path is never longer than a detour through a third point. The author notes two cautions. Real indistinguishability can chain across many steps. So the paper adopts a cleaned-up version by choice. Also, this tree-like distance is not the only possible distance for quantum states. The author checked thousands of clock systems. Another kind of distance fails the strong rule about a third of the time. The claim is careful. Tree-like distance holds for partition-type telling-apart. It does not hold for all quantum distances.

Quantum rules as flow on choices

The author reads quantum mechanics as a kind of thermodynamics. This is the study of heat and motion. But it sits on a space of finite alternatives. Take a large set of distinct choices with chances for each. There is a measure of spread called entropy. The change of this spread gives a geometry. Motion follows the slope of this spread. One part can run backward. One part runs only forward. The backward part is like the clean reversible motion of quantum mechanics. The forward part is like the loss in real thermodynamics. The author asks whether this structure copies what we see. This happens when the set of choices grows very large.

What must still be shown

The author states the main guess plainly. The reversible part of the flow becomes the clean reversible motion of quantum mechanics. This happens when the number of choices grows huge. Lost energy per step shrinks to nothing. But three problems are named openly. First, where do numbers with both real and imaginary parts come from? The flow starts with real numbers. The author notes that smooth reversible change forces such numbers. The author checks that the standard length and purely wiggling spectrum hold in tests. But the full step to this number structure remains a target. Second, there is a known argument. It says the quantum state cannot be just information about unseen states. The author must say which assumption this model breaks. Or the author must accept that the state is real. Third, the whole program could sneak the smooth continuum back in. This could happen through the limit process. The author answers this cleanly. The number of choices is always a finite whole number inside every model. The limit is taken over many models. It is not taken inside any one. The smooth description is only our map. It is never the territory.

The tests that could kill the idea

The author writes down five exact ways to falsify the claims. No code needs to run first. An observable needing an exact unending decimal at fixed grain size would break the starting premise. A reliable triple of states breaking the strong triangle rule would break the geometry claim. Entropy loss not shrinking to zero would break the clean reversible guess. Reversible motion not becoming clean enough would also break it. Maximum-spread weights not matching the standard quantum chances would break the probability guess. And no clock made of finite choices converging to ordinary smooth quantum motion would break the time guess.

What the computer checks showed

Every numbered claim was checked in code before being stated. Seven checks were run with fixed random seeds. Anyone can rerun them. All passed. The spread geometry matched the expected shape exactly. The tree-like distance showed zero violations. This was among over two hundred thousand triples. Ordinary line distance showed many violations. Entropy loss per step shrank with exponent near minus one. The reversible part became exactly spread-conserving in the large limit. The flow settled to the maximum-spread state within a tiny error. The finite clock converged to ordinary motion. Error shrank fast. The reversible engine kept a certain size fixed. Another size drifted. Its spectrum was purely wiggling. The author records that some acceptance bounds were tightened during work. This kept the claims falsifiable. Fixes to the checking process were checked again. One model assumption is noted as open. The rate of loss being set to one over the number of choices is chosen. It is not derived from a heat bath.

What this does not show

The paper does not claim that quantum mechanics definitely comes from finite choices. The emergence of clean reversible motion, superposition, standard quantum chances, and relational time remain guesses. They have named obstacles. The number structure with both real and imaginary parts is not fully derived. The problem of whether the state is just information about unseen states is not resolved. The rate structure is assumed. It is not explained. The reality claim earns its place only through finite predictions. These predictions differ from the smooth continuum reading. The author states that a negative result from the finite-number predictions would be as worth publishing as a positive one.

Words used here

p-adic
a kind of number system where closeness is measured by shared prime factors rather than ordinary distance, like organizing items by which shelves they share in a warehouse rather than by meters apart.
ultrametric
a way to measure distance where the direct path is never longer than any detour, like family trees where two cousins are as far apart as the height of their last shared ancestor.
entropy
a measure of spread or uncertainty, here used as the count of yes-or-no distinctions in a situation.
unitary evolution
the clean reversible motion in quantum mechanics where no information is lost, like a perfect clock running backward and forward equally well.
Born frequencies
the standard quantum chances for measurement outcomes, like the long-run fractions you would see if you repeated the same test many times.
Schrödinger motion
the smooth time evolution of quantum states, like a wave flowing forward in a rule-governed way.
hidden states
unseen properties that might exist beneath quantum measurements, like cards face-down that could explain the odds we see.
purely imaginary spectrum
a set of rates that are all wiggling frequencies with no decay or growth, like a pure tone with no fade.
generator
the engine that drives change forward in time, like the rule that tells a clock hand where to move next.
complex numbers
numbers with both real and imaginary parts, like points on a flat plane that can rotate and stretch together.

Learn more in plain language

This plain-language version was written by an AI model from the text of the paper and checked against plain-language rules: everyday words, no mathematics, no unexplained names. It leaves details out and can still be wrong; the paper is the source of record. To report a problem, open the paper, select the passage and choose Report.

For specialists: the technical digest, quoted from the paper

In the paper's words

A finite-entropy world is a finite-distinction world: uncountable precision is unphysical, while computable depth and p-adic valuation remain physically real. The state-space geometry of finite distinctions is combinatorial and ultrametric; quantum mechanics read as thermodynamics is a stochastic thermodynamics of finite alternatives, with unitary evolution and superposition conjectured as the large-distinction limit of an entropy-Hessian gradient flow (supported at finite N within the per-distinction model; 6/6 computational checks, seed 20260821). The Hilbert-space formulation over the complex numbers is that limit — a map, not the territory.

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

Numbers it reports

  1. Our computational study of conditional-state distances in Page–Wootters clocks [11] examined more than eight thousand Wheeler–DeWitt systems and found a 29–35% violation rate of the Parisi ultrametricity condition for generic clock-rest interactions; exact ultrametricity holds when the interaction Hamiltonian is diagonal in the clock eigenbasis.

    from 3. The Geometry of Finite Distinctions

  2. Quantum mechanics, read as thermodynamics, is a stochastic thermodynamics of finite alternatives [12, 13], and unitary evolution together with superposition are the large-distinction limit of an entropy-Hessian gradient flow.

    from 1. Introduction

  3. That converts the energy-efficiency question of quantum computing from an engineering estimate into a structural quantity, and it gives the joules-per-solution benchmark a substrate (Section 10).

    from 1. Introduction

  4. Imported machinery includes maximum-entropy reasoning [14], the identification of the entropy Hessian with the Fisher metric [15], stochastic thermodynamics of discrete states [12, 16, 17], the Page–Wootters formalism [18, 19], ultrametricity of hierarchical order [10, 20], and the semiorder structure of indistinguishability [21].

    from 1. Introduction

  5. L1 imported named inputs Maximum-entropy principle [14]; entropy Hessian = Fisher metric [15]; stochastic thermodynamics of discrete states [12, 16, 17]; Page–Wootters conditioning [18, 19]; ultrametricity of hierarchical order [10, 20]; semiorder structure of indistinguishability [21]; the adelic scalar family [1, 2].

    from 2. The Continuum as Infinite Information

  6. Let there be N distinct alternatives, with probabilities $p = (p_{1},..., p_{N})$, entropy $S(p) = -\Sigma p_{i} \ln p_{i}$, and entropy Hessian $\nabla ^{2}S$, which is the Fisher metric of the statistical manifold [15].

    from 4. Quantum Mechanics as Stochastic Thermodynamics of Finite Alternatives

How it is done

  1. The measurement event in the finite picture is a relaxation event of the flow [35], and experimental programs for reality tests [30, 31, 32] bound the space of options.

    from 5. Unitarity from the Entropy Hessian

  2. The acceptance criteria in the table were fixed before the final runs; two were sharpened during development (the power-law exponent from $\lt 0$ to $\lt -0.5$, and a final-deviation bound for V5) so that the vanishing claims remain falsifiable; the executed criteria are the ones in the table.

    from 9. Computational Verification and Reproducibility

  3. Entropy production along a stochastic trajectory and an integral fluctuation theorem.

    from References

What would falsify it

  1. An observable whose value requires an exact real at fixed finite resolution — no finite-description equivalent.

    from 8. Falsification Conditions

  2. The algebra of the first two parts is exact and graded; the emergence conjecture is stated with its named obstacles — the appearance of complex structure, the psi-epistemic no-go theorems, and the observational underdetermination of the ontology — and with a concrete computational program that can falsify it at finite N.

    from Abstract

  3. The premises end where the identification of the state space begins: the distinction, the counting of distinctions, and finite resolution are unanalyzable primitives here; everything above them is derived, proposed, or conjectured, and the falsification conditions are written.

    from Abstract

Where the claim stops

  1. The continuum is an infinite-information object: a single real coordinate specifies infinitely many yes/no distinctions, and a finite-entropy world cannot contain such coordinates.

    from Abstract

  2. The seed of the argument is an information-theoretic observation that has been made, in different forms, across the foundations literature and in our own corpus: a real coordinate is a map that requires infinitely many distinctions per point, and a finite-entropy world cannot carry such objects [3, 4, 5, 6, 7, 8].

    from 1. Introduction

  3. The emergence conjecture is the load-bearing part: it lives or dies on finite-N predictions that the continuum reading does not make, and those predictions are computable.

    from 1. Introduction

Where to read

  1. Abstract227 words · 1 min
  2. 1. Introduction538 words · 2 min
  3. 2. The Continuum as Infinite Information442 words · 2 min
  4. 3. The Geometry of Finite Distinctions245 words · 1 min
  5. 4. Quantum Mechanics as Stochastic Thermodynamics of Finite Alternatives197 words · 1 min
  6. 5. Unitarity from the Entropy Hessian377 words · 2 min
  7. 6. Born Weights as Max-Entropy Weights94 words · 1 min
  8. 7. Relational Time from a Distinction Clock186 words · 1 min
  9. 8. Falsification Conditions117 words · 1 min
  10. 9. Computational Verification and Reproducibility702 words · 3 min
  11. 10. What a Practitioner Can Do with This141 words · 1 min
  12. 11. Conclusion95 words · 1 min

Read from the paper itself: 13 sections, 4,025 words. Nothing in this digest is written by a model; a line that is not a sentence of the paper is not shown. Have a specific question? Ask this paper.

The full text · Ask the whole corpus