Quantum information and reversible computation: SMM/DTT and Bohmian 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. ^{[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

Bohmian mechanics supplements a wavefunction with an actual configuration, ordinarily particle positions. The Schrödinger equation guides the wavefunction, and a velocity law guides the configuration. When configurations follow the quantum-equilibrium distribution, the theory reproduces the usual quantum statistics in its applicable domain. Apparatus outcomes are ultimately configurations too, so measurement is treated as a physical interaction rather than a separate primitive collapse.

This is an instructive comparison for SMM because it provides an explicit account of definite observed events while retaining an additional, nonclassical level of description. But a Bohmian particle follows a trajectory in a configuration space whose geometry is supplied. The Single Monad proposal instead seeks to explain how spatial and particle records arise at all. The challenge is therefore not to rename a guiding wave as inner time. It is to show what variables replace the configuration, how records obey the equilibrium statistics, and whether the replacement adds an observable consequence. ^[2]

04The decisive comparison

Bohmian mechanics allows quantum computers to reproduce ordinary quantum predictions in equilibrium, even though the actual configuration follows one trajectory. The computational advantage is not explained by treating that trajectory as an ordinary classical bit string; the guiding wave retains the relevant high-dimensional coherent structure. DTT faces an analogous requirement when describing one source executing inner work: one active source does not make the necessary phase resource classical.

The no-cloning argument still constrains the observable operations of an equilibrium Bohmian implementation and any DTT implementation matching quantum mechanics. Access to hidden variables cannot simply be assumed to give an experimenter extra copying power. A source theory would need an explicit account of what is observable and why other details remain inaccessible. Its potential advance lies in deriving the computational state space and physical geometry from the same generative mechanism. Bohmian dynamics supplies those structures as part of its formulation. The comparison thus distinguishes explanatory depth from computational analogy: a unique realized history can coexist with quantum information processing, but the mechanism preserving and reading its nonclassical amplitudes must be specified. ^{[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.