Imagining the processes on a quantum processor

Imagine a processor on which a finite code has already been prepared. Calling that code a star does not assert that every mode of a physical field has been encoded. A specified unitary now transfers the logical state to an internal register. The outside observer is denied that register. The machine has not created a geometric horizon: it has executed a relocation and changed what the observer can address.

The internal controller next exposes an outgoing register through a specified transfer isometry. This is an explicit interface change, not unexplained leakage through a fixed inaccessible cut. The observer can retain that register coherently or apply Enter. In the latter case, the quantum name is consumed and a bit string is returned. The readout can condition the unobserved state, although its average cannot signal to an untouched register.

A finite sequence of these transfers can make the named source core smaller. The complete inaccessible accounting need not become smaller with it: uncollected outputs and the apparatus used for destructive readout still belong somewhere in a complete dilation. An external control program may attach a temperature-like label or an increasing readout rate. Those labels do not establish heat, mass loss, or a gravitational equation.

Finally, suppose the controller is given permission to read the remaining finite residual. It performs Enter and discards the resulting record. The residual name disappears from the returned program interface. That is the exact content of readout-and-drop. The operation does not improve the channel already delivered to the observer, and it cannot erase earlier records stored elsewhere.

The program counter then reaches the end. Under the imaginative overlay, the sequence resembles collapse, outgoing radiation, shrinkage, and a terminal burst. Mathematically, it is a schedule of isometries and instruments. If every output name is discarded, the final observable channel is constant. If earlier records remain, they may still carry classical input dependence. In a complete isometric description, the omitted degrees of freedom have not been proved annihilated.

Most importantly, the location of recoverable information must be established, not narrated. For the explicit hidden-code map, the residual alone initially recovers. For a general isometry, recovery may require the joint output. For a record-only interface, unknown quantum coherence and reference entanglement are not returned. These are the precise operational facts that make the analogy useful without turning it into an identification.