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

IEEE International Symposium on Information Theory (ISIT)

Data Transmission over a Bosonic Channel under Classical Noise

Janis Nötzel

Published Jul 7, 2024• 3 citations
Publisher

Abstract

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.

DOI
10.1109/isit57864.2024.10619133

Related papers

Data Transmission over a Bosonic Arbitrarily Varying Quantum Channel

Janis Nötzel, Florian Seitz

Arbitrarily varying channels offer a powerful framework for analyzing the robustness of quantum communication systems, especially for classical-quantum models, where the analysis displays strengths or weaknesses of specific signal constellations under generic attacks. In this work, we provide a coding theorem for a large class of practically relevant arbitrarily varying channel models. Namely, we give an explicit capacity formula for the lossy bosonic channel subject to semi-classical attacks, where an adversary injects semi-classical states into the transmission line. Mathematically, this is modeled via a beam-splitter setup, with transmitter and jammer controlling different input ports and the receiver observing one output port. We show how a recently conjectured new quantum entropy power inequality relates to our capacity formula.

arXiv:2507.18259•IEEE Information Theory Workshop (ITW)•Sep 29, 2025•0 citations

Capacity Formulas for the Lossy Bosonic Compound Wiretap Channel

Florian Seitz, Janis Nötzel

We consider the bosonic compound wiretap channel. A pair of lossy channels connects a sender with both a (legitimate) receiver and an eavesdropper. The sender and receiver have only partial information about the actual state of the channels. In this situation, their task is to transmit the maximum amount of messages over an asymptotically large number of uses of their channel while guaranteeing at the same time that only an (asymptotically) negligible amount of information leaks to the eavesdropper. We prove capacity formulas for the case where both sender and receiver have the same information about the system and for the case where the sender has channel state information.

arXiv:2504.20870•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•2 citations

Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources

Holger Boche, Minglai Cai, Ning Cai

In this paper, a new model for arbitrarily varying classical-quantum channels is proposed. In this model, a jammer has side information. The communication scenario in which a jammer can select only classical inputs as a jamming sequence is considered in the first part of the paper. This situation corresponds to the standard model of arbitrarily varying classical-quantum channels. Two scenarios are considered. In the first scenario, the jammer knows the channel input, while in the second scenario the jammer knows both the channel input and the message. The transmitter and receiver share a secret random key with a vanishing key rate. The capacity for both average and maximum error criteria for both scenarios is determined in this paper. A strong converse is also proved. It is shown that all these corresponding capacities are equal, which means that additionally revealing the message to the jammer does not change the capacity. The communication scenario with a fully quantum jammer is considered in the second part of the paper. A single letter characterization for the capacity with secret random key as assistance for both average and maximum error criteria is derived in the paper.

arXiv:1801.10550•IEEE Transactions on Information Theory•Oct 31, 2018•15 citations

Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks

Holger Boche, Gisbert Janßen, Sajad Saeedinaeeni

We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under the attack of a malignant third party. These codes are robust to different kinds of channel uncertainties. To construct such universal codes, we invoke and generalize the properties of random codes for classical and quantum message transmission through quantum channels. We show these codes to be optimal by giving a multi-letter characterization of regions corresponding to capacity of compound quantum channels for simultaneously transmitting and generating entanglement with classical messages. In addition, we give dichotomy statements in which we characterize the capacity of arbitrarily varying quantum channels for simultaneous transmission of classical messages and entanglement. These include cases where the malignant jammer present in the arbitrarily varying channel model is classical (chooses channel states of the product form) and fully quantum (is capable of general attacks not necessarily of the product form).

arXiv:1810.10406•Journal of Mathematical Physics•Feb 1, 2019•8 citations

Compound Channel Capacities under Energy Constraints and Application

Andrea Cacioppo, Janis Nötzel, Matteo Rosati

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.

arXiv:2105.04274•IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•7 citations

Entropy power inequalities and classical capacities of bosonic noise channels

Robert König, Graeme Smith

Characterizing information-carrying capacities of bosonic communication channels is of significant practical interest. For thermal noise channels, using coherent (product) states yields an achievable rate for classical communication which is conjectured to be optimal. However, it is not known whether coding strategies using entanglement may perform better. Here we discuss upper bounds on classical capacities of thermal noise channels. These imply that coherent-state coding is close to optimal. Our main tool is a quantum analog of the entropy power inequality introduced Shannon. It gives a lower bound on the output von Neumann entropy when two independent signals combine at a beamsplitter.

IEEE/LEOS Summer Topical Meetings•Jul 1, 2013•0 citations
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.
Arbitrarily varying channels offer a powerful framework for analyzing the robustness of quantum communication systems, especially for classical-quantum models, where the analysis displays strengths or weaknesses of specific signal constellations under generic attacks. In this work, we provide a coding theorem for a large class of practically relevant arbitrarily varying channel models. Namely, we give an explicit capacity formula for the lossy bosonic channel subject to semi-classical attacks, where an adversary injects semi-classical states into the transmission line. Mathematically, this is modeled via a beam-splitter setup, with transmitter and jammer controlling different input ports and the receiver observing one output port. We show how a recently conjectured new quantum entropy power inequality relates to our capacity formula.
We consider the bosonic compound wiretap channel. A pair of lossy channels connects a sender with both a (legitimate) receiver and an eavesdropper. The sender and receiver have only partial information about the actual state of the channels. In this situation, their task is to transmit the maximum amount of messages over an asymptotically large number of uses of their channel while guaranteeing at the same time that only an (asymptotically) negligible amount of information leaks to the eavesdropper. We prove capacity formulas for the case where both sender and receiver have the same information about the system and for the case where the sender has channel state information.
In this paper, a new model for arbitrarily varying classical-quantum channels is proposed. In this model, a jammer has side information. The communication scenario in which a jammer can select only classical inputs as a jamming sequence is considered in the first part of the paper. This situation corresponds to the standard model of arbitrarily varying classical-quantum channels. Two scenarios are considered. In the first scenario, the jammer knows the channel input, while in the second scenario the jammer knows both the channel input and the message. The transmitter and receiver share a secret random key with a vanishing key rate. The capacity for both average and maximum error criteria for both scenarios is determined in this paper. A strong converse is also proved. It is shown that all these corresponding capacities are equal, which means that additionally revealing the message to the jammer does not change the capacity. The communication scenario with a fully quantum jammer is considered in the second part of the paper. A single letter characterization for the capacity with secret random key as assistance for both average and maximum error criteria is derived in the paper.
We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under the attack of a malignant third party. These codes are robust to different kinds of channel uncertainties. To construct such universal codes, we invoke and generalize the properties of random codes for classical and quantum message transmission through quantum channels. We show these codes to be optimal by giving a multi-letter characterization of regions corresponding to capacity of compound quantum channels for simultaneously transmitting and generating entanglement with classical messages. In addition, we give dichotomy statements in which we characterize the capacity of arbitrarily varying quantum channels for simultaneous transmission of classical messages and entanglement. These include cases where the malignant jammer present in the arbitrarily varying channel model is classical (chooses channel states of the product form) and fully quantum (is capable of general attacks not necessarily of the product form).
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.
Characterizing information-carrying capacities of bosonic communication channels is of significant practical interest. For thermal noise channels, using coherent (product) states yields an achievable rate for classical communication which is conjectured to be optimal. However, it is not known whether coding strategies using entanglement may perform better. Here we discuss upper bounds on classical capacities of thermal noise channels. These imply that coherent-state coding is close to optimal. Our main tool is a quantum analog of the entropy power inequality introduced Shannon. It gives a lower bound on the output von Neumann entropy when two independent signals combine at a beamsplitter.