RealityModels

Theory: many worlds, tree and convergences

The many-worlds simulation compares three hypotheses: the "Tree", "Classical convergence" and "Quantum convergence" regimes. This document describes them with the notation of js/model.js and, for each one, separates published theory from the simulator's working hypotheses. References in square brackets point to the bibliography at the end. Usage and parameters: many-worlds-simulation-guide.en.md; Italian version: many-worlds-convergence-theory.it.md.

1. The starting point: quantum measurement

A quantum state evolves deterministically and linearly (Schrödinger equation). When an observable with N possible outcomes is measured, the Born rule gives outcome c the probability |a_c|², where a_c is the amplitude of component c [Born 1926]. In the standard formulation measurement is a second, discontinuous kind of evolution: the state "collapses" onto the observed component [von Neumann 1932]. The three simulated hypotheses give different answers to the question "what happens to the other N−1 components?".

The simulator keeps things minimal. At every step t it repeats the same measurement with N equiprobable outcomes (c = 0, …, N−1), and a world carries only its record k = Σ c, the sum of the outcomes. The graph shows the record centred, x = 2k − (N−1)·t, so the distribution starts at x = 0 and stays symmetric.

2. "Tree" regime: the many-worlds interpretation

2.1 The theory

Everett [1957] proposed to drop collapse. The universal wave function never reduces, and after a measurement the observer is also in superposition, with one copy per outcome. Each copy has a memory ("relative state") consistent with its own outcome and cannot notice the others. The name "many worlds" and the spread of the idea are due to DeWitt [1970; DeWitt and Graham 1973].

Branches become independent through decoherence. Interaction with the environment (photons, gas, apparatus) ties each outcome to nearly orthogonal environment states, and within extremely short times the interference terms between branches become unobservable [Zeh 1970; Zurek 1991, 2003; Joos et al. 2003]. In the modern version of the interpretation the "worlds" are emergent structures in the wave function, identified by decoherence, and need not be postulated [Wallace 2012; Saunders et al. 2010; Vaidman 2021].

2.2 The model in the simulator

The "Tree" regime only counts. Every measurement multiplies the worlds by N, so after t measurements there are

treeWorlds = N^t

distinct worlds, each with weight (squared modulus of the amplitude) N^(−t) and identified by its outcome sequence (the base-N digits of the node index). Node colour and the histogram at the bottom show how the worlds are distributed over the record k: the fraction with record k is the multinomial coefficient divided by N^t, i.e. the classical probability of the next regime. Hovering a world highlights those with the same record, which stay distinct in the tree even though their "content" is identical.

The limit of 4096 nodes (T ≤ 12 for N = 2) is purely graphical.

3. "Classical convergence" regime: worlds with the same record are the same world

3.1 The hypothesis

The simulator explores the hypothesis that the structure is not a tree. Two branches that reach the same state (here: same record k at the same step t) are a single world. The graph of worlds becomes a lattice with

distinct = (N−1)·t + 1

nodes at step t instead of N^t: linear growth, not exponential.

The idea is not part of the standard many-worlds interpretation, but it touches the literature at several points:

3.2 The model in the simulator

If the probabilities of converging branches add without interference, the record performs a classical random walk [Feller 1968, ch. III]: each step adds a c uniform in {0, …, N−1}. The number of outcome sequences reaching node k (paths) follows the recursion

paths_{t+1}(k + c) += paths_t(k)        for c = 0, …, N−1

