Bath dimension and initial entropy for closed repeated use of a quantum channel

arXiv:2609.18267 · quant-ph · Submitted 2026-09-16 · Read on arXiv

quant-ph

Submitted: 2026-09-16

Updated: 2026-09-16

Comments: 29 pages; includes two appendices and reproducibility documentation. Code and verification materials: https://github.com/Apsiape/closed-quantum-process-memory-paper

License: http://creativecommons.org/licenses/by/4.0/

The gist: We characterize the bath resources needed to supply repeated uses of a fixed finite-dimensional quantum channel in a closed device.

Terminology

Abstract

We characterize the bath resources needed to supply repeated uses of a fixed finite-dimensional quantum channel in a closed device. For each horizon T, one bath, one initial state and one repeated unitary are fixed before the user. Each output is returned before the next input arrives; no reset, discard, fresh ancilla or uncounted controller is available. Approximation error must vanish against arbitrary adaptive users with quantum memory and references. Writing r= 2(R T)/T for the bath dimension rate and s= S(ω T)/T for the actual initial entropy rate, we prove that the achievable region is exactly s 0, r+s h and r-s κ. Here h is maximum entropy exchange and κ is a smoothed independent-reference extension cost, with the zero-error limit taken before the supremum over full-rank inputs. Its exact fixed-input form is an affine transform of the zero-leakage quantum privacy funnel. The minimum dimension rate is (h+κ)/2. The proof combines entropy converses, a bath-dimension-independent support repair, and a closed adaptive implementation of encoder-only fully quantum Slepian--Wolf recycling. All seeds, clocks, workspace and retained residues are counted. Worked examples include dephasing, pure replacement and a qubit channel with 0<κ<h. No computability of κ or efficient circuit synthesis is claimed.

Sources

Related papers