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:1812.01423 · Annals of Physics

Universal upper bounds for Gaussian information capacity

Kabgyun Jeong, Hun Hee Lee, Youngrong Lim

Published May 11, 2019• 5 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2019.04.009

Related papers

Upper bounds on the private capacity for bosonic Gaussian channels

Kabgyun Jeong

arXiv:2001.01179•Physics Letters A•Jul 13, 2020•4 citations

On the fading Gaussian wiretap channel with statistical channel state information at transmitter

Pin-Hsun Lin, Eduard Axel Jorswieck

In this paper we partially characterize the relation between the ergodic secrecy capacity of fast fading wiretap channels and the stochastic orders including the usual stochastic orders, the convex orders, and the increasing convex orders, of the main and eavesdropper's channels. We assume that there is only statistical channel state information of both channels at transmitter and both fading channels can be with arbitrary distributions. We derive the sufficient conditions for the existence of the positive ergodic secrecy capacity under these three orders. For more general orders we also derive capacity lower and upper bounds. To achieve it, we apply the concept of channel enhancement to the continuous fading wiretap channel and derive an upper bound. Motivated by the upper bound, we also derive the lower bound of the ergodic secrecy capacity by the layered signaling. Finally numerical results show that under Nakagami-m channels, the proposed achievable scheme outperforms Gaussian signaling in several cases. More specifically, the proposed scheme may result in positive secrecy rate while Gaussian signaling only lead to zero. Thus when we apply the proposed scheme to the wireless network, the connectivity can be significantly improved.

IEEE Conference on Communications and Network Security•Oct 1, 2014•5 citations

On gaussian feedback capacity

Amir Dembo

IEEE Information Theory Workshop (ITW)•Aug 24, 2005•7 citations

Mathematical Model of Quantum Channel Capacity

Mouli Chakraborty, Harun Šiljak, Indrakshi Dey +1 more

In this article, we are proposing a closed-form solution for the capacity of the single quantum channel. The Gaussian distributed input has been considered for the analytical calculation of the capacity. In our previous couple of papers, we invoked models for joint quantum noise and the corresponding received signals; in this current research, we proved that these models are Gaussian mixtures distributions. In this paper, we showed how to deal with both of cases, namely (I)the Gaussian mixtures distribution for scalar variables and (II) the Gaussian mixtures distribution for random vectors. Our target is to calculate the entropy of the joint noise and the entropy of the received signal in order to calculate the capacity expression of the quantum channel. The main challenge is to work with the function type of the Gaussian mixture distribution. The entropy of the Gaussian mixture distributions cannot be calculated in the closed-form solution due to the logarithm of a sum of exponential functions. As a solution, we proposed a lower bound and a upper bound for each of the entropies of joint noise and the received signal, and finally upper inequality and lower inequality lead to the upper bound for the mutual information and hence the maximum achievable data rate as the capacity. In this paper reader will able to visualize an closed-form capacity experssion which make this paper distinct from our previous works. These capacity experssion and coresses ponding bounds are calculated for both the cases: the Gaussian mixtures distribution for scalar variables and the Gaussian mixtures distribution for random vectors as well.

arXiv:2302.04873•Feb 9, 2023•0 citations

Bounds for smooth min- and max-entropy

Yuan Zhai, Bo Yang, Zhengjun Xi

Quantum Information Processing•May 19, 2023•1 citation

Universal quantum limits on single-channel information, entropy, and heat flow

M. P. Blencowe, Vincenzo Vitelli

We show that the recently discovered universal upper bound on the thermal conductance of a single channel comprising particles obeying arbitrary fractional statistics is in fact a consequence of a more general universal upper bound, involving the averaged entropy and energy currents of a single channel connecting heat reservoirs with arbitrary temperatures and chemical potentials. The latter upper bound in turn leads, via Holevo's theorem, to a universal (i.e., statistics-independent) upper bound on the optimum capacity for classical information transmission down a single, wideband quantum channel.

arXiv:quant-ph/0001007•Physical Review A•Oct 12, 2000•45 citations
In this paper we partially characterize the relation between the ergodic secrecy capacity of fast fading wiretap channels and the stochastic orders including the usual stochastic orders, the convex orders, and the increasing convex orders, of the main and eavesdropper's channels. We assume that there is only statistical channel state information of both channels at transmitter and both fading channels can be with arbitrary distributions. We derive the sufficient conditions for the existence of the positive ergodic secrecy capacity under these three orders. For more general orders we also derive capacity lower and upper bounds. To achieve it, we apply the concept of channel enhancement to the continuous fading wiretap channel and derive an upper bound. Motivated by the upper bound, we also derive the lower bound of the ergodic secrecy capacity by the layered signaling. Finally numerical results show that under Nakagami-m channels, the proposed achievable scheme outperforms Gaussian signaling in several cases. More specifically, the proposed scheme may result in positive secrecy rate while Gaussian signaling only lead to zero. Thus when we apply the proposed scheme to the wireless network, the connectivity can be significantly improved.
In this article, we are proposing a closed-form solution for the capacity of the single quantum channel. The Gaussian distributed input has been considered for the analytical calculation of the capacity. In our previous couple of papers, we invoked models for joint quantum noise and the corresponding received signals; in this current research, we proved that these models are Gaussian mixtures distributions. In this paper, we showed how to deal with both of cases, namely (I)the Gaussian mixtures distribution for scalar variables and (II) the Gaussian mixtures distribution for random vectors. Our target is to calculate the entropy of the joint noise and the entropy of the received signal in order to calculate the capacity expression of the quantum channel. The main challenge is to work with the function type of the Gaussian mixture distribution. The entropy of the Gaussian mixture distributions cannot be calculated in the closed-form solution due to the logarithm of a sum of exponential functions. As a solution, we proposed a lower bound and a upper bound for each of the entropies of joint noise and the received signal, and finally upper inequality and lower inequality lead to the upper bound for the mutual information and hence the maximum achievable data rate as the capacity. In this paper reader will able to visualize an closed-form capacity experssion which make this paper distinct from our previous works. These capacity experssion and coresses ponding bounds are calculated for both the cases: the Gaussian mixtures distribution for scalar variables and the Gaussian mixtures distribution for random vectors as well.
We show that the recently discovered universal upper bound on the thermal conductance of a single channel comprising particles obeying arbitrary fractional statistics is in fact a consequence of a more general universal upper bound, involving the averaged entropy and energy currents of a single channel connecting heat reservoirs with arbitrary temperatures and chemical potentials. The latter upper bound in turn leads, via Holevo's theorem, to a universal (i.e., statistics-independent) upper bound on the optimum capacity for classical information transmission down a single, wideband quantum channel.