(for N = 2 this is Pascal's triangle and the lattice is the Galton board), and

pClassical(k, t) = paths_t(k) / N^t
flowClassical[c] = pClassical / N

c has mean (N−1)/2 and variance (N²−1)/12, so x = 2k − (N−1)·t has mean 0 and standard deviation

sigmaClassical = sqrt( t · (N²−1) / 3 )

that is, σ = √t for N = 2. The distribution widens as the square root of time (diffusion) and by the central limit theorem tends to a Gaussian. The effective number of worlds 1/Σp² (effectiveClassical) also grows as √t.

4. "Quantum convergence" regime: the amplitudes of converging branches add

4.1 The theory

If two branches really merge into the same state, quantum mechanics does not add their probabilities. The amplitudes add, and the probability is the squared modulus of the sum. This is the superposition principle in the form of Feynman's sum over paths [Feynman 1948; Feynman and Hibbs 1965]: the amplitude of reaching a point is the sum of the amplitudes of all histories that reach it, and different histories interfere. Decoherence removes the interference and brings back the classical regime; without decoherence, branches can cancel or reinforce each other.

The many-worlds literature has explicitly discussed bringing "already separated" branches of a measurement back into interference. Deutsch [1985] proposed a thought experiment: an observer (a quantum computer) performs a measurement, records the outcome and is then made to interfere with itself, which shows an observable difference between collapse and no collapse. Hanson [2003] instead studied what happens to the Born rule if small-amplitude worlds are "mangled" by interference with larger worlds. In both cases branch convergence is a theoretical possibility and does not describe the ordinary dynamics of macroscopic objects.

4.2 The model in the simulator: coined quantum walk

The usual way to propagate an amplitude on a lattice unitarily is the coined quantum walk [Aharonov, Davidovich and Zagury 1993; Meyer 1996; Ambainis et al. 2001; Nayak and Vishwanath 2000; Kempe 2003; Venegas-Andraca 2012]. Adding the amplitudes of converging branches directly is not enough, because the resulting map does not preserve the norm. So each node gets an internal degree of freedom with N components, the "coin", which here coincides with the outcome of the last measurement.

The state at step t is the set of complex amplitudes ψ_t(k, c). One step works like this:

  1. coin: at every node the unitary matrix U is applied, here the discrete Fourier transform (function dftCoin)

    U[c][d] = exp(2πi · c · d / N) / sqrt(N)

    which for N = 2 is the Hadamard matrix; the DFT coin is the usual choice for coins with N > 2 faces [Mackay et al. 2002; Tregenna et al. 2003];

  2. shift: component c moves to node k + c:
    ψ_{t+1}(k + c, c) = Σ_d U[c][d] · ψ_t(k, d)

The initial state is ψ_0(0, 0) = 1. The readings are

pQuantum(k, t)  = Σ_c |ψ_t(k, c)|²
flowQuantum[c]  = |(U ψ_t(k, ·))_c|²       (probability leaving along outcome c)

Branches converging on a node arrive in different coin components and meet in the coin of the next step, where the amplitudes add and interfere. The sum of the probabilities stays 1 at every step. In the graph, nodes with pQuantum < 10⁻⁹ are empty and edges with flowQuantum < 10⁻⁹ dashed: these are the branches cancelled by interference (suppressedNodes, suppressedEdges).

For N = 2 the model is the Hadamard walk, whose exact values are known: at step 3, on the records x = −3, −1, 1, 3, the probabilities are 1/8, 5/8, 1/8, 1/8 [Kempe 2003, §3]. The distribution is asymmetric because the initial coin state |0⟩ is not symmetric, a known property of the walk. The Hadamard walk with a localised initial state also coincides with the "Feynman checkerboard", the discretisation of the Dirac equation in 1+1 dimensions [Feynman and Hibbs 1965, problem 2-6; Meyer 1996].

4.3 The observable difference: ballistic spreading

The main result of quantum walk theory is that the standard deviation grows linearly with t (ballistic propagation), while in the classical walk it grows as √t [Nayak and Vishwanath 2000; Ambainis et al. 2001]. Konno's limit theorem [2002] gives the shape of the distribution: two peaks at the front, non-Gaussian. In the simulator sigmaQuantum grows as ≈ 0.46·t for N = 2, and effectiveQuantum (effective number of worlds) grows linearly instead of as √t. Values computed by buildLattice and statistics:

NtDtree worldsdistinct nodesclassical effective no.quantum effective no.classical σquantum σ
24001.1·10¹²4111.2511.666.3218.40
2400.31.1·10¹²4111.2515.486.3211.53
24011.1·10¹²4111.256.756.325.80
34001.2·10¹⁹8118.3534.5810.3328.35
43001.2·10¹⁸9121.7734.8612.2529.01

(seed 1; for N = 2 and D = 0 the quantum effective number is close to the classical one because the Hadamard distribution puts much of the probability on the two peaks).

5. Phase disorder: from quantum to classical

The parameter D ∈ [0, 1] multiplies the amplitudes of every node, before the coin, by a random phase e^{iφ} with |φ| ≤ π·D, drawn at every step from a seeded generator (seededRandom). The evolution stays unitary, but converging branches arrive with random relative phases. This is a minimal model of decoherence: the environment "marks" each branch with a phase the other branch does not know.

The quantum walk literature distinguishes two cases:

The simulator uses dynamic disorder. For D → 1 sigmaQuantum again grows as √t (≈ 0.93·√t for N = 2, versus √t in the classical regime), the empty nodes and dashed edges change with the seed and the histogram approaches the classical outline. D therefore interpolates between regime 4 (D = 0) and a "noisy" version of regime 3. It is the same transition by which, in the many-worlds interpretation, decoherence makes branches effectively independent [Zurek 2003].

6. What the model does not say

References

Many-worlds interpretation and decoherence

Consistent histories and coarse graining

Measurement, Born rule, sum over paths

Classical random walk

Quantum walks

Disorder, decoherence and localisation in quantum walks