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:1202.1126

Private-Capacity Bounds for Bosonic Wiretap Channels

Ligong Wang, Jeffrey H. Shapiro, Nivedita Chandrasekaran, Gregory W. Wornell

Published Feb 6, 2012• 3 citations
arXivHTMLPDF

Abstract

We prove an upper bound on the private capacity of the single-mode noiseless bosonic wiretap channel. Combined with a previous lower bound, we obtain the low photon-number asymptotic expression for the private capacity. We then show that the multiple-mode noiseless bosonic wiretap channel is equivalent to parallel single-mode channels, hence the single-mode bounds can be applied. Finally, we consider multiple-spatial-mode propagation through atmospheric turbulence, and derive a private-capacity lower bound that only requires second moments of the channel matrix.

DOI
10.48550/arxiv.1202.1126

Related papers

On the capacity of bosonic channels

Christopher Blake

The capacity of the bosonic channel with additive Gaussian noise is unknown, but there is a known lower bound that is conjectured to be the capacity. We have quantified the gap that exists between this known achievable rate and rates achievable by the known methods of detection including direct, heterodyne, and homodyne detection. We have also quantified these capacities in the case of multiple independent spatial modes in terms of spectral and photon efficiency. Furthermore, we have considered the ergodic and outage capacities of fad-ing channel models for far-field and near-field propagation through atmospheric turbulence. For the far field, good models for the transmissivity statistics are known. For the near field we establish bounds on these capacities, and we show that these bounds are reasonably tight. Finally, we extend the results for ergodic capacity to the case of multiple spatial modes where a turbulent atmosphere results in crosstalk between different spatial modes.

•Jan 1, 2011•1 citation

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•1 citation

Bounding the energy-constrained quantum and private capacities of bosonic thermal channels.

Kunal Sharma, Mark M. Wilde, Sushovit Adhikari +1 more

We establish three different upper bounds on the energy-constrained quantum and private capacities of bosonic thermal channels. The first upper which we call the bound, is obtained by decomposing a thermal channel as a pure-loss channel followed by a quantum-limited amplifier channel. We prove that the data-processing can be at most 1.45 bits larger than a known lower on these capacities of the thermal channel. The other two upper bounds, which we call the bound and the bound, are established using the notion of approximate degradability along with energy constraints. A comparison of these three bounds shows that the data-processing is near to a known lower for both low and high thermal noise and is very near to the $\varepsilon$-close-degradable only for low thermal noise. Moreover, for certain parameter regimes, we show that the $\varepsilon$-degradable is tighter than all other bounds. All three upper bounds are very near to a known lower for the case of low thermal noise and high transmissivity. We also find improved achievable rates of private communication through bosonic thermal channels, by employing coding schemes that make use of displaced thermal states. We end by proving that an optimal Gaussian input state for the energy-constrained, generalized channel divergence of two particular Gaussian channels is the two-mode squeezed vacuum state that saturates the energy constraint. What remains open for several interesting channel divergences, such as the diamond norm or the R\'enyi channel divergence, is to determine whether, among all input states, a Gaussian state is optimal.

•Aug 24, 2017•8 citations

Quantum limits on bosonic communication rates

Carlton M. Caves, P. D. Drummond

The capacity $C$ of a communication channel is the maximum rate at which information can be transmitted without error from the channel's input to its output. The authors review quantum limits on the capacity that can be achieved with linear bosonic communication channels that have input power $P$. The limits arise ultimately from the Einstein relation that a field quantum at frequency $f$ has energy $E=hf$. A single linear bosonic channel corresponds to a single transverse mode of the bosonic field---i.e., to a particular spatial dependence in the plane orthogonal to the propagation direction and to a particular spin state or polarization. For a single channel the maximum communication rate is ${C}_{\mathrm{WB}}=(\frac{\ensuremath{\pi}}{\mathrm{ln}2})\sqrt{\frac{2P}{3h}}$ bits/s. This maximum rate can be achieved by a "number-state channel," in which information is encoded in the number of quanta in the bosonic field and in which this information is recovered at the output by counting quanta. Derivations of the optimum capacity ${C}_{\mathrm{WB}}$ are reviewed. Until quite recently all derivations assumed, explicitly or implicitly, a number-state channel. They thus left open the possibility that other techniques for encoding information on the bosonic field, together with other ways of detecting the field at the output, might lead to a greater communication rate. The authors present their own general derivation of the single-channel capacity upper bound, which applies to any physically realizable technique for encoding information on the bosonic field and to any physically realizable detection scheme at the output. They also review the capacities of coherent communication channels that encode information in coherent states and in quadrature-squeezed states. A three-dimensional bosonic channel can employ many transverse modes as parallel single channels. An upper bound on the information flux that can be transferred down parallel bosonic channels is derived.

Reviews of Modern Physics•Apr 1, 1994•427 citations

Lower Bounding the Secret Key Capacity of Bosonic Gaussian Channels via Optimal Gaussian Measurements

Giuseppe Ortolano, Stefano Pirandola, Leonardo Banchi

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate capacity of the channel. We focus on the class of phase-insensitive Gaussian channels. For the thermal-loss and thermal amplification channels, our results demonstrate the optimality, within the constraints of our analysis, of previously proposed protocols, while also providing a significantly simplified formula for their performance evaluation. For the added noise channel, our rate provides a better lower bound than any previously known.

quant-pharXiv:2512.15502•Physical Review A•Dec 18, 2025•6 citations

Quantum Wiretap Channel Coding Assisted by Noisy Correlation

Minglai Cai, Andreas Winter

We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and outputs. An extreme case is maximal entanglement or a secret key between Alice and Bob, both of which would allow for one-time padding the message. But here both the wiretap channel and the shared state are general. In the other extreme case that the state is trivial, we recover the wiretap channel and its private capacity [N. Cai, A. Winter and R. W. Yeung, Probl. Inform. Transm. 40(4):318-336, 2004]. We show how to use the given resource state to build a code for secret classical communication. Our main result is a lower bound on the assisted private capacity, which asymptotically meets the multi-letter converse and which encompasses all sorts of previous results as special cases.

arXiv:2402.13194•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•2 citations
We prove an upper bound on the private capacity of the single-mode noiseless bosonic wiretap channel. Combined with a previous lower bound, we obtain the low photon-number asymptotic expression for the private capacity. We then show that the multiple-mode noiseless bosonic wiretap channel is equivalent to parallel single-mode channels, hence the single-mode bounds can be applied. Finally, we consider multiple-spatial-mode propagation through atmospheric turbulence, and derive a private-capacity lower bound that only requires second moments of the channel matrix.
The capacity of the bosonic channel with additive Gaussian noise is unknown, but there is a known lower bound that is conjectured to be the capacity. We have quantified the gap that exists between this known achievable rate and rates achievable by the known methods of detection including direct, heterodyne, and homodyne detection. We have also quantified these capacities in the case of multiple independent spatial modes in terms of spectral and photon efficiency. Furthermore, we have considered the ergodic and outage capacities of fad-ing channel models for far-field and near-field propagation through atmospheric turbulence. For the far field, good models for the transmissivity statistics are known. For the near field we establish bounds on these capacities, and we show that these bounds are reasonably tight. Finally, we extend the results for ergodic capacity to the case of multiple spatial modes where a turbulent atmosphere results in crosstalk between different spatial modes.
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 three different upper bounds on the energy-constrained quantum and private capacities of bosonic thermal channels. The first upper which we call the bound, is obtained by decomposing a thermal channel as a pure-loss channel followed by a quantum-limited amplifier channel. We prove that the data-processing can be at most 1.45 bits larger than a known lower on these capacities of the thermal channel. The other two upper bounds, which we call the bound and the bound, are established using the notion of approximate degradability along with energy constraints. A comparison of these three bounds shows that the data-processing is near to a known lower for both low and high thermal noise and is very near to the ε\varepsilonε-close-degradable only for low thermal noise. Moreover, for certain parameter regimes, we show that the ε\varepsilonε-degradable is tighter than all other bounds. All three upper bounds are very near to a known lower for the case of low thermal noise and high transmissivity. We also find improved achievable rates of private communication through bosonic thermal channels, by employing coding schemes that make use of displaced thermal states. We end by proving that an optimal Gaussian input state for the energy-constrained, generalized channel divergence of two particular Gaussian channels is the two-mode squeezed vacuum state that saturates the energy constraint. What remains open for several interesting channel divergences, such as the diamond norm or the R\'enyi channel divergence, is to determine whether, among all input states, a Gaussian state is optimal.
The capacity CCC of a communication channel is the maximum rate at which information can be transmitted without error from the channel's input to its output. The authors review quantum limits on the capacity that can be achieved with linear bosonic communication channels that have input power PPP. The limits arise ultimately from the Einstein relation that a field quantum at frequency fff has energy E=hfE=hfE=hf. A single linear bosonic channel corresponds to a single transverse mode of the bosonic field---i.e., to a particular spatial dependence in the plane orthogonal to the propagation direction and to a particular spin state or polarization. For a single channel the maximum communication rate is ${C}_{\mathrm{WB}}=(\frac{\ensuremath{\pi}}{\mathrm{ln}2})\sqrt{\frac{2P}{3h}}$ bits/s. This maximum rate can be achieved by a "number-state channel," in which information is encoded in the number of quanta in the bosonic field and in which this information is recovered at the output by counting quanta. Derivations of the optimum capacity CWB{C}_{\mathrm{WB}}CWB​ are reviewed. Until quite recently all derivations assumed, explicitly or implicitly, a number-state channel. They thus left open the possibility that other techniques for encoding information on the bosonic field, together with other ways of detecting the field at the output, might lead to a greater communication rate. The authors present their own general derivation of the single-channel capacity upper bound, which applies to any physically realizable technique for encoding information on the bosonic field and to any physically realizable detection scheme at the output. They also review the capacities of coherent communication channels that encode information in coherent states and in quadrature-squeezed states. A three-dimensional bosonic channel can employ many transverse modes as parallel single channels. An upper bound on the information flux that can be transferred down parallel bosonic channels is derived.
We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate capacity of the channel. We focus on the class of phase-insensitive Gaussian channels. For the thermal-loss and thermal amplification channels, our results demonstrate the optimality, within the constraints of our analysis, of previously proposed protocols, while also providing a significantly simplified formula for their performance evaluation. For the added noise channel, our rate provides a better lower bound than any previously known.
We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and outputs. An extreme case is maximal entanglement or a secret key between Alice and Bob, both of which would allow for one-time padding the message. But here both the wiretap channel and the shared state are general. In the other extreme case that the state is trivial, we recover the wiretap channel and its private capacity [N. Cai, A. Winter and R. W. Yeung, Probl. Inform. Transm. 40(4):318-336, 2004]. We show how to use the given resource state to build a code for secret classical communication. Our main result is a lower bound on the assisted private capacity, which asymptotically meets the multi-letter converse and which encompasses all sorts of previous results as special cases.