Manuscript X-A-ST@1 · X-A-ST.tex · theorem · d9ccbde1
Theorem: Reference-preserving target-adapted transport
Scheduled locality and regular transport › Target-adapted finite route · lines 2147–2177 · proof included or linked
X-A-ST@1#thm:transport
For every initial payload–reference state , after tick the state is
under the fixed register identifications. Thus the complete logical payload channel is exactly the identity, including its arbitrary reference. The report is forwarded without changing its joint law. Arrival is at developed time , or host time . All dependency routes stay in the regular part.
Proof. Initially the assertion is the preparation. At hop , a SWAP moves the entire current payload factor, including its correlations with , into the next independent blank and leaves the previous factor blank. Induction proves the formula. The final statement follows at .
A classical copy preserves diagonal records and their joint correlations; it is not cloning an arbitrary unknown quantum state. The chosen spacings and tick durations make every cross dependency null in the developed chart and therefore causal in the host.
Displayed formulas in this passage
unlabeled · line 2151