English
Related papers

Related papers: Additive invariants on quantum channels and applic…

200 papers

This article provides an elementary introduction to Gaussian channels and their capacities. We review results on the classical, quantum, and entanglement assisted capacities and discuss related entropic quantities as well as additivity…

Quantum Physics · Physics 2009-05-15 J. Eisert , M. M. Wolf

We prove the quantum conditional Entropy Power Inequality for quantum additive noise channels. This inequality lower bounds the quantum conditional entropy of the output of an additive noise channel in terms of the quantum conditional…

Quantum Physics · Physics 2018-12-05 Giacomo De Palma , Stefan Huber

Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…

Quantum Physics · Physics 2018-08-09 Hamza Fawzi , Omar Fawzi

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 show that under a certain condition of local commutativity the minimum von-Neumann entropy output of a quantum channel is locally additive. We also show that local minima of the 2-norm entropy functions are closed under tensor products…

Mathematical Physics · Physics 2013-08-15 Shmuel Friedland , Gilad Gour , Aidan Roy

Degradable quantum channels are an important class of completely positive trace-preserving maps. Among other properties, they offer a single-letter formula for the quantum and the private classical capacity and are characterized by the fact…

Quantum Physics · Physics 2017-11-23 David Sutter , Volkher B. Scholz , Andreas Winter , Renato Renner

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

Hastings recently provided a proof of the existence of channels which violate the additivity conjecture for minimal output entropy. In this paper we present an expanded version of Hastings' proof. In addition to a careful elucidation of the…

Quantum Physics · Physics 2014-11-27 Motohisa Fukuda , Christopher King , David Moser

Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum…

Quantum Physics · Physics 2008-11-14 Shengjun Wu , Xuemei Chen

We argue that a fundamental (conjectured) property of memoryless quantum channels, namely the strong superadditivity, is intimately related to the decreasing property of the quantum relative entropy. Using the latter we first give, for a…

Quantum Physics · Physics 2009-07-09 Grigori G. Amosov , Stefano Mancini

Invariance entropy is a measure for the smallest data rate in a noiseless digital channel above which a controller that only receives state information through this channel is able to render a given subset of the state space invariant. In…

Optimization and Control · Mathematics 2018-05-10 Christoph Kawan , Adriano Da Silva

A multiplicativity conjecture for quantum communication channels is formulated, validity of which for the values of parameter $p$ close to 1 is related to the solution of the fundamental problem of additivity of the channel capacity in…

Mathematical Physics · Physics 2007-05-23 G. G. Amosov , 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

We describe the class (semigroup) of quantum channels mapping states with finite entropy into states with finite entropy. We show, in particular, that this class is naturally decomposed into three convex subclasses, two of them are closed…

Quantum Physics · Physics 2021-09-28 M. E. Shirokov , A. V. Bulinski

The Amosov-Holevo-Werner conjecture implies the additivity of the minimum Re'nyi entropies at the output of a channel. The conjecture is proven true for all Re'nyi entropies of integer order greater than two in a class of Gaussian bosonic…

Quantum Physics · Physics 2009-11-10 Vittorio Giovannetti , Seth Lloyd

We obtain two new additivity results of quantum channels. The first one is the additivity of the channel R\'enyi information associated with the sandwiched R\'enyi divergence of order $\alpha\in[\frac{1}{2},1)$. To prove this, we introduce…

Quantum Physics · Physics 2026-03-18 Ke Li , Quanhua Xu

Quantum channel capacities give the fundamental performance limits for information flow over a communication channel. However, the prevalence of superadditivity is a major obstacle to understanding capacities, both quantitatively and…

Quantum Physics · Physics 2025-09-10 Graeme Smith , Peixue Wu

We generalize our results in paper I in this series to quantum channels between general v. Neumann algebras, proving the approximate recoverability of states which undergo a small change in relative entropy through the channel. To this end,…

Quantum Physics · Physics 2020-10-13 Thomas Faulkner , Stefan Hollands

We give an elementary self-contained proof that the minimal entropy output of arbitrary products of channels $\rho \mapsto \frac{1}{d-1}(1-\rho^T)$ is additive.

Quantum Physics · Physics 2007-05-23 R. Alicki , M. Fannes

It is shown that given two copies of a q-ary input channel $W$, where q is prime, it is possible to create two channels $W^-$ and $W^+$ whose symmetric capacities satisfy $I(W^-)\le I(W)\le I(W^+)$, where the inequalities are strict except…

Information Theory · Computer Science 2016-11-18 Eren Sasoglu