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:1803.00470 · Journal of Mathematical Physics

The conditional entropy power inequality for quantum additive noise channels

Giacomo De Palma, Stefan Huber

Published Dec 1, 2018• 19 citations
arXivHTMLPDF

Abstract

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 entropies of the input state and the noise when they are conditionally independent given the memory. We also show that this conditional entropy power inequality is optimal in the sense that we can achieve equality asymptotically by choosing a suitable sequence of Gaussian input states. We apply the conditional entropy power inequality to find an array of information-theoretic inequalities for conditional entropies which are the analogs of inequalities which have already been established in the unconditioned setting. Furthermore, we give a simple proof of the convergence rate of the quantum Ornstein-Uhlenbeck semigroup based on entropy power inequalities.

DOI
10.1063/1.5027495

Related papers

The conditional entropy power inequality for Gaussian quantum states

Robert König

We propose a generalization of the quantum entropy power inequality involving condi-tional entropies. For the special case of Gaussian states, we give a proof based on perturba-tion theory for symplectic spectra. We discuss some implications for entanglement-assisted classical communication over additive bosonic noise channels. 1 Classical and quantum entropy-power inequalities The entropy power inequality, proposed by Shannon [27] and later established with increasing rigor by Stam [29] and Blachman [5], has become a fundamental tool in classical informa-tion theory. Shannon’s original application of the entropy power inequality is a lower bound on the capacity of an additive (but potentially non-Gaussian) noise channel [27, Theorem 18]. However, the usefulness of the entropy power inequality is especially evident in multi-terminal information theory. Among the most well-known applications are the characterization of the Gaussian broadcast channel by Bergman [4], the Gaussian two-description problem by Ozarow [25] and the quadratic Gaussian CEO problem by Oohama [24]. In these multi-user settings, Fano’s inequality by itself is insufficient to characterize different tradeoffs. A more recent application proposed by Liu and Viswanath [23] uses entropy power inequalities to solve certain optimization problems. The entropy power inequality lower bounds the differential entropy of the convolution of two independent random variables X, Y taking values in Rn. Its covariance-preserving version states that H( λX + 1 − λY) ≥ λH(X) + (1 − λ)H(Y) for all 0 ≤ λ ≤ 1. (1) Eq. (1) can be shown [22, 32] to be equivalent to the more commonly used statement e2H(X+Y)/n ≥ e2H(X)/n + e2H(Y)/n. The latter explains the terminology as e2H(X)/n is the power, i.e., variance of a Gaussian ran-dom variable with identical entropy as H(X). Inequalities such as (1) are closely related to Log-Sobolev inequalities (see e.g., [31]) as well as Brunn-Minkowski-type inequalities [6]. Gen-eralizations to free probability [30] and quantum states have been considered. 1 ar

•Jan 1, 2014•16 citations

Entropic inequalities for bosonic systems

Stefan Huber

This dissertation deals with entropic inequalities for bosonic channels in quantum information theory. Such inequalities have applications in foundational questions of quantum communication and can be used to make statements about the convergence of quantum dynamical semigroups. We prove, among other results, an inequality for the output entropy of a quantum channel which models additive classical noise and apply this inequality to derive bounds on the classical capacity of a general family of non-Gaussian quantum channels.

•Jan 1, 2019•1 citation

Entropy power inequalities and classical capacities of bosonic noise channels

Robert König, Graeme Smith

Characterizing information-carrying capacities of bosonic communication channels is of significant practical interest. For thermal noise channels, using coherent (product) states yields an achievable rate for classical communication which is conjectured to be optimal. However, it is not known whether coding strategies using entanglement may perform better. Here we discuss upper bounds on classical capacities of thermal noise channels. These imply that coherent-state coding is close to optimal. Our main tool is a quantum analog of the entropy power inequality introduced Shannon. It gives a lower bound on the output von Neumann entropy when two independent signals combine at a beamsplitter.

IEEE/LEOS Summer Topical Meetings•Jul 1, 2013•0 citations

The entropy power inequality with quantum conditioning

Giacomo De Palma

Abstract The conditional entropy power inequality is a fundamental inequality in information theory, stating that the conditional entropy of the sum of two conditionally independent vector-valued random variables each with an assigned conditional entropy is minimum when the random variables are Gaussian. We prove the conditional entropy power inequality in the scenario where the conditioning system is quantum. The proof is based on the heat semigroup and on a generalization of the Stam inequality in the presence of quantum conditioning. The entropy power inequality with quantum conditioning will be a key tool of quantum information, with applications in distributed source coding protocols with the assistance of quantum entanglement.

arXiv:1808.08231•Journal of Physics A Mathematical and Theoretical•Jan 18, 2019•9 citations

The conditional entropy power inequality for Gaussian quantum states

Robert König

We propose a generalization of the quantum entropy power inequality involving conditional entropies. For the special case of Gaussian states, we give a proof based on perturbation theory for symplectic spectra. We discuss some implications for entanglement-assisted classical communication over additive bosonic noise channels.

arXiv:1304.7031•Journal of Mathematical Physics•Feb 1, 2015•31 citations

The Multimode Conditional Quantum Entropy Power Inequality and the Squashed Entanglement of the Extreme Multimode Bosonic Gaussian Channels

Alessandro Falco, Giacomo De Palma

We prove the multimode conditional quantum Entropy Power Inequality for bosonic quantum systems. This inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes among all the input states of the modes with given conditional entropies. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime, which provides the most promising platform for quantum communication and quantum key distribution. We apply our multimode conditional quantum Entropy Power Inequality to determine new lower bounds to the squashed entanglement of a large family of bosonic quantum Gaussian states. The squashed entanglement is one of the main entanglement measures in quantum communication theory, providing the best known upper bound to the distillable key. Exploiting this result, we determine a new lower bound to the squashed entanglement of the multimode bosonic Gaussian channels that are extreme,i.e., that cannot be decomposed as a non-trivial convex combination of quantum channels. The squashed entanglement of a quantum channel provides an upper bound to its secret-key capacity,i.e., the capacity to generate a secret key shared between the sender and the receiver. Lower bounds to the squashed entanglement are notoriously hard to prove. Our results contribute to break this barrier and will stimulate further research in the field of quantum communication with bosonic quantum systems.

arXiv:2410.14472•IEEE Transactions on Information Theory•May 22, 2025•1 citation
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 entropies of the input state and the noise when they are conditionally independent given the memory. We also show that this conditional entropy power inequality is optimal in the sense that we can achieve equality asymptotically by choosing a suitable sequence of Gaussian input states. We apply the conditional entropy power inequality to find an array of information-theoretic inequalities for conditional entropies which are the analogs of inequalities which have already been established in the unconditioned setting. Furthermore, we give a simple proof of the convergence rate of the quantum Ornstein-Uhlenbeck semigroup based on entropy power inequalities.
We propose a generalization of the quantum entropy power inequality involving condi-tional entropies. For the special case of Gaussian states, we give a proof based on perturba-tion theory for symplectic spectra. We discuss some implications for entanglement-assisted classical communication over additive bosonic noise channels. 1 Classical and quantum entropy-power inequalities The entropy power inequality, proposed by Shannon [27] and later established with increasing rigor by Stam [29] and Blachman [5], has become a fundamental tool in classical informa-tion theory. Shannon’s original application of the entropy power inequality is a lower bound on the capacity of an additive (but potentially non-Gaussian) noise channel [27, Theorem 18]. However, the usefulness of the entropy power inequality is especially evident in multi-terminal information theory. Among the most well-known applications are the characterization of the Gaussian broadcast channel by Bergman [4], the Gaussian two-description problem by Ozarow [25] and the quadratic Gaussian CEO problem by Oohama [24]. In these multi-user settings, Fano’s inequality by itself is insufficient to characterize different tradeoffs. A more recent application proposed by Liu and Viswanath [23] uses entropy power inequalities to solve certain optimization problems. The entropy power inequality lower bounds the differential entropy of the convolution of two independent random variables X, Y taking values in Rn. Its covariance-preserving version states that H( λX + 1 − λY) ≥ λH(X) + (1 − λ)H(Y) for all 0 ≤ λ ≤ 1. (1) Eq. (1) can be shown [22, 32] to be equivalent to the more commonly used statement e2H(X+Y)/n ≥ e2H(X)/n + e2H(Y)/n. The latter explains the terminology as e2H(X)/n is the power, i.e., variance of a Gaussian ran-dom variable with identical entropy as H(X). Inequalities such as (1) are closely related to Log-Sobolev inequalities (see e.g., [31]) as well as Brunn-Minkowski-type inequalities [6]. Gen-eralizations to free probability [30] and quantum states have been considered. 1 ar
This dissertation deals with entropic inequalities for bosonic channels in quantum information theory. Such inequalities have applications in foundational questions of quantum communication and can be used to make statements about the convergence of quantum dynamical semigroups. We prove, among other results, an inequality for the output entropy of a quantum channel which models additive classical noise and apply this inequality to derive bounds on the classical capacity of a general family of non-Gaussian quantum channels.
Characterizing information-carrying capacities of bosonic communication channels is of significant practical interest. For thermal noise channels, using coherent (product) states yields an achievable rate for classical communication which is conjectured to be optimal. However, it is not known whether coding strategies using entanglement may perform better. Here we discuss upper bounds on classical capacities of thermal noise channels. These imply that coherent-state coding is close to optimal. Our main tool is a quantum analog of the entropy power inequality introduced Shannon. It gives a lower bound on the output von Neumann entropy when two independent signals combine at a beamsplitter.
Abstract The conditional entropy power inequality is a fundamental inequality in information theory, stating that the conditional entropy of the sum of two conditionally independent vector-valued random variables each with an assigned conditional entropy is minimum when the random variables are Gaussian. We prove the conditional entropy power inequality in the scenario where the conditioning system is quantum. The proof is based on the heat semigroup and on a generalization of the Stam inequality in the presence of quantum conditioning. The entropy power inequality with quantum conditioning will be a key tool of quantum information, with applications in distributed source coding protocols with the assistance of quantum entanglement.
We prove the multimode conditional quantum Entropy Power Inequality for bosonic quantum systems. This inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes among all the input states of the modes with given conditional entropies. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime, which provides the most promising platform for quantum communication and quantum key distribution. We apply our multimode conditional quantum Entropy Power Inequality to determine new lower bounds to the squashed entanglement of a large family of bosonic quantum Gaussian states. The squashed entanglement is one of the main entanglement measures in quantum communication theory, providing the best known upper bound to the distillable key. Exploiting this result, we determine a new lower bound to the squashed entanglement of the multimode bosonic Gaussian channels that are extreme,i.e., that cannot be decomposed as a non-trivial convex combination of quantum channels. The squashed entanglement of a quantum channel provides an upper bound to its secret-key capacity,i.e., the capacity to generate a secret key shared between the sender and the receiver. Lower bounds to the squashed entanglement are notoriously hard to prove. Our results contribute to break this barrier and will stimulate further research in the field of quantum communication with bosonic quantum systems.