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

International Conference on Communications

Optimality of Sequential Decoding for the Bosonic Compound Channel

Florian Seitz, Janis Nötzel

Published Jun 9, 2024• 2 citations
Publisher

Abstract

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.

DOI
10.1109/icc51166.2024.10622447

Related papers

Trading Datarate for Latency in Quantum Communication

Zuhra Amiri, Florian Seitz, Janis Nötzel

Low latency and high data rate performance are essential in wireless communication systems. This paper explores trade-offs between latency and data rates for optical wireless communication. We introduce a latency-optimized model utilizing compound codes as one corner case and a data rate-optimized model employing channel estimation via pilot signals and feedback before data transmission. Trade-offs between the two extremes are displayed. Most importantly, we detail operating points that can only be reached when the receiver side of the link employs optimal quantum measurement strategies. Furthermore, we propose an IoT application in a robot factory as an example scenario. Our findings reveal a trade-off between latency and data rate driven by two basic algorithms: compound codes reduce latency at the cost of data rates, while channel estimation enhances data rates at the cost of latency.

arXiv:2411.10259•IEEE World Forum on Internet of Things (WF-IoT)•Nov 10, 2024•0 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

Private Communication over a Bosonic Compound Channel

Florian Seitz, Matteo Rosati, M. A. Vázquez‐Castro +1 more

It is a common belief that quantum key distribution systems are the one and only information-theoretically secure physical layer security protocol that enables secure data transmission without a need for the legitimate parties to have any channel knowledge. It is also known that this high security profile results in severe rate restrictions for the parties utilizing the quantum key distribution systems. This observation raises the question of whether quantifying the level of ignorance of the legitimate parties with regard to the channel parameters may enable us to navigate the large gray zone between insecure but highly performant systems on the one side and perfectly secure but highly non-performant systems on the other side. Indeed, by proving a capacity formula for the bosonic compound wiretap channel using the binary phase shift keying alphabet, we are able to quantify in this work exactly how channel uncertainty penalizes data transmission rates.

arXiv:2411.10292•Nov 15, 2024•1 citation

Quantum communication over bandwidth-and-time-limited channels

Aditya Gandotra, Zhaoyou Wang, Aashish A. Clerk +1 more

Standard communication systems have transmission spectra that characterize their ability to perform frequency multiplexing over a finite bandwidth. Realistic quantum signals in quantum communication systems like transducers are inherently limited in time due to intrinsic decoherence and finite latency, which hinders the direct implementation of frequency-multiplexed encoding. We investigate quantum channel capacities for bandwidth-and-time-limited (BTL) channels to establish the optimal communication strategy in a realistic setting. For pure-loss bosonic channels, we derive analytical solutions of the optimal encoding and decoding modes for Lorentzian and box transmission spectra, along with numerical solutions for various other transmissions. Our findings reveal a general feature of sequential activation of quantum channels as the input signal duration increases, as well as the existence of optimal signal length for scenarios where only a limited number of channels are in use.

arXiv:2502.08831•Physical Review A•Feb 23, 2026•5 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

Quantum trade-off coding for bosonic communication

Mark M. Wilde, Patrick M. Hayden, Saikat Guha

The trade-off capacity region of a quantum channel characterizes the optimal net rates at which a sender can communicate classical, quantum, and entangled bits to a receiver by exploiting many independent uses of the channel, along with the help of the same resources. Similarly, one can consider a trade-off capacity region when the noiseless resources are public, private, and secret-key bits. We identified [see Wilde, Hayden, and Guha, Phys. Rev. Lett. 108, 140501 (2012)] these trade-off rate regions for the pure-loss bosonic channel and proved that they are optimal provided that a long-standing minimum-output entropy conjecture is true. Additionally, we showed that the performance gains of a trade-off coding strategy when compared to a time-sharing strategy can be quite significant. In this paper, we provide detailed derivations of the results announced there, and we extend the application of these ideas to thermal-noise and amplifying bosonic channels. We also derive a ``rule of thumb'' for trade-off coding, which determines how to allocate photons in a coding strategy if a large mean photon number is available at the channel input. Our results on the amplifying bosonic channel also apply to the ``Unruh channel'' considered in the context of relativistic quantum information theory.

arXiv:1105.0119•Physical Review A•Dec 6, 2012•56 citations
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.
Low latency and high data rate performance are essential in wireless communication systems. This paper explores trade-offs between latency and data rates for optical wireless communication. We introduce a latency-optimized model utilizing compound codes as one corner case and a data rate-optimized model employing channel estimation via pilot signals and feedback before data transmission. Trade-offs between the two extremes are displayed. Most importantly, we detail operating points that can only be reached when the receiver side of the link employs optimal quantum measurement strategies. Furthermore, we propose an IoT application in a robot factory as an example scenario. Our findings reveal a trade-off between latency and data rate driven by two basic algorithms: compound codes reduce latency at the cost of data rates, while channel estimation enhances data rates at the cost of latency.
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.
It is a common belief that quantum key distribution systems are the one and only information-theoretically secure physical layer security protocol that enables secure data transmission without a need for the legitimate parties to have any channel knowledge. It is also known that this high security profile results in severe rate restrictions for the parties utilizing the quantum key distribution systems. This observation raises the question of whether quantifying the level of ignorance of the legitimate parties with regard to the channel parameters may enable us to navigate the large gray zone between insecure but highly performant systems on the one side and perfectly secure but highly non-performant systems on the other side. Indeed, by proving a capacity formula for the bosonic compound wiretap channel using the binary phase shift keying alphabet, we are able to quantify in this work exactly how channel uncertainty penalizes data transmission rates.
Standard communication systems have transmission spectra that characterize their ability to perform frequency multiplexing over a finite bandwidth. Realistic quantum signals in quantum communication systems like transducers are inherently limited in time due to intrinsic decoherence and finite latency, which hinders the direct implementation of frequency-multiplexed encoding. We investigate quantum channel capacities for bandwidth-and-time-limited (BTL) channels to establish the optimal communication strategy in a realistic setting. For pure-loss bosonic channels, we derive analytical solutions of the optimal encoding and decoding modes for Lorentzian and box transmission spectra, along with numerical solutions for various other transmissions. Our findings reveal a general feature of sequential activation of quantum channels as the input signal duration increases, as well as the existence of optimal signal length for scenarios where only a limited number of channels are in use.
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.
The trade-off capacity region of a quantum channel characterizes the optimal net rates at which a sender can communicate classical, quantum, and entangled bits to a receiver by exploiting many independent uses of the channel, along with the help of the same resources. Similarly, one can consider a trade-off capacity region when the noiseless resources are public, private, and secret-key bits. We identified [see Wilde, Hayden, and Guha, Phys. Rev. Lett. 108, 140501 (2012)] these trade-off rate regions for the pure-loss bosonic channel and proved that they are optimal provided that a long-standing minimum-output entropy conjecture is true. Additionally, we showed that the performance gains of a trade-off coding strategy when compared to a time-sharing strategy can be quite significant. In this paper, we provide detailed derivations of the results announced there, and we extend the application of these ideas to thermal-noise and amplifying bosonic channels. We also derive a ``rule of thumb'' for trade-off coding, which determines how to allocate photons in a coding strategy if a large mean photon number is available at the channel input. Our results on the amplifying bosonic channel also apply to the ``Unruh channel'' considered in the context of relativistic quantum information theory.