Quantum information and reversible computation: SMM/DTT and Everett many-worlds interpretation

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

Everett’s relative-state formulation applies unitary quantum evolution to the apparatus and observer as well as to the measured system. Correlated components of their joint state encode different relative outcomes. Modern decoherence-based accounts use effectively stable environmental records to explain why these components behave as autonomous branches for practical observation. Their language of worlds is an interpretation of this branching structure, not an additional term in the Schrödinger equation.

Its main contrast with a completion account is the status of the alternatives. Everett keeps all components in the universal state; a DTT model must specify whether completion releases a relative record, selects one outcome by an additional rule, or discards information through an explicitly open channel. Each option has a different relationship to unitarity. Mere sequential generation of a superposition does not make it Everettian, and describing observed definiteness does not by itself disprove relative-state quantum mechanics. Both accounts still need justified probability assignments for repeated records. ^[2]

04The decisive comparison

Everett describes a quantum computer and its final readout within one unitary state, with outcome records correlated with computational components. Reversible gates do not need a special collapse step, while practical discarding is represented by inaccessible correlations with other degrees of freedom. DTT can implement the same account if outer completion is access to a stable relative output rather than fundamental deletion of the remaining amplitudes.

The no-cloning restriction is common to both descriptions. Keeping all branches in a universal state does not provide an agent with freely accessible copies of an unknown qubit. Likewise, a Single Monad retaining inner coherence cannot release unlimited independent duplicates without changing the quantum theory. The interesting comparison concerns the organization of inaccessible information. Everett leaves it in the global state; DTT seeks a source mechanism that may explain its retention, protection and publication. A concrete architecture could predict resource tradeoffs between record redundancy and coherent reversibility. Those tradeoffs would be a useful result even if they preserved unitary quantum mechanics, provided they followed from physical source constraints rather than a freely chosen computational design. ^{[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.