Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.40054

Transmitting algebras through quantum channels

Robert Salzmann, Satvik Singh

quant-phmath-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

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.

No sign of AI-generated text

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

Related papers

Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata

Salman Beigi, Marco Tomamichel

A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.

quant-pharXiv:2609.11771•Sep 11, 2026•5 citations

No information transmission through quantum channels above capacity

Hao-Chung Cheng, Marco Tomamichel

We show that the capacity of a quantum channel demarcates a phase transition: while reliable transmission below capacity is always possible, any attempt to transmit information above it fails catastrophically. Specifically, we prove exponential strong converse theorems for unassisted quantum and classical communication over arbitrary finite-dimensional memoryless quantum channels. At rates beyond the respective capacity, the entanglement-generation fidelity and the success probability for classical communication decay exponentially with the number of channel uses. This rules out transmission above capacity even when one tolerates arbitrarily large errors. Our proof follows the classical Arimoto strategy, augmented by a crucial new ingredient: integral representations of Rényi information measures that lead to asymptotic continuity bounds for Rényi capacities.

quant-pharXiv:2609.08998•Sep 9, 2026•6 citations

Transmitting Quantum Information Reliably across Various Quantum Channels

Yingkai Ouyang

Transmitting quantum information across quantum channels is an important task. However quantum information is delicate, and is easily corrupted. We address the task of protecting quantum information from an information theoretic perspective -- we encode some message qudits into a quantum code, send the encoded quantum information across the noisy quantum channel, then recover the message qudits by decoding. In this dissertation, we discuss the coding problem from several perspectives.} \n \nThe noisy quantum channel is one of the central aspects of the quantum coding problem, and hence quantifying the noisy quantum channel from the physical model is an important problem. \nWe work with an explicit physical model -- a pair of initially decoupled quantum harmonic oscillators interacting with a spring-like coupling, where the bath oscillator is initially in a thermal-like state. In particular, we treat the completely positive and trace preserving map on the system as a quantum channel, and study the truncation of the channel by truncating its Kraus set. We thereby derive the matrix elements of the Choi-Jamiolkowski operator of the corresponding truncated channel, which are truncated transition amplitudes. Finally, we give a computable approximation for these truncated transition amplitudes with explicit error bounds, and perform a case study of the oscillators in the off-resonant and weakly-coupled regime numerically. \n \nIn the context of truncated noisy channels, we revisit the notion of approximate error correction of finite dimension codes. We derive a computationally simple lower bound on the worst case entanglement fidelity of a quantum code, when the truncated recovery map of Leung et. al. is rescaled. As an application, we apply our bound to construct a family of multi-error correcting amplitude damping codes that are permutation-invariant. This demonstrates an explicit example where the specific structure of the noisy channel allows code design out of the stabilizer formalism via purely algebraic means. \n \nWe study lower bounds on the quantum capacity of adversarial channels, where we restrict the selection of quantum codes to the set of concatenated quantum codes. \nThe adversarial channel is a quantum channel where an adversary corrupts a fixed fraction of qudits sent across a quantum channel in the most malicious way possible. The best known rates of communicating over adversarial channels are given by the quantum Gilbert-Varshamov (GV) bound, that is known to be attainable with random quantum codes. We generalize the classical result of Thommesen to the quantum case, thereby demonstrating the existence of concatenated quantum codes that can asymptotically attain the quantum GV bound. The outer codes are quantum generalized Reed-Solomon codes, and the inner codes are random independently chosen stabilizer codes, where the rates of the inner and outer codes lie in a specified feasible region. \n \nWe next study upper bounds on the quantum capacity of some low dimension quantum channels. \nThe quantum capacity of a quantum channel is the maximum rate at which quantum information can be transmitted reliably across it, given arbitrarily many uses of it. While it is known that random quantum codes can be used to attain the quantum capacity, the quantum capacity of many classes of channels is undetermined, even for channels of low input and output dimension. For example, depolarizing channels are \n important quantum channels, but do not have tight numerical bounds. \nWe obtain upper bounds on the quantum capacity of some unital and non-unital channels \n -- two-qubit Pauli channels, two-qubit depolarizing channels, two-qubit locally symmetric channels, \n shifted qubit depolarizing channels, and shifted two-qubit Pauli channels -- \n using the coherent information of some degradable channels. We use the notion \n of twirling quantum channels, and Smith and Smolin's method of constructing \n degradable extensions of quantum channels extensively. The degradable channels we \n introduce, study and use are two-qubit amplitude damping channels. Exploiting the \n notion of covariant quantum channels, we give sufficient conditions for the quantum \n capacity of a degradable channel to be the optimal value of a concave program with \n linear constraints, and show that our two-qubit degradable amplitude damping channels have this property.

