Manuscript Hawk05-A@1 · Hawk05-A.tex · proposition · 449f85bb
Proposition: Finite autonomous recurrence
Finite recurrence and the three ledgers › A fixed finite autonomous proxy is recurrent · lines 1585–1610 · proof included or linked
Hawk05-A@1#prop:recurrence
Let be a fixed finite-dimensional Hamiltonian and let describe a fixed prepared interface. There are arbitrarily late times with complete-channel distance arbitrarily close to that at . If the initial accessible channel is replacement, then
Proof. There are finitely many eigenvalues. Simultaneous recurrence of their phases gives arbitrarily late times for which is arbitrarily close to the identity in operator norm. For isometries,
Indeed, apply the pure-state trace-distance bound to every referenced input and then use convexity. Partial trace gives accessible-channel recurrence. Lemma lem:stability gives recovery-error recurrence. The initial error and the universal upper bound are both .
Displayed formulas in this passage
unlabeled · line 1592
unlabeled · line 1602