Manuscript Hawk05-C@1 · Hawk05-C.tex · proposition · ba0719f1
Proposition: No reset cost from channel equality
Cutoffs, recurrence, three ledgers, and analogies › Three panels, not three interchangeable numbers · lines 1879–1898 · proof included or linked
A reduced reset channel or partial trace does not determine a unique heat, work, or reusable-memory reset cost.
Proof. SWAP a memory with an independent blank qubit. The memory is reset and its referenced input is transferred to the other qubit. For equal gaps , SWAP conserves their sum and transfers energy , where is the initial excitation probability. The same reset channel is obtained for every positive . Independent fuel, bath, or actuator processes may also change the implementation ledger without changing that channel. The consumed blank and fuel must be restored before a cyclic cost is claimed.