•May 1, 2013•1 citation

Superadditivity of Quantum Channel Coding Rate With Finite Blocklength Joint Measurements

Hye Won Chung, Saikat Guha, Lizhong Zheng

The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N , the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum channel and provide a lower bound on C[subscript N]/N, the maximum information rate when the JDR is restricted to making joint measurements over no more than N quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon-of mathematical resemblance to the aforesaid problem-in the channel capacity of a classical discrete memoryless channel when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on N-length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to C[subscript N]/N to be equal to a given fraction of the asymptotic capacity C of the respective channel, N must be proportional to V/C², where V is the respective channel dispersion quantity.

•Aug 1, 2016•10 citations

Superadditivity of Quantum Channel Coding Rate With Finite Blocklength Joint Measurements

Hye Won Chung, Saikat Guha, Lizhong Zheng

The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N , the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum channel and provide a lower bound on CN/N, the maximum information rate when the JDR is restricted to making joint measurements over no more than N quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon-of mathematical resemblance to the aforesaid problem-in the channel capacity of a classical discrete memoryless channel when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on N -length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to CN/N to be equal to a given fraction of the asymptotic capacity C of the respective channel, N must be proportional to V/C2, where V is the respective channel dispersion quantity.

arXiv:1310.3793•IEEE Transactions on Information Theory•Aug 2, 2016•10 citations

Superadditivity of Zero-Error Capacity in Noisy Classical and Perfect Quantum Channel Pairs

Ambuj, Anushko Chattopadhyay, Kunika Agarwal +2 more

We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting where a noisy classical channel is used in parallel with a perfect quantum channel. Each channel individually supports only a fixed number of perfectly distinguishable messages. Their joint use enables transmission of strictly more messages than permitted by the product of the individual capacities. We present explicit constructions achieving this enhancement and establish that replacing the perfect quantum channel with a perfect classical channel eliminates the effect. Finally, we identify a structural criterion on the noisy channel governing this effect and show that the quantum advantage is rooted in Kochen-Specker contextuality.

quant-pharXiv:2601.08913•Jan 15, 2026•3 citations
We develop a theory of exact transmission of finite-dimensional C∗C^*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 nnn-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.
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 A=⨁kMdk\mathcal A=\bigoplus_k M_{d_k}A=⨁k​Mdk​​, 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 A\mathcal AA, and by mutually output-distinguishable quantum codes of dimensions dkd_kdk​ satisfying Knill–Laflamme conditions. Explicit channels with input/output dimensions (4,3)(4,3)(4,3) and (3,4)(3,4)(3,4) have precisely two maximal types, M2M_2M2​ and C3\mathbb C^3C3, 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 nnn, with wn≳22nw_n\gtrsim2^{2^n}wn​≳22n; universally, wn≤2dn−1w_n\leq2^{d^n}-1wn​≤2dn−1 for input dimension ddd. 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.
A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.
We show that the capacity of a quantum channel demarcates a phase transition: while reliable transmission below capacity is always possible, any attempt to transmit information above it fails catastrophically. Specifically, we prove exponential strong converse theorems for unassisted quantum and classical communication over arbitrary finite-dimensional memoryless quantum channels. At rates beyond the respective capacity, the entanglement-generation fidelity and the success probability for classical communication decay exponentially with the number of channel uses. This rules out transmission above capacity even when one tolerates arbitrarily large errors. Our proof follows the classical Arimoto strategy, augmented by a crucial new ingredient: integral representations of Rényi information measures that lead to asymptotic continuity bounds for Rényi capacities.
Transmitting quantum information across quantum channels is an important task. However quantum information is delicate, and is easily corrupted. We address the task of protecting quantum information from an information theoretic perspective -- we encode some message qudits into a quantum code, send the encoded quantum information across the noisy quantum channel, then recover the message qudits by decoding. In this dissertation, we discuss the coding problem from several perspectives.} \n \nThe noisy quantum channel is one of the central aspects of the quantum coding problem, and hence quantifying the noisy quantum channel from the physical model is an important problem. \nWe work with an explicit physical model -- a pair of initially decoupled quantum harmonic oscillators interacting with a spring-like coupling, where the bath oscillator is initially in a thermal-like state. In particular, we treat the completely positive and trace preserving map on the system as a quantum channel, and study the truncation of the channel by truncating its Kraus set. We thereby derive the matrix elements of the Choi-Jamiolkowski operator of the corresponding truncated channel, which are truncated transition amplitudes. Finally, we give a computable approximation for these truncated transition amplitudes with explicit error bounds, and perform a case study of the oscillators in the off-resonant and weakly-coupled regime numerically. \n \nIn the context of truncated noisy channels, we revisit the notion of approximate error correction of finite dimension codes. We derive a computationally simple lower bound on the worst case entanglement fidelity of a quantum code, when the truncated recovery map of Leung et. al. is rescaled. As an application, we apply our bound to construct a family of multi-error correcting amplitude damping codes that are permutation-invariant. This demonstrates an explicit example where the specific structure of the noisy channel allows code design out of the stabilizer formalism via purely algebraic means. \n \nWe study lower bounds on the quantum capacity of adversarial channels, where we restrict the selection of quantum codes to the set of concatenated quantum codes. \nThe adversarial channel is a quantum channel where an adversary corrupts a fixed fraction of qudits sent across a quantum channel in the most malicious way possible. The best known rates of communicating over adversarial channels are given by the quantum Gilbert-Varshamov (GV) bound, that is known to be attainable with random quantum codes. We generalize the classical result of Thommesen to the quantum case, thereby demonstrating the existence of concatenated quantum codes that can asymptotically attain the quantum GV bound. The outer codes are quantum generalized Reed-Solomon codes, and the inner codes are random independently chosen stabilizer codes, where the rates of the inner and outer codes lie in a specified feasible region. \n \nWe next study upper bounds on the quantum capacity of some low dimension quantum channels. \nThe quantum capacity of a quantum channel is the maximum rate at which quantum information can be transmitted reliably across it, given arbitrarily many uses of it. While it is known that random quantum codes can be used to attain the quantum capacity, the quantum capacity of many classes of channels is undetermined, even for channels of low input and output dimension. For example, depolarizing channels are \n important quantum channels, but do not have tight numerical bounds. \nWe obtain upper bounds on the quantum capacity of some unital and non-unital channels \n -- two-qubit Pauli channels, two-qubit depolarizing channels, two-qubit locally symmetric channels, \n shifted qubit depolarizing channels, and shifted two-qubit Pauli channels -- \n using the coherent information of some degradable channels. We use the notion \n of twirling quantum channels, and Smith and Smolin's method of constructing \n degradable extensions of quantum channels extensively. The degradable channels we \n introduce, study and use are two-qubit amplitude damping channels. Exploiting the \n notion of covariant quantum channels, we give sufficient conditions for the quantum \n capacity of a degradable channel to be the optimal value of a concave program with \n linear constraints, and show that our two-qubit degradable amplitude damping channels have this property.
The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N , the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum channel and provide a lower bound on C[subscript N]/N, the maximum information rate when the JDR is restricted to making joint measurements over no more than N quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon-of mathematical resemblance to the aforesaid problem-in the channel capacity of a classical discrete memoryless channel when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on N-length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to C[subscript N]/N to be equal to a given fraction of the asymptotic capacity C of the respective channel, N must be proportional to V/C², where V is the respective channel dispersion quantity.
The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N , the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum channel and provide a lower bound on CN/N, the maximum information rate when the JDR is restricted to making joint measurements over no more than N quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon-of mathematical resemblance to the aforesaid problem-in the channel capacity of a classical discrete memoryless channel when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on N -length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to CN/N to be equal to a given fraction of the asymptotic capacity C of the respective channel, N must be proportional to V/C2, where V is the respective channel dispersion quantity.
We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting where a noisy classical channel is used in parallel with a perfect quantum channel. Each channel individually supports only a fixed number of perfectly distinguishable messages. Their joint use enables transmission of strictly more messages than permitted by the product of the individual capacities. We present explicit constructions achieving this enhancement and establish that replacing the perfect quantum channel with a perfect classical channel eliminates the effect. Finally, we identify a structural criterion on the noisy channel governing this effect and show that the quantum advantage is rooted in Kochen-Specker contextuality.