Manuscript Hawk05-A@1 · Hawk05-A.tex · section · 449f85bb
Quantum-processor analogy
The corrected four-stage narrative and analogies › Quantum-processor analogy · lines 1769–1788
Load an unknown code into the occupied memory sector of Section sec:schedule. Apply declared transfer unitaries and retain the emitted quantum cells coherently. Early radiation is nearly vacant, and recovery is poor. As the survival probability decreases, the radiation supports better recovery. At complete transfer its quantum state carries the code, including any reference correlations.
Now replace coherent storage by destructive Enter on every emitted cell. The processor returns emission-time and basis-label records. Those records can accurately answer classical questions, but they do not return the unknown quantum code. Example ex:twocells shows explicitly why the classical bit stream does not inherit the quantum entropy fall.
The processor runs no gravitational Hamiltonian. Its access split is an operational declaration, not a metric-defined horizon.