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:2105.04274 · IEEE International Symposium on Information Theory (ISIT)

Compound Channel Capacities under Energy Constraints and Application

Andrea Cacioppo, Janis Nötzel, Matteo Rosati

Published Jul 12, 2021• 7 citations
arXivHTMLPDF

Abstract

Compound channel models offer a simple and straightforward way of analyzing the stability of decoder design under model variations. With this work we provide a coding theorem for a large class of practically relevant compound channel models. We give explicit formulas for the cases of the Gaussian classical-quantum compound channels with unknown noise, unknown phase and unknown attenuation. We show analytically how the classical compound channel capacity formula motivates nontrivial choices of the displacement parameter of the Kennedy receiver. Our work demonstrates the value of the compound channel model as a method for the design of receivers in quantum communication.

DOI
10.1109/isit45174.2021.9518144

Related papers

Quantum capacity of a class of compound channels

Igor Bjelaković, Holger Boche, Janis Nötzel

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider a memoryless communication scenario with channel uncertainty which is an analog of the compound channel in classical information theory. We determine the quantum capacity of finite compound channels and arbitrary compound channels with an informed decoder. Our approach in the finite case is based on the observation that perfect channel knowledge at the decoder does not increase the capacity of finite quantum compound channels. As a consequence, we obtain a coding theorem for finite quantum averaged channels, the simplest class of channels with long-term memory. The extension of these results to quantum compound channels with uninformed encoder and decoder and infinitely many constituents remains an open problem.

arXiv:0808.1007•Physical Review A•Oct 28, 2008•25 citations

Data Transmission over a Bosonic Channel under Classical Noise

Janis Nötzel

Compound channels model situations where a sender and receiver both have only partial information about the stationary channel they are transmitting over. They can be used to analyse the robustness of a communication system. With this work we provide a coding theorem for a class of practically relevant quantum compound channel models, where we consider the system uncertainty as due to a stationary but unknown jamming signal. Namely, we give an explicit formula for the case of the lossy Bosonic channel in the presence of a semi-classical attack utilizing the injection of coherent states into the transmission line. Mathematically, this is modelled by letting transmitter and jammer access the two different ports of a beam-splitter, and the receiver observe one of the output ports. While the transmitter can modulate their input, the jammer must transmit a constant (but unknown) sequence of states. We conjecture a new quantum entropy power inequality and show its relation to the capacity under study.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•3 citations

Optimality of Sequential Decoding for the Bosonic Compound Channel

Florian Seitz, Janis Nötzel

Recent efforts in the design of communication systems have in addition to data rates embraced a focus on other metrics, such as round-trip latency. Data transmission over a channel is typically preceded by so-called pilot symbols, which let the receiver learn the channel conditions. Together with appropriate feedback, this allows for transmission at high data rates. Trading data rates for communication latency, a communication link may however avoid feedback and instead operate under channel uncertainty, in which case the accurate model is the compound channel. Further reductions of latency may be harnessed from quantum receiver design. In this work we focus in particular on the application of the sequential decoding approach to the bosonic compound channel with unknown phase rotations, loss parameters and thermal noise values. We show that sequential decoding is optimal.

International Conference on Communications•Jun 9, 2024•2 citations

Entanglement-assisted capacities of compound quantum channels

Mario Berta, Hrant Gharibyan, Michael Walter

We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the set that the channel is selected from. We investigate different variations of the problem: uninformed users, informed receiver, informed sender, and feedback assistance. We derive single-letter formulas for all corresponding channel capacities. Our proofs are based on one-shot decoupling bounds and properties of smooth entropies.

arXiv:1603.02282•IEEE Transactions on Information Theory•Jan 1, 2017•16 citations

Fully Quantum Arbitrarily Varying Channel Coding for Entanglement-Assisted Communication

Paula Belzig

If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information theory in the context of compound channel models and arbitrarily varying channel models. However, a fully quantum version of system uncertainty allows for an even more challenging coding scenario with entangled channel uses. This type of model has previously been investigated for classical and quantum capacity. Here, we address the problem of entanglement-assisted capacity in the presence of such system uncertainty. We find that, under the assumption of a finite environment dimension, it is equal to a corresponding compound capacity. Intriguingly, our results imply that in certain fully quantum arbitrarily varying channel models, the entanglement-assisted capacity can be positive while the classical capacity is equal to zero, a phenomenon that does not occur in regular single-channel coding.

arXiv:2404.08200•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•4 citations

The Classical Capacities of Quantum Channels

Sándor Imre, László Gyöngyösi

