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

Strong converse rates for classical communication over thermal and additive noise bosonic channels

Bhaskar Roy Bardhan, Mark M. Wilde

Published Feb 5, 2014• 14 citations
arXivHTMLPDF

Abstract

We prove that several known upper bounds on the classical capacity of thermal and additive noise bosonic channels are actually strong converse rates. Our results strengthen the interpretation of these upper bounds, in the sense that we now know that the probability of correctly decoding a classical message rapidly converges to 0 in the limit of many channel uses if the communication rate exceeds these upper bounds. In order for these theorems to hold, we need to impose a maximum photon number constraint on the states input to the channel (the strong converse property need not hold if there is only a mean photon number constraint). Our first theorem demonstrates that Koenig and Smith's upper bound on the classical capacity of the thermal bosonic channel is a strong converse rate, and we prove this result by utilizing the structural decomposition of a thermal channel into a pure-loss channel followed by an amplifier channel. Our second theorem demonstrates that Giovannetti et al.'s upper bound on the classical capacity of a thermal bosonic channel corresponds to a strong converse rate, and we prove this result by relating the success probability to the rate, the effective dimension of the output space, and the purity of the channel as measured by the R\'enyi collision entropy. Finally, we use similar techniques to prove that similar previously known upper bounds on the classical capacity of an additive noise bosonic channel correspond to strong converse rates.

DOI
10.1103/physreva.89.022302

Related papers

Strong converse for the capacity of quantum Gaussian channels

Bhaskar Roy Bardhan, Raúl García−Patrón, Mark M. Wilde +1 more

We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bosonic Gaussian channels, when imposing a maximum photon number constraint on the inputs of the channel. This class is a natural extension of classical continuous Gaussian channels, and the well studied pure-loss, thermal, additive noise, and amplifier channels are all in this class of channels. The statement of the strong converse theorem is that the probability of correctly decoding a classical message rapidly converges to zero in the limit of many channel uses if the communication rate exceeds the classical capacity. We prove this theorem by relating the success probability of any code with its rate of data transmission, the effective dimension of the channel output space, and the purity of the channel as quantified by the minimum output entropy. Our result bolsters the understanding of the classical capacity of these channels by establishing it as a sharp dividing line between possible and impossible communication rates over them.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•2 citations

Strong converse for the classical capacity of the pure-loss bosonic channel

Mark M. Wilde, Andreas Winter

This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [1]. In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean photon number constraint on the channel inputs. That is, if we demand that the mean number of photons at the channel input cannot be any larger than some positive number NS , then it is possible to respect this constraint with a code that operates at a rate g ( ηNS /(1- p )) where p is the code error probability, η is the channel transmissivity, and g ( x ) is the entropy of a bosonic thermal state with mean photon number x . Then we prove that a strong converse theorem holds for the classical capacity of this channel (that such a rate-error trade-off cannot occur) if one instead demands for a maximum photon number constraint, in such a way that mostly all of the “shadow” of the average density operator for a given code is required to be on a subspace with photon number no larger than nNS , so that the shadow outside this subspace vanishes as the number n of channel uses becomes large. Finally, we prove that a small modification of the well-known coherent-state coding scheme meets this more demanding constraint.

arXiv:1308.6732•Problems of Information Transmission•Apr 1, 2014•22 citations

Strong Converse for the Classical Capacity of Optical Quantum Communication Channels

Bhaskar Roy Bardhan, Raúl García−Patrón, Mark M. Wilde +1 more

We establish the classical capacity of optical quantum channels as a sharp transition between two regimes-one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly decoding a classical message converges exponentially fast to zero if the communication rate exceeds the classical capacity. This result is obtained by proving a strong converse theorem for the classical capacity of all phase-insensitive bosonic Gaussian channels, a well-established model of optical quantum communication channels, such as lossy optical fibers, amplifier, and free-space communication. The theorem holds under a particular photon-number occupation constraint, which we describe in detail in this paper. Our result bolsters the understanding of the classical capacity of these channels and opens the path to applications, such as proving the security of noisy quantum storage models of cryptography with optical links.

arXiv:1401.4161•IEEE Transactions on Information Theory•Feb 13, 2015•7 citations

Classical Capacity of Single-Mode Bosonic Gaussian Channels

Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti

The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number $N$ and allowed average decoding error $ε$ equals the vanishing-error capacity at mean photon number $N/(1-ε)$. Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.

quant-pharXiv:2610.22308•Oct 16, 2026•0 citations

Strong Converse for the Classical Capacity of Optical Quantum Communication Channels

Bhaskar Roy Bardhan, Raúl García−Patrón, Mark M. Wilde +1 more

We establish the classical capacity of optical quantum channels as a sharp transition between two regimes - one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly decoding a classical message converges exponentially fast to zero if the communication rate exceeds the classical capacity. This result is obtained by proving a strong converse theorem for the classical capacity of all phase-insensitive bosonic Gaussian channels, a well-established model of optical quantum communication channels, such as lossy optical fibers, amplifier, and free-space communication. The theorem holds under a particular photon-number occupation constraint, which we describe in detail in this paper. Our result bolsters the understanding of the classical capacity of these channels and opens the path to applications, such as proving the security of noisy quantum storage models of cryptography with optical links.

Civil War Book Review•Apr 1, 2015•5 citations

Strong converse bounds on the classical identification capacity of the qubit depolarizing channel

Liuhang Ye, Bjarne Bergh, Nilanjana Datta

A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an identification error necessarily converges to one. Converse bounds for identification are notoriously difficult to obtain for fully quantum channels. The only previously known converse bound, due to Atif, Pradhan and Winter [Int.~J.~Quantum Inf.~22(5):2440013, 2024], has the unsatisfactory feature of remaining strictly positive even for a completely noisy channel, for which identification is clearly impossible. We derive strong (and hence also weak) converse bounds, for the qubit depolarizing channel with noise parameter $p$, that vanish as $p\to 1$, thereby yielding the correct behavior in the completely noisy limit. Moreover, in the setting of simultaneous classical identification under the constraint of complete product measurements, our converse bound matches the corresponding achievability bound, and establishes that in this case the identification capacity equals the classical capacity of the channel.

quant-pharXiv:2603.29987•Apr 1, 2026•0 citations
We prove that several known upper bounds on the classical capacity of thermal and additive noise bosonic channels are actually strong converse rates. Our results strengthen the interpretation of these upper bounds, in the sense that we now know that the probability of correctly decoding a classical message rapidly converges to 0 in the limit of many channel uses if the communication rate exceeds these upper bounds. In order for these theorems to hold, we need to impose a maximum photon number constraint on the states input to the channel (the strong converse property need not hold if there is only a mean photon number constraint). Our first theorem demonstrates that Koenig and Smith's upper bound on the classical capacity of the thermal bosonic channel is a strong converse rate, and we prove this result by utilizing the structural decomposition of a thermal channel into a pure-loss channel followed by an amplifier channel. Our second theorem demonstrates that Giovannetti et al.'s upper bound on the classical capacity of a thermal bosonic channel corresponds to a strong converse rate, and we prove this result by relating the success probability to the rate, the effective dimension of the output space, and the purity of the channel as measured by the R'enyi collision entropy. Finally, we use similar techniques to prove that similar previously known upper bounds on the classical capacity of an additive noise bosonic channel correspond to strong converse rates.
We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bosonic Gaussian channels, when imposing a maximum photon number constraint on the inputs of the channel. This class is a natural extension of classical continuous Gaussian channels, and the well studied pure-loss, thermal, additive noise, and amplifier channels are all in this class of channels. The statement of the strong converse theorem is that the probability of correctly decoding a classical message rapidly converges to zero in the limit of many channel uses if the communication rate exceeds the classical capacity. We prove this theorem by relating the success probability of any code with its rate of data transmission, the effective dimension of the channel output space, and the purity of the channel as quantified by the minimum output entropy. Our result bolsters the understanding of the classical capacity of these channels by establishing it as a sharp dividing line between possible and impossible communication rates over them.
This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [1]. In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean photon number constraint on the channel inputs. That is, if we demand that the mean number of photons at the channel input cannot be any larger than some positive number NS , then it is possible to respect this constraint with a code that operates at a rate g ( ηNS /(1- p )) where p is the code error probability, η is the channel transmissivity, and g ( x ) is the entropy of a bosonic thermal state with mean photon number x . Then we prove that a strong converse theorem holds for the classical capacity of this channel (that such a rate-error trade-off cannot occur) if one instead demands for a maximum photon number constraint, in such a way that mostly all of the “shadow” of the average density operator for a given code is required to be on a subspace with photon number no larger than nNS , so that the shadow outside this subspace vanishes as the number n of channel uses becomes large. Finally, we prove that a small modification of the well-known coherent-state coding scheme meets this more demanding constraint.
We establish the classical capacity of optical quantum channels as a sharp transition between two regimes-one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly decoding a classical message converges exponentially fast to zero if the communication rate exceeds the classical capacity. This result is obtained by proving a strong converse theorem for the classical capacity of all phase-insensitive bosonic Gaussian channels, a well-established model of optical quantum communication channels, such as lossy optical fibers, amplifier, and free-space communication. The theorem holds under a particular photon-number occupation constraint, which we describe in detail in this paper. Our result bolsters the understanding of the classical capacity of these channels and opens the path to applications, such as proving the security of noisy quantum storage models of cryptography with optical links.
The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number NNN and allowed average decoding error εεε equals the vanishing-error capacity at mean photon number N/(1−ε)N/(1-ε)N/(1−ε). Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.
We establish the classical capacity of optical quantum channels as a sharp transition between two regimes - one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly decoding a classical message converges exponentially fast to zero if the communication rate exceeds the classical capacity. This result is obtained by proving a strong converse theorem for the classical capacity of all phase-insensitive bosonic Gaussian channels, a well-established model of optical quantum communication channels, such as lossy optical fibers, amplifier, and free-space communication. The theorem holds under a particular photon-number occupation constraint, which we describe in detail in this paper. Our result bolsters the understanding of the classical capacity of these channels and opens the path to applications, such as proving the security of noisy quantum storage models of cryptography with optical links.
A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an identification error necessarily converges to one. Converse bounds for identification are notoriously difficult to obtain for fully quantum channels. The only previously known converse bound, due to Atif, Pradhan and Winter [Int.~J.~Quantum Inf.~22(5):2440013, 2024], has the unsatisfactory feature of remaining strictly positive even for a completely noisy channel, for which identification is clearly impossible. We derive strong (and hence also weak) converse bounds, for the qubit depolarizing channel with noise parameter ppp, that vanish as p→1p\to 1p→1, thereby yielding the correct behavior in the completely noisy limit. Moreover, in the setting of simultaneous classical identification under the constraint of complete product measurements, our converse bound matches the corresponding achievability bound, and establishes that in this case the identification capacity equals the classical capacity of the channel.