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:1110.2594 · Physical Review A

Schemes of transmission of classical information via quantum channels with many senders: Discrete- and continuous-variable cases

Łukasz Czekaj, Jarosław K. Korbicz, Ravindra W. Chhajlany, Paweł Horodecki

Published Jan 19, 2012• 3 citations
arXivHTMLPDF

Abstract

Superadditivity effects in the classical capacity of discrete multiaccess channels and continuous variable (CV) Gaussian MACs are analyzed. Several examples of the manifestation of superadditivity in the discrete case are provided, including, in particular, a channel which is fully symmetric with respect to all senders. Furthermore, we consider a class of channels for which input entanglement across more than two copies of the channels is necessary to saturate the asymptotic rate of transmission from one of the senders to the receiver. The five-input entanglement of Shor error correction codewords surpass the capacity attainable by using arbitrary two-input entanglement for these channels. In the CV case, we consider the properties of the two channels (a beam-splitter channel and a ``nondemolition'' quadratures coupling sum (XP) gate channel) analyzed in Czekaj et al. [Phys. Rev. A 82, 020302(R) (2010)] in greater detail and also consider the sensitivity of capacity superadditivity effects to thermal noise. We observe that the estimates of the amount of two-mode squeezing required to achieve capacity superadditivity are more optimistic than previously reported.

DOI
10.1103/physreva.85.012316

Related papers

Quantum superadditivity in linear optics networks: Sending bits via multiple-access Gaussian channels

Łukasz Czekaj, Jarosław K. Korbicz, Ravindra W. Chhajlany +1 more

Superadditivity effects of communication capacities are known in the case of discrete variable quantum channels. We describe the continuous variable analog of one of these effects in the framework of Gaussian multiple access channels (MACs). Classically, superadditivity-type effects are strongly restricted: For example, adding resources to one sender is never advantageous to other senders in sending their respective information to the receiver. We show that this rule can be surpassed using quantum resources, giving rise to a type of truly quantum superadditivity. This is illustrated here for two examples of experimentally feasible Gaussian MACs.

arXiv:0904.4870•Physical Review A•Aug 31, 2010•7 citations

Superadditivity of multiple access gaussian channels

Łukasz Czekaj, Korbicz Jarek K., Chhajlany Ravindra W. +1 more

We study classical capacity regions of quantum Gaussian multiple access channels (MAC). In classical variants of such channels, whilst some capacity superadditivity-type effects such as the so called water filling effect may be achieved, a fundamental classical additivity law can still be identified, viz. adding resources to one sender is never advantageous to other senders in sending their respective information to the receiver. Here, we show that quantum resources allow violation of this law, by providing an illustrative scheme of an experimentally feasible Gaussian MAC.

NATO science for peace and security series. D, Information and communication security•Jan 1, 2010•0 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 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•8 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•8 citations

Superadditivity for Entanglement-Assisted Communication

Hao-Chung Cheng, Mario Berta

The entanglement-assisted capacity of a quantum channel admits an additive single-letter characterization, implying that joint encodings across channel uses cannot increase the ultimate communication rate. Here, we show that this additive picture does not extend to communication reliability. Specifically, we prove that the Petz-Rényi channel information can be strictly superadditive for every $α\in[1/2,1)$, yielding a genuine multi-copy enhancement of the entanglement-assisted random-coding error exponent, even though the entanglement-assisted capacity remains additive. We establish this phenomenon analytically already for measurement channels, which are entanglement-breaking and have additive unassisted capacity. Remarkably, this strict superadditivity is witnessed by a separable, classically correlated two-copy channel-input marginal, demonstrating that no entanglement between the transmitted systems is required. Our results show that, although correlations across channel uses cannot increase the ultimate rate of entanglement-assisted communication, they can enhance its reliability.

quant-pharXiv:2607.15151•Jul 17, 2026•0 citations

Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels

Haowei Shi, Min-Hsiu Hsieh, Saikat Guha +2 more

Abstract We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss MAC and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.

arXiv:2101.12173•npj Quantum Information•May 19, 2021•26 citations
Superadditivity effects in the classical capacity of discrete multiaccess channels and continuous variable (CV) Gaussian MACs are analyzed. Several examples of the manifestation of superadditivity in the discrete case are provided, including, in particular, a channel which is fully symmetric with respect to all senders. Furthermore, we consider a class of channels for which input entanglement across more than two copies of the channels is necessary to saturate the asymptotic rate of transmission from one of the senders to the receiver. The five-input entanglement of Shor error correction codewords surpass the capacity attainable by using arbitrary two-input entanglement for these channels. In the CV case, we consider the properties of the two channels (a beam-splitter channel and a ``nondemolition'' quadratures coupling sum (XP) gate channel) analyzed in Czekaj et al. [Phys. Rev. A 82, 020302(R) (2010)] in greater detail and also consider the sensitivity of capacity superadditivity effects to thermal noise. We observe that the estimates of the amount of two-mode squeezing required to achieve capacity superadditivity are more optimistic than previously reported.
Superadditivity effects of communication capacities are known in the case of discrete variable quantum channels. We describe the continuous variable analog of one of these effects in the framework of Gaussian multiple access channels (MACs). Classically, superadditivity-type effects are strongly restricted: For example, adding resources to one sender is never advantageous to other senders in sending their respective information to the receiver. We show that this rule can be surpassed using quantum resources, giving rise to a type of truly quantum superadditivity. This is illustrated here for two examples of experimentally feasible Gaussian MACs.
We study classical capacity regions of quantum Gaussian multiple access channels (MAC). In classical variants of such channels, whilst some capacity superadditivity-type effects such as the so called water filling effect may be achieved, a fundamental classical additivity law can still be identified, viz. adding resources to one sender is never advantageous to other senders in sending their respective information to the receiver. Here, we show that quantum resources allow violation of this law, by providing an illustrative scheme of an experimentally feasible Gaussian MAC.
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.
The entanglement-assisted capacity of a quantum channel admits an additive single-letter characterization, implying that joint encodings across channel uses cannot increase the ultimate communication rate. Here, we show that this additive picture does not extend to communication reliability. Specifically, we prove that the Petz-Rényi channel information can be strictly superadditive for every α∈[1/2,1)α\in[1/2,1)α∈[1/2,1), yielding a genuine multi-copy enhancement of the entanglement-assisted random-coding error exponent, even though the entanglement-assisted capacity remains additive. We establish this phenomenon analytically already for measurement channels, which are entanglement-breaking and have additive unassisted capacity. Remarkably, this strict superadditivity is witnessed by a separable, classically correlated two-copy channel-input marginal, demonstrating that no entanglement between the transmitted systems is required. Our results show that, although correlations across channel uses cannot increase the ultimate rate of entanglement-assisted communication, they can enhance its reliability.
Abstract We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss MAC and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.