Manuscript Hawk05-C@1 · Hawk05-C.tex · proposition · ba0719f1
Proposition: A fixed autonomous finite proxy is recurrent
Cutoffs, recurrence, three ledgers, and analogies › The cutoff is not an endpoint certificate · lines 1833–1856 · proof included or linked
Hawk05-C@1#prop:recurrence
For a fixed finite-dimensional Hamiltonian , fixed preparation , and fixed access partition, the complete channel of returns arbitrarily close to its initial channel at arbitrarily late times. If the initial accessible channel is replacement, then
Proof. There are finitely many eigenvalue phases. Simultaneous recurrence on their compact torus gives arbitrarily late times when is arbitrarily close to identity in operator norm. For isometries, , by referenced pure-state comparison and convexity. Partial trace and Lemma lem:basic give recurrence of the accessible channel and its recovery error. The initial error and universal upper cap both equal .
Displayed formulas in this passage
unlabeled · line 1840