English
Related papers

Related papers: Additivity for transpose depolarizing channels

200 papers

We study subadditivity of the minimum output entropy ($H_{min}$) of quantum multiple access channels (MACs). We provide an example of violation of the additivity theorem for $H_{min}$ known in classical information theory. Our result is…

Quantum Physics · Physics 2012-03-14 Lukasz Czekaj

Existing polarization theories have mostly been concerned with Shannon's information measures, such as Shannon entropy and mutual information, and some related measures such as the Bhattacharyya parameter. In this work, we extend…

Information Theory · Computer Science 2019-07-16 Mengfan Zheng , Ling Liu , Cong Ling

Motivated by on-chip communication, a channel model is proposed where the variance of the additive noise depends on the weighted sum of the past channel input powers. For this channel, an expression for the capacity per unit cost is…

Information Theory · Computer Science 2007-07-13 Tobias Koch , Amos Lapidoth , Paul P. Sotiriadis

The von Neumann entropy at the output of a bosonic channel with thermal noise is analyzed. Coherent-state inputs are conjectured to minimize this output entropy. Physical and mathematical evidence in support of the conjecture is provided. A…

Quantum Physics · Physics 2009-11-10 Vittorio Giovannetti , Saikat Guha , Seth Lloyd , Lorenzo Maccone , Jeffrey H. Shapiro

Shannon's entropy power inequality (EPI) can be viewed as a statement of concavity of an entropic function of a continuous random variable under a scaled addition rule: $$f(\sqrt{a}\,X + \sqrt{1-a}\,Y) \ge a f(X) + (1-a) f(Y) \quad \forall…

Quantum Physics · Physics 2016-06-06 Koenraad Audenaert , Nilanjana Datta , Maris Ozols

We show that for log-concave real random variables with fixed variance the Shannon differential entropy is minimized for an exponential random variable. We apply this result to derive upper bounds on capacities of additive noise channels…

Probability · Mathematics 2024-03-19 James Melbourne , Piotr Nayar , Cyril Roberto

This paper first focuses on deriving an alternative approach for proving an extremal entropy inequality (EEI), originally presented in [11]. The proposed approach does not rely on the channel enhancement technique, and has the advantage…

Information Theory · Computer Science 2012-11-21 Sangwoo Park , Erchin Serpedin , Khalid Qaraqe

A conjecture arising naturally in the investigation of additivity of classical information capacity of quantum channels states that the maximal purity of outputs from a quantum channel, as measured by the p-norm, should be multiplicative…

Quantum Physics · Physics 2015-06-26 R. F. Werner , A. S. Holevo

In this paper, we compute the exact values of the minimum output entropy and the completely bounded minimal entropy of very large classes of quantum channels acting on matrix algebras $\mathrm{M}_n$. Our new and simple approach relies on…

Operator Algebras · Mathematics 2025-02-06 Cédric Arhancet

We explore complementarity between output and environment of a quantum channel (or, more generally, CP map), making an observation that the output purity characteristics for complementary CP maps coincide. Hence, validity of the…

Quantum Physics · Physics 2007-07-05 A. S. Holevo

We introduce an quantum entropy for bimodule quantum channels on finite von Neumann algebras, generalizing the remarkable Pimsner-Popa entropy. The relative entropy for Fourier multipliers of bimodule quantum channels establishes an upper…

Operator Algebras · Mathematics 2024-01-01 Zishuo Zhao

The chain rule for the classical relative entropy ensures that the relative entropy between probability distributions on multipartite systems can be decomposed into a sum of relative entropies of suitably chosen conditional distributions on…

Quantum Physics · Physics 2020-03-18 Kun Fang , Omar Fawzi , Renato Renner , David Sutter

Entropy comparison inequalities are obtained for the differential entropy $h(X+Y)$ of the sum of two independent random vectors $X,Y$, when one is replaced by a Gaussian. For identically distributed random vectors $X,Y$, these are closely…

Information Theory · Computer Science 2024-07-24 Lampros Gavalakis , Ioannis Kontoyiannis , Mokshay Madiman

It is known that the additivity conjecture of Holevo capacity, output minimum entoropy, and the entanglement of formation (EoF), are equivalent with each other. Among them, the output minimum entropy is simplest, and hence many researchers…

Quantum Physics · Physics 2009-11-11 Keiji Matsumoto

Quantum channels represent a broad spectrum of operations crucial to quantum information theory, encompassing everything from the transmission of quantum information to the manipulation of various resources. In the domain of states, the…

Quantum Physics · Physics 2025-05-15 Gilad Gour , Doyeong Kim , Takla Nateeboon , Guy Shemesh , Goni Yoeli

Many important properties of quantum channels are quantified by means of entropic functionals. Characteristics of such a kind are closely related to different representations of a quantum channel. In the Jamio{\l}kowski-Choi representation,…

Quantum Physics · Physics 2013-07-23 Alexey E. Rastegin

The quantum capacity of degradable quantum channels has been proven to be additive. On the other hand, there is no general rule for the behavior of quantum capacity for non-degradable quantum channels. We introduce the set of partially…

Quantum Physics · Physics 2016-11-15 Laszlo Gyongyosi

This note has been withdrawn by the author as the more complete result was recently proved by A.Quas and Y.Peres

Information Theory · Computer Science 2009-01-30 Pavel Chigansky

This study examines multilevel channel polarization for a certain class of erasure channels that the input alphabet size is an arbitrary composite number. We derive limiting proportions of partially noiseless channels for such a class. The…

Information Theory · Computer Science 2020-08-24 Yuta Sakai , Ken-ichi Iwata , Hiroshi Fujisaki

This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and…

Information Theory · Computer Science 2025-05-28 Priyanka Patel , Francesc Molina , Albert Guillén i Fàbregas
‹ Prev 1 4 5 6 7 8 10 Next ›