Quantum information and reversible computation: SMM/DTT and standard Hilbert-space quantum mechanics

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. ^{[2] [3]}

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

Operational quantum mechanics represents a preparation by a positive density operator of unit trace. A measurement outcome corresponds to an effect, and an instrument specifies both its probability and the conditional state left behind. Closed evolution is unitary; an open system can evolve by a completely positive, trace-preserving map. These ingredients are sufficient to calculate laboratory statistics without deciding whether the wavefunction describes an ontic object, a relation or an agent’s expectations.

The instrument language is especially close to DTT’s distinction between production and accessible records. An unobserved interaction and a registered outcome are mathematically different objects. Yet an ordinary instrument does not itself contain a hidden generative time, nor does a sequence of instruments derive the space in which laboratories operate. It provides a precise interface against which a proposed inner process can be tested: if the process reproduces exactly the same instruments, the difference is explanatory or structural unless another accessible measurement distinguishes it. ^[2]

04The decisive comparison

Standard quantum computation already separates reversible gates from measurements, discarding and reset. DTT’s inner production and outer completion can provide a physical architecture for that separation, especially if one autonomous source both processes a state and certifies when a reliable output is ready. The agreement is exact when the architecture implements the same circuit and record statistics.

The no-cloning example identifies a constraint that any such source must respect if it retains ordinary quantum kinematics. A completed classical label may be copied, but an unknown coherent state cannot be duplicated as an independent backup. This has direct implications for the proposed cosmic archive: it cannot indiscriminately preserve every quantum state while also releasing an identical usable copy. A model can instead distribute correlations, use error-correcting encodings or retain only an observable quotient. Its distinctive contribution would be to derive which of these resources is available and how that choice shapes geometry or clock behaviour. A programmable simulation of the universe demonstrates expressive capacity; an explanatory source theory imposes restrictions on the simulations that can physically occur. ^{[2] [3]}

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. ^{[2] [3]}

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. ^{[2] [3]}

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.