Emulation Capacity between Idempotent Channels

Abstract:We study the optimal rates of emulation (also called interconversion) between quantum channels, in three regimes: when the encoder and the decoder are unassisted, when they share classical randomness, and when they share an unlimited amount of entanglement. When the source and the target channels are idempotent, we completely characterise these three regimes, in terms of the shape vectors of the two channels, which describe the structure of their ranges. In the unassisted and shared randomness regimes, we give a single-letter expression for the emulation capacity, show that it coincides with the zero-error emulation capacity, and prove a finite-blocklength converse which implies a strong converse. In these two regimes, shared randomness does not increase the emulation capacity, and the emulation of idempotent channels is not reversible. Moreover, we provide an efficient algorithm to approximate this capacity to arbitrary precision. When an unlimited amount of shared entanglement is allowed, we determine the minimal emulation error exactly at every finite blocklength. It is governed by a single quantity, the $\ell_2$-norm of the shape vector, so that the emulation becomes reversible, and exact emulation is achievable with finitely many maximally entangled states. Altogether, these results draw a comprehensive picture of the task of emulating idempotent channels with each other.

60 pages. Extended version of an article presented at IEEE ISIT 2026. This version adds the shared randomness and entanglement-assisted regimes, a polynomial algorithm to compute, up to additive error, the emulation capacity in the shared-randomness and unassisted regimes, as well as a strong converse matching the unassisted capacity for all p in [1,+infinity] (not only p in {1,+infinity})

Quantum Physics (quant-ph); Operator Algebras (math.OA)

arXiv:2511.16299 [quant-ph]

(or arXiv:2511.16299v3 [quant-ph] for this version)