Quantum information and reversible computation: SMM/DTT and objective collapse models

01The question behind this comparison

Quantum information is encoded in states and transformations whose coherence matters to the result. A reversible computation acts bijectively on the relevant state space; a quantum circuit ordinarily uses unitary gates. Irreversible operations such as resetting a register require an environment or another information-bearing resource. A source can carry out a long sequence of reversible inner steps while releasing an effectively irreversible record at its outer interface.

This makes DTT a promising language for separating work, memory and publication. Its distinct ambition is to connect those computational roles to the production of physical structure itself. A simulation of particles on a pre-existing lattice is not yet an explanation of why space exists. The key mathematical question is which architecture and resource restrictions force an observable geometry or clock relation, rather than merely allow an arbitrary controller to implement one. ^{[3] [4]}

02The SMM/DTT starting point

The Single Monad Model begins with one nonspatial generative source. The Duality of Time Theory distinguishes the source’s inner production from the outer order in which completed records become accessible. Its six inner levels are nested functional roles of one process: a higher role organizes lower-level work. The seventh is the completion or observation interface. They are neither six independent clocks nor six additional time coordinates.

This distinction supplies a useful research question: which features of an observed world can follow from the way a source produces, retains and releases information? A concrete answer needs a state space, an autonomous update, retained memory and a rule connecting completion to an accessible measurement. In the constructions discussed here, those mathematical ingredients are stated explicitly. A successful finite example establishes what its specified mechanism can do; further arguments connect it to physical particles, spacetime or universal laws. ^[1]

03How the comparator works

Objective collapse theories modify quantum dynamics so that sufficiently macroscopic alternatives are suppressed by a physical stochastic process. In GRW-type and continuous-spontaneous-localization families, the modification contains a rate and a spatial or mass-related structure. Amplification makes microscopic coherence relatively persistent while reducing macroscopic superpositions. These are dynamical proposals with measurable consequences, rather than interpretations that necessarily preserve every prediction of ordinary unitary quantum theory.

Outer completion in DTT is not automatically an objective collapse. A completion channel may simply expose a decohered record or condition on an ordinary outcome. It becomes a collapse proposal only when the state evolution changes in a specified way, with a probability law, energy accounting and a physical scale. Collapse models consequently provide a demanding comparison: they illustrate how an account of definite records can take quantitative risks. No bound on their parameters directly bounds an unspecified generative process; the two mechanisms must first be translated into comparable observable dynamics. ^[2]

04The decisive comparison

Objective collapse introduces an additional noise mechanism that can limit coherent quantum computation as system size or relevant superposition parameters increase. DTT completion could impose a similar limitation if it irreversibly selects intermediate alternatives. If inner computation is unitary and completion merely exposes an output, ordinary error correction and environmental noise models remain the appropriate baseline instead.

This comparison turns the cosmic-computer metaphor into a quantitative resource question. A proposed completion law must specify whether protected encodings can suppress its errors, whether the noise is correlated across nested stages, and what observable gate or storage fidelity follows. The no-cloning theorem does not prevent error correction, because encoded redundancy protects information without manufacturing independent copies of an unknown state. A DTT model that treats every publication as universal state duplication would fail this distinction. Its strongest potential contribution is a law linking retained memory, completion and unavoidable noise from one source dynamics. Such a law could be constrained by coherent processors or precision experiments, while an unspecified rate or freely chosen register budget remains a model assumption. ^{[2] [3] [4]}

05Worked benchmark

Suppose a unitary device could copy every unknown qubit: U|ψ⟩|0⟩=|ψ⟩|ψ⟩. Apply it to two possible inputs |ψ⟩ and |φ⟩. Unitarity preserves their inner product, so s=⟨ψ|φ⟩ must satisfy s=s². This requires s=0 or s=1. Two distinct nonorthogonal states, such as |0⟩ and |+⟩ with s=1/√2, cannot both be copied perfectly by that device.

The result still permits copying an orthogonal classical record. A controlled-NOT gate sends |0⟩|0⟩ to |0⟩|0⟩ and |1⟩|0⟩ to |1⟩|1⟩. On a superposition it creates entanglement rather than two independent copies. Thus an outer archive may distribute a stable outcome label widely without cloning the full inner quantum state. This simple distinction prevents the cosmic-computer analogy from assuming an impossible universal backup of unknown quantum information. ^{[3] [4]}

06What follows for the source programme

A source-based computational model becomes informative when it includes the cost of protected memory, resetting and local access. Quantum error correction shows that reliable logical information can survive selected errors through redundancy without cloning an unknown state. DTT can investigate whether the same protection rules also select completed records or effective neighborhoods. That is a more concrete route than identifying the cosmos with a computer solely because its history can be represented as a sequence of symbols. ^{[3] [4]}

THE SAME QUESTION, DIFFERENT STARTING POINTS

The comparison at a glance

Continue on SMONAD

• The Cosmic Computer →

  Connects this comparison with the author’s underlying construction.

• A quantum source for generation and completion →

  Connects this comparison with the author’s underlying construction.

• Undoing rejected partial work →

  Connects this comparison with the author’s underlying construction.

• From a continuous pointer to a binary memory →

  Connects this comparison with the author’s underlying construction.

• SMM/DTT research claim map: results, assumptions and open targets →

  Places the comparison alongside the programme’s published results, assumptions and open targets.