arXiv:2609.40054
Transmitting algebras through quantum channels
Robert Salzmann, Satvik Singh
Abstract
We develop a theory of exact transmission of finite-dimensional $C^*$-algebras through quantum channels. These algebras describe hybrid classical-quantum information, allowing the dimension of the quantum system to depend on the classical message. Allowing arbitrary encodings and decodings yields a transmission set of algebra types, ordered by embedding, that unifies zero-error information theory with operator-algebraic error correction. We ask if this set admits a dominating algebra into which every transmittable algebra embeds. Our central finding is that domination can fail even in small dimensions. In its absence, several incomparable maximal algebras can describe different optimal uses of the same channel, forcing the user to select one depending on the operational task and the type of information to be preserved. We introduce hybrid capacities that reconstruct the only possible dominating algebra type and present a complete finite characterization of domination using minimal forbidden algebra types. We identify dominating algebras for channels whose operator systems are graph-isomorphic to $*$-algebras, including highly divisible channels, and for channels with zero one-shot zero-error quantum capacity. Under tensor products, we prove that joint coding can produce new algebra types, giving an algebraic analogue of superadditivity from Shannon theory. Domination can fail for the joint use of two channels, even when both channels separately admit dominating algebras. Finally, we construct a channel whose $n$-fold tensor powers have doubly exponentially many maximal algebra types, attaining the largest possible growth scaling for finite-dimensional channels. Consequently, new transmittable algebra types appear at arbitrarily large block-lengths for this channel, so its full transmission structure cannot be generated from any finite collection of bounded-block-length codes.
AI Summary
The paper asks which hybrid classical–quantum information types can be transmitted exactly through a quantum channel when arbitrary encoders and decoders are allowed. Information types are finite-dimensional algebras $\mathcal A=\bigoplus_k M_{d_k}$, ordered by faithful embedding. Their transmission set refines scalar zero-error capacities and distinguishes maximal types from a dominating type containing every transmittable algebra. Transmittability is characterized equivalently by exact simulation of the conditional expectation onto $\mathcal A$, and by mutually output-distinguishable quantum codes of dimensions $d_k$ satisfying Knill–Laflamme conditions. Explicit channels with input/output dimensions $(4,3)$ and $(3,4)$ have precisely two maximal types, $M_2$ and $\mathbb C^3$, but no dominating algebra; these dimension pairs are minimal. Hybrid capacities counting simultaneously transmissible equal-sized quantum blocks reconstruct the only possible dominating type. A finite criterion additionally excludes minimal forbidden embedding types. When quantum blocks have dimension at most three, transmittability of the reconstructed candidate suffices. Channels whose confusability operator systems are graph-equivalent to algebras admit dominating types determined by commutants. Tensor products can introduce types unavailable through separate coding and destroy domination even when both factors possess it. An explicit fixed channel has doubly exponentially many maximal types at block length $n$, with $w_n\gtrsim2^{2^n}$; universally, $w_n\leq2^{d^n}-1$ for input dimension $d$. Since finite bounded-block generation would imply polynomial width, this rules it out for that channel. The framework concerns finite-dimensional, exact, unassisted transmission. Its finite feasibility criteria do not provide efficient code-finding algorithms.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 57 pages main text & 9 pages of appendices