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:1703.04925 · Journal of Mathematical Physics

Heralded channel Holevo superadditivity bounds from entanglement monogamy

L. Gao, Marius Junge, Nicholas D. LaRacuente

Published Jun 1, 2018• 4 citations
arXivHTMLPDF

Abstract

We introduce a class of channels called heralded channels, which generalize the quantum erasure channel composed with an arbitrary other quantum channel. We show that monogamy of squashed entanglement limits the superadditivity of Holevo capacity of heralded channels in the regime of rare success (frequent erasure). We prove that in the limit of near-zero success probability, the classical capacity of the heralded channel converges to its Holevo information, which is equal to success probability times the single-letter Holevo information of the channel with which erasure is composed. We also show how entanglement monogamy applies to non-classicality in quantum games, and we consider how faithful monogamous entanglement measures may bound other entanglement-dependent quantities in many-party scenarios.

DOI
10.1063/1.5011660

Related papers

Distributed Monogamy of Entanglement limits Quantum Channel Simulation

Rabsan Galib Ahmed, Graeme Smith

Entanglement is monogamous: if it is shared among more than two parties, the entanglement between any pair cannot be very strong. For an integer $k\geq 2$, $k$-extendibility of a state $ρ_{AB}$ quantifies this as the number of copies of $B$ that can be simulated by the state's environment. We introduce fractional extendibility, which gives a finer characterization of the quantum correlation that is leaked to the environment, and prove that it is invariant under tensor products and monotonic under local processing. We also establish the distributed monogamy of entanglement: for any state on $AB_1B_2\dots B_n$, the maximum average probability of extracting an EPR pair from a random subset of $k \leq n/2$ systems among the $B_i$'s is the fraction $k/n$. With these tools we resolve a conjecture posed by Matthew Hastings: any quantum erasure channel with erasure probability at least $\frac{1}{2}$ cannot simulate a less noisy erasure channel, even with asymptotically many uses of the noisier channel.

quant-pharXiv:2607.08591•Jul 10, 2026•1 citation

Superadditivity of quantum channel capacity

Fatih Özaydin, Şahin Kaya Özdemir, Masato Koashi +1 more

Superadditivity of quantum capacity of communication channels is one of the most interesting findings of the field. Yard and Smith, finding a relation between the private capacity and the assisted quantum capacity, showed a striking example of superadditivity, i.e. two channels of zero quantum capacity could achieve a positive quantum capacity when used together [1]. The four dimensional channels they used are a 50% erasure channel (therefore zero quantum capacity, due to no-cloning theorem) and a Horodecki channel (again zero quantum capacity due to incapability of sharing free entanglement). In this work we present the more general cases of superadditivity. Directly calculating the lower bounds of joint quantum capacities without using the relation between private capacity and assisted quantum capacity, we examine scenarios considering erasure channels of arbitrary probabilities and different Horodecki channels, and discuss the roles of degradability and anti-degradability as well as the role of the private capacity in superadditivity. We also derive an upper bound for the joint quantum capacity for the superactivation case.

AIP conference proceedings•Jan 1, 2012•0 citations

Approaches for approximate additivity of the Holevo information of quantum channels

Felix Leditzky, Eneet Kaur, Nilanjana Datta +1 more

We study quantum channels that are close to another channel with weakly additive Holevo information, and we derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above, which measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as well as an outer bound on the dynamic capacity region of a quantum channel. Since these parameters are defined in terms of the diamond distance, the upper bounds can be computed efficiently using semidefinite programming (SDP). We exhibit the usefulness of our method with two example channels: a convex mixture of amplitude damping and depolarizing noise and a composition of amplitude damping and dephasing noise. For both channels, our bounds perform well in certain regimes of the noise parameters in comparison to a recently derived SDP upper bound on the classical capacity. Along the way, we define the notion of a generalized channel divergence (which includes the diamond distance as an example), and we prove that for jointly covariant channels these quantities are maximized by purifications of a state invariant under the covariance group. This latter result may be of independent interest.

arXiv:1709.01111•Physical Review A•Jan 25, 2018•121 citations

Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

Ziao Tang, Chengkai Zhu, Ge Bai +1 more

Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability $p$, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is $h_2((1+\sqrt p)/2)$ ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for $p<1$, and construct a binary Kraus representation attaining the uniform formation bound.

quant-pharXiv:2609.28592•Sep 24, 2026•3 citations

Simultaneous Superadditivity of the Direct and Complementary Channel Capacities

Satvik Singh, Sergii Strelchuk

Quantum communication channels differ from their classical counterparts because their capacities can be superadditive. The principle of monogamy of entanglement suggests that superadditive improvements in the transmission capacity of a channel should reduce the amount of information loss to the environment. We challenge this intuition by demonstrating that the coherent and private information of a channel and its complement can be simultaneously superadditive for arbitrarily many channel uses. To quantify the limits of this effect, we consider the notion of max (resp. total) private information of a channel, which represents the maximum (resp. sum) of the private information of the channel itself and its complement, and study its relationship with the coherent information of the individual direct and complementary channels. We show that these quantities can obey different interleaving sequences of inequalities for a varying number of channel uses.