This chapter introduces formal description of a noisy quantum channel. It discusses the classical capacity of the quantum channel. The chapter provides the various encoder and decoder settings for transmission of classical information through a quantum channel. It examines the formula for the measure of maximal transmittable classical information. The chapter also discusses the various types of classical capacities of quantum channels, and gives a comparison on their properties. It analyzes how to formalize the capacities of the quantum channel models, and provides the fundamental theoretic results on classical capacities of quantum channels. These results are all required to analyze the advanced and more complex properties of quantum communications. The Holevo-Schumacher-Westmoreland (HSW) theorem quantifies explicitly the amount of classical information that can be transmitted through the noisy quantum channel, using product input states. Controlled Vocabulary Terms channel capacity; communication channels; Data communication; encoding; quantum communication; Video codecs

Wiley eBooks•Nov 30, 2012•1 citation
Compound channel models offer a simple and straightforward way of analyzing the stability of decoder design under model variations. With this work we provide a coding theorem for a large class of practically relevant compound channel models. We give explicit formulas for the cases of the Gaussian classical-quantum compound channels with unknown noise, unknown phase and unknown attenuation. We show analytically how the classical compound channel capacity formula motivates nontrivial choices of the displacement parameter of the Kennedy receiver. Our work demonstrates the value of the compound channel model as a method for the design of receivers in quantum communication.
In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider a memoryless communication scenario with channel uncertainty which is an analog of the compound channel in classical information theory. We determine the quantum capacity of finite compound channels and arbitrary compound channels with an informed decoder. Our approach in the finite case is based on the observation that perfect channel knowledge at the decoder does not increase the capacity of finite quantum compound channels. As a consequence, we obtain a coding theorem for finite quantum averaged channels, the simplest class of channels with long-term memory. The extension of these results to quantum compound channels with uninformed encoder and decoder and infinitely many constituents remains an open problem.
Compound channels model situations where a sender and receiver both have only partial information about the stationary channel they are transmitting over. They can be used to analyse the robustness of a communication system. With this work we provide a coding theorem for a class of practically relevant quantum compound channel models, where we consider the system uncertainty as due to a stationary but unknown jamming signal. Namely, we give an explicit formula for the case of the lossy Bosonic channel in the presence of a semi-classical attack utilizing the injection of coherent states into the transmission line. Mathematically, this is modelled by letting transmitter and jammer access the two different ports of a beam-splitter, and the receiver observe one of the output ports. While the transmitter can modulate their input, the jammer must transmit a constant (but unknown) sequence of states. We conjecture a new quantum entropy power inequality and show its relation to the capacity under study.
Recent efforts in the design of communication systems have in addition to data rates embraced a focus on other metrics, such as round-trip latency. Data transmission over a channel is typically preceded by so-called pilot symbols, which let the receiver learn the channel conditions. Together with appropriate feedback, this allows for transmission at high data rates. Trading data rates for communication latency, a communication link may however avoid feedback and instead operate under channel uncertainty, in which case the accurate model is the compound channel. Further reductions of latency may be harnessed from quantum receiver design. In this work we focus in particular on the application of the sequential decoding approach to the bosonic compound channel with unknown phase rotations, loss parameters and thermal noise values. We show that sequential decoding is optimal.
We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the set that the channel is selected from. We investigate different variations of the problem: uninformed users, informed receiver, informed sender, and feedback assistance. We derive single-letter formulas for all corresponding channel capacities. Our proofs are based on one-shot decoupling bounds and properties of smooth entropies.
If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information theory in the context of compound channel models and arbitrarily varying channel models. However, a fully quantum version of system uncertainty allows for an even more challenging coding scenario with entangled channel uses. This type of model has previously been investigated for classical and quantum capacity. Here, we address the problem of entanglement-assisted capacity in the presence of such system uncertainty. We find that, under the assumption of a finite environment dimension, it is equal to a corresponding compound capacity. Intriguingly, our results imply that in certain fully quantum arbitrarily varying channel models, the entanglement-assisted capacity can be positive while the classical capacity is equal to zero, a phenomenon that does not occur in regular single-channel coding.
This chapter introduces formal description of a noisy quantum channel. It discusses the classical capacity of the quantum channel. The chapter provides the various encoder and decoder settings for transmission of classical information through a quantum channel. It examines the formula for the measure of maximal transmittable classical information. The chapter also discusses the various types of classical capacities of quantum channels, and gives a comparison on their properties. It analyzes how to formalize the capacities of the quantum channel models, and provides the fundamental theoretic results on classical capacities of quantum channels. These results are all required to analyze the advanced and more complex properties of quantum communications. The Holevo-Schumacher-Westmoreland (HSW) theorem quantifies explicitly the amount of classical information that can be transmitted through the noisy quantum channel, using product input states. Controlled Vocabulary Terms channel capacity; communication channels; Data communication; encoding; quantum communication; Video codecs