🔢 mathematics

Transmitting algebras through quantum channels

This paper develops a theory for the exact transmission of finite-dimensional $C^*$ -algebras through quantum channels, revealing that a single dominating algebra often fails to exist even in small dimensions, which necessitates selecting among incomparable maximal algebras and leads to complex phenomena such as algebraic superadditivity and doubly exponential growth in transmittable types at large block-lengths.

Original authors: Robert Salzmann, Satvik Singh

Published 2026-10-01

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Robert Salzmann, Satvik Singh

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the world of information, we often imagine data as either a string of zeros and ones or a delicate quantum state that can exist in many places at once. But the physical world is rarely so binary. A real-world memory device might hold a simple label, like a file name, alongside a complex quantum system whose size depends on that label. To understand how such hybrid information survives the journey through a noisy, imperfect channel, scientists use a mathematical framework called a C*-algebra. Think of this structure as a container that can hold different types of information simultaneously: a classical part that acts like a switchboard, directing traffic to different quantum compartments, and a quantum part that holds the actual data. The central question researchers ask is simple yet profound: given a specific noisy channel, what is the largest, most versatile container of this hybrid information that can be sent through it without any errors?

For decades, scientists have studied the limits of sending pure classical messages or pure quantum states through noisy channels. They have developed precise ways to measure these limits, known as capacities. However, these measurements only capture a single number, like the maximum number of bits or qubits. They miss the richer reality where a message might be a mix of both. This new work by Robert Salzmann and Satvik Singh builds a complete theory for these hybrid transmissions. They treat the information not just as a number, but as a specific shape or structure. Their goal was to determine if, for every noisy channel, there is one single "best" shape of information that can be sent. If such a shape existed, it would be a universal key, capable of holding any other type of transmittable information inside it, much like a large suitcase that can fit any smaller bag.

The researchers discovered that this universal key does not always exist. In fact, they found that for some channels, there are two different, equally good ways to send information that cannot be compared. One way might be perfect for sending a small quantum system, while another is perfect for sending a larger number of classical messages. Neither is better than the other; they are simply different optimal strategies. If a user wants to send a quantum bit, they must choose the first strategy. If they want to send three classical messages, they must choose the second. There is no single "best" way that covers both needs. This finding overturns the hope that every channel has a single, dominant optimal use. Instead, the best way to use a channel depends entirely on what specific type of information the user needs to preserve.

To make sense of this complexity, the authors developed a new set of tools called hybrid capacities. These tools measure how many classical messages can be sent alongside a quantum system of a specific size. Using these measurements, they can reconstruct the only possible candidate for a "best" shape, which they call the capacity algebra. However, they proved that just because this candidate exists and can be sent, it does not guarantee that it is the ultimate winner. Sometimes, there are hidden obstacles—specific, smaller shapes of information that cannot be sent—that prevent the candidate from being the true master of all transmission. The team provided a precise, finite checklist to determine if a channel truly has a single best shape or if it is stuck with multiple, incomparable options.

The study also looked at what happens when we use a channel many times in a row. In classical information theory, using a channel multiple times often just scales up the capacity in a predictable way. Here, the behavior is far more wild. The researchers showed that when you combine channels, new, unexpected shapes of information can appear that were impossible to create by using the channels separately. This is similar to how mixing two colors can create a third that neither possessed alone, but in the realm of information structure. Even more strikingly, they constructed a specific channel where the number of different optimal ways to send information grows at a dizzying pace. As the number of times the channel is used increases, the number of distinct, optimal information shapes doubles and doubles again, growing so fast that no finite list of short codes could ever describe all the possibilities.

This work reveals that the landscape of error-free communication is far more rugged and varied than previously thought. It is not a smooth hill with a single peak, but a terrain with many high points that cannot be reached from one another. For engineers and scientists designing future quantum networks, this means there is no single "one-size-fits-all" solution for error correction. Instead, the design must be tailored to the specific type of hybrid information being sent. The theory provides the map for this terrain, showing exactly where the peaks are and how to navigate between them, ensuring that the delicate hybrid information of the future can be preserved with perfect fidelity.

Technical Summary: Transmitting algebras through quantum channels

Problem Statement
The paper addresses the problem of exact, zero-error transmission of finite-dimensional $C^*$ -algebras through noisy quantum channels. While classical and quantum zero-error capacities are well-studied, they describe only scalar aspects of transmission (purely classical messages or purely quantum systems). The authors generalize this framework to "hybrid" classical-quantum information, where the information object is a $C^*$ -algebra $A \cong \bigoplus_{k=1}^K M_{d_k}(\mathbb{C})$ . In this structure, the center of the algebra stores a classical label $k$ , while the simple summand $M_{d_k}(\mathbb{C})$ stores a quantum system of dimension $d_k$ conditioned on that label.

The central question is: Given a noisy channel $\Phi$ , which algebra types are transmittable? Furthermore, does there exist a unique "optimal" or "dominating" transmittable algebra $A_{dom}$ into which every other transmittable algebra can be embedded? If such an algebra exists, it would represent a single universally optimal strategy for using the channel.

Methodology and Definitions
The authors formalize the transmission of an algebra $A$ via a channel $\Phi: \mathcal{L}(\mathcal{H}) \to \mathcal{L}(\mathcal{K})$ using the framework of operator-algebraic quantum error correction.

Transmittability: An algebra $A$ is transmittable if there exists a faithful encoding representation $\pi_E: A \to \mathcal{L}(\mathcal{H})$ such that the image $\pi_E(A)$ is correctable for $\Phi$ . Equivalently, there exist encoding and decoding channels $E$ and $D$ such that $D \circ \Phi \circ E = P_A$ , where $P_A$ is the trace-preserving conditional expectation onto $A$ .
Ordering: The set of transmittable algebras $\mathcal{T}(\Phi)$ is ordered by the embedding preorder ( $A \leq B$ ). $A$ embeds into $B$ if the blocks of $A$ can be packed into the blocks of $B$ via a non-negative integer matrix satisfying specific dimension constraints.
Maximal vs. Dominating: An algebra is maximal if no strictly larger transmittable algebra contains it. An algebra is dominating if it contains every other transmittable algebra. The paper investigates whether $|\max(\mathcal{T}(\Phi))| = 1$ for all channels.

Key Contributions and Results

Non-existence of Dominating Algebras:
The paper demonstrates that a dominating transmittable algebra does not always exist. The authors construct explicit channels in small dimensions (e.g., $\Phi: M_4(\mathbb{C}) \to M_3(\mathbb{C})$ ) where the set of maximal transmittable algebras is $\{M_2(\mathbb{C}), \mathbb{C}_3\}$ . In this case, preserving a qubit and transmitting three classical messages are incomparable optimal strategies; neither can be embedded into the other, and no single algebra dominates both.
Hybrid Capacities and the Capacity Algebra:
The authors introduce hybrid classical-quantum capacities $c_d(\Phi)$ , defined as the maximum number of classical messages that can be sent alongside a $d$ -dimensional quantum system. Using these, they construct a "capacity algebra" $A_{cap}(\Phi)$ , which is the unique algebra type determined by the sequence of hybrid capacities.
- Result: If a dominating algebra exists, it must be isomorphic to $A_{cap}(\Phi)$ . However, the existence and transmittability of $A_{cap}(\Phi)$ are necessary but not sufficient conditions for domination.
- Finite Characterization: The paper provides a complete finite criterion for domination: a candidate algebra $A$ is dominating if and only if it is transmittable and none of its "minimal forbidden algebra types" (algebras that do not embed into $A$ but whose proper sub-algebras do) are transmittable.
Sufficient Conditions for Domination:
The authors identify specific classes of channels that admit a dominating algebra:
- Algebraic Operator Systems: If the noncommutative confusability graph (operator system) $S_\Phi$ is graph-isomorphic to a unital $*$ -subalgebra, the commutant $S'_\Phi$ is the dominating algebra.
- Highly Divisible Channels: For any channel $\Psi$ , sufficiently high tensor powers $\Psi^{\ell}$ (where $\ell \geq (\dim \mathcal{H})^2$ ) admit a dominating algebra isomorphic to the peripheral algebra of the channel.
- Zero Quantum Capacity: Channels with zero one-shot zero-error quantum capacity ( $Q_0(\Phi)=0$ ) admit a purely classical dominating algebra.
Tensor Products and Superadditivity:
The paper investigates the behavior of transmission sets under tensor products.
- Loss of Domination: Even if two channels $\Phi$ and $\Psi$ individually possess dominating algebras, their joint use $\Phi \otimes \Psi$ may not. Joint coding can produce new algebra types that are incomparable with the product of the individual dominating algebras, analogous to the superadditivity of capacities in Shannon theory.
- Double-Exponential Growth: The authors construct a channel $\Psi$ where the number of maximal transmittable algebra types at block-length $n$ , denoted $w_n(\Psi)$ , grows doubly exponentially ( $w_n(\Psi) \gtrsim 2^{2^n}$ ). This implies that the full transmission structure of such channels cannot be generated from any finite collection of bounded-block-length codes; new, product-indecomposable algebra types appear at arbitrarily large block lengths.

Significance
The paper establishes that the landscape of zero-error hybrid communication is structurally richer than previously understood. The existence of multiple incomparable maximal algebras implies that the "optimal" use of a quantum channel is not unique but depends on the specific operational task (e.g., prioritizing quantum coherence vs. classical distinguishability). The failure of domination under tensor products highlights the complexity of joint coding in the zero-error regime. Furthermore, the double-exponential growth of maximal algebra types suggests that the transmission capabilities of quantum channels cannot be fully characterized by a finite set of building blocks, challenging the notion of a simple, finite description for asymptotic zero-error communication structures.

More like this