arXiv:2301.05142•IEEE Transactions on Information Theory•Aug 25, 2025•2 citations

The Squashed Entanglement of a Quantum Channel

Masahiro Takeoka, Saikat Guha, Mark M. Wilde

This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl and Winter, establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed (log (1+η)/(1-η)) for a pure-loss bosonic channel for which a fraction (η) of the input photons make it to the output on average. The best known lower bound on these capacities is equal to (log (1/(1-η)). Thus, in the high-loss regime for which η ≪ 1), this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.

arXiv:1310.0129•IEEE Transactions on Information Theory•Jun 19, 2014•103 citations
We introduce a class of channels called heralded channels, which generalize the quantum erasure channel composed with an arbitrary other quantum channel. We show that monogamy of squashed entanglement limits the superadditivity of Holevo capacity of heralded channels in the regime of rare success (frequent erasure). We prove that in the limit of near-zero success probability, the classical capacity of the heralded channel converges to its Holevo information, which is equal to success probability times the single-letter Holevo information of the channel with which erasure is composed. We also show how entanglement monogamy applies to non-classicality in quantum games, and we consider how faithful monogamous entanglement measures may bound other entanglement-dependent quantities in many-party scenarios.
Entanglement is monogamous: if it is shared among more than two parties, the entanglement between any pair cannot be very strong. For an integer k≥2k\geq 2k≥2, kkk-extendibility of a state ρABρ_{AB}ρAB​ quantifies this as the number of copies of BBB that can be simulated by the state's environment. We introduce fractional extendibility, which gives a finer characterization of the quantum correlation that is leaked to the environment, and prove that it is invariant under tensor products and monotonic under local processing. We also establish the distributed monogamy of entanglement: for any state on AB1B2…BnAB_1B_2\dots B_nAB1​B2​…Bn​, the maximum average probability of extracting an EPR pair from a random subset of k≤n/2k \leq n/2k≤n/2 systems among the BiB_iBi​'s is the fraction k/nk/nk/n. With these tools we resolve a conjecture posed by Matthew Hastings: any quantum erasure channel with erasure probability at least 12\frac{1}{2}21​ cannot simulate a less noisy erasure channel, even with asymptotically many uses of the noisier channel.
Superadditivity of quantum capacity of communication channels is one of the most interesting findings of the field. Yard and Smith, finding a relation between the private capacity and the assisted quantum capacity, showed a striking example of superadditivity, i.e. two channels of zero quantum capacity could achieve a positive quantum capacity when used together [1]. The four dimensional channels they used are a 50% erasure channel (therefore zero quantum capacity, due to no-cloning theorem) and a Horodecki channel (again zero quantum capacity due to incapability of sharing free entanglement). In this work we present the more general cases of superadditivity. Directly calculating the lower bounds of joint quantum capacities without using the relation between private capacity and assisted quantum capacity, we examine scenarios considering erasure channels of arbitrary probabilities and different Horodecki channels, and discuss the roles of degradability and anti-degradability as well as the role of the private capacity in superadditivity. We also derive an upper bound for the joint quantum capacity for the superactivation case.
We study quantum channels that are close to another channel with weakly additive Holevo information, and we derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above, which measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as well as an outer bound on the dynamic capacity region of a quantum channel. Since these parameters are defined in terms of the diamond distance, the upper bounds can be computed efficiently using semidefinite programming (SDP). We exhibit the usefulness of our method with two example channels: a convex mixture of amplitude damping and depolarizing noise and a composition of amplitude damping and dephasing noise. For both channels, our bounds perform well in certain regimes of the noise parameters in comparison to a recently derived SDP upper bound on the classical capacity. Along the way, we define the notion of a generalized channel divergence (which includes the diamond distance as an example), and we prove that for jointly covariant channels these quantities are maximized by purifications of a state invariant under the covariance group. This latter result may be of independent interest.
Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability ppp, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is h2((1+p)/2)h_2((1+\sqrt p)/2)h2​((1+p​)/2) ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for p<1p<1p<1, and construct a binary Kraus representation attaining the uniform formation bound.
Quantum communication channels differ from their classical counterparts because their capacities can be superadditive. The principle of monogamy of entanglement suggests that superadditive improvements in the transmission capacity of a channel should reduce the amount of information loss to the environment. We challenge this intuition by demonstrating that the coherent and private information of a channel and its complement can be simultaneously superadditive for arbitrarily many channel uses. To quantify the limits of this effect, we consider the notion of max (resp. total) private information of a channel, which represents the maximum (resp. sum) of the private information of the channel itself and its complement, and study its relationship with the coherent information of the individual direct and complementary channels. We show that these quantities can obey different interleaving sequences of inequalities for a varying number of channel uses.
This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl and Winter, establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed (log (1+η)/(1-η)) for a pure-loss bosonic channel for which a fraction (η) of the input photons make it to the output on average. The best known lower bound on these capacities is equal to (log (1/(1-η)). Thus, in the high-loss regime for which η ≪ 1), this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.