Locality, Memory, and Calibration Trade-offs in Exact Quantum Reset

We study exact reference-preserving reset as an information-transfer task in a finite tagged-source model. A declared local-qutrit realization admits a depth-one parallel source-to-bank unitary:65 pair-local exchanges reset the complete source carrier on a pure-zero bank while transferringeach source basis label to an orthogonal bank record and each source matrix unit coherently to thecorresponding bank matrix unit. We propagate this identity through an inherited work-replacementinterface and a complete-joint error contract, deriving a channel-wise calibration theorem thatcharges coefficient, timing, axis, cross-talk, leakage and bank-dynamics errors against one globalallowance. For admitted complete inputs whose nominal post-replacement source-bank comparisonis supported on the vacuum-plus-one-excitation sector with a zero bank, a per-port peak 218J givesa sufficient reset bound below 10−4 at source length 65 and preserves the existing reader allocation,while requiring 65 local ports, an aggregate peak 65·218J, and stringent joint calibration. Conversely,an ε-reset of a d-dimensional input with a pure blank environment requires environment dimensionat least ⌈d(1−ε)⌉. At ε= 10−4 the 131-dimensional tagged source still requires 131 environmentdimensions. Combining this rank bound with circuit causal cones yields memory-dependent depthlower bounds; combining environment distinguishability with a supplied positive-constant Lieb–Robinson profile yields a conditional reset-time lower bound that is nontrivial only when the profileseparation term is positive. The results quantify a memory–locality–calibration trade-off in onedeclared architecture. They do not establish optimal hardware, practical supplier generation, anautonomous repeated-use service, or a universal tight reset speed.