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

The conditional entropy power inequality for Gaussian quantum states

Robert König

Published Jan 1, 2014• 16 citations
OpenAlex

Abstract

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

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

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 for Quantum Systems

Robert König, Graeme Smith

When two independent analog signals, X and Y are added together giving Z=X+Y, the entropy of Z, H(Z), is not a simple function of the entropies H(X) and H(Y), but rather depends on the details of X and Y's distributions. Nevertheless, the entropy power inequality (EPI), which states that e2H(Z)≥ e2H(X)+e2H(Y), gives a very tight restriction on the entropy of Z. This inequality has found many applications in information theory and statistics. The quantum analogue of adding two random variables is the combination of two independent bosonic modes at a beam splitter. The purpose of this paper is to give a detailed outline of the proof of two separate generalizations of the EPI to the quantum regime. Our proofs are similar in spirit to the standard classical proofs of the EPI, but some new quantities and ideas are needed in the quantum setting. In particular, we find a new quantum de Bruijin identity relating entropy production under diffusion to a divergence-based quantum Fisher information. Furthermore, this Fisher information exhibits certain convexity properties in the context of beam splitters.

arXiv:1205.3409•IEEE Transactions on Information Theory•Jan 31, 2014•69 citations

The conditional entropy power inequality for quantum additive noise channels

Giacomo De Palma, Stefan Huber

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.

arXiv:1803.00470•Journal of Mathematical Physics•Dec 1, 2018•19 citations

Balanced von Neumann entropy inequalities for bosonic and fermionic Gaussian states

Weiqi Jiang, Pengcheng Hou, Kun Chen

When arbitrary finite local dimensions are allowed, bosonic Gaussian states and nondegenerate classical Gaussian block vectors satisfy exactly the same unconditional balanced linear entropy inequalities. We establish this equivalence for von Neumann entropy, extending the known Rényi-2 correspondence. Spectral entropy integrals and compatible realification transfer classical determinant inequalities to bosonic states and, in the forward direction, to even fermionic Gaussian states under complete-mode canonical anticommutation relation (CAR) restrictions. A high-temperature limit gives the bosonic converse. Both transfers include pure modes and imply the Zhang-Yeung non-Shannon inequality. We also derive quantitative independence bounds from conditional mutual information ε = I(A:C | B). For bosons, bounded covariance or total photon number gives a trace-distance bound C√ε for ρAC relative to ρA ⊗ ρC, with spectral and matrix Gram refinements of the prefactor. For fermions, an explicit square-root bound requires no energy or spectral gap assumption, and a complementary bound of order √[ε log(1/ε)] is uniform in the number of conditioning modes with A, C fixed. Known Gaussian continuity theorems convert the new covariance estimates to state distance. The fixed-mode square-root exponents are optimal. Combining fermionic rigidity with the established entropy-deficit identity yields an operational lower bound on non-Gaussianity from CMI and a probability difference for an even measurement event on AC. Version 1.0. Complete manuscript with Appendices A–G.

•Oct 28, 2026•0 citations
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
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.
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.
When two independent analog signals, X and Y are added together giving Z=X+Y, the entropy of Z, H(Z), is not a simple function of the entropies H(X) and H(Y), but rather depends on the details of X and Y's distributions. Nevertheless, the entropy power inequality (EPI), which states that e2H(Z)≥ e2H(X)+e2H(Y), gives a very tight restriction on the entropy of Z. This inequality has found many applications in information theory and statistics. The quantum analogue of adding two random variables is the combination of two independent bosonic modes at a beam splitter. The purpose of this paper is to give a detailed outline of the proof of two separate generalizations of the EPI to the quantum regime. Our proofs are similar in spirit to the standard classical proofs of the EPI, but some new quantities and ideas are needed in the quantum setting. In particular, we find a new quantum de Bruijin identity relating entropy production under diffusion to a divergence-based quantum Fisher information. Furthermore, this Fisher information exhibits certain convexity properties in the context of beam splitters.
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.
When arbitrary finite local dimensions are allowed, bosonic Gaussian states and nondegenerate classical Gaussian block vectors satisfy exactly the same unconditional balanced linear entropy inequalities. We establish this equivalence for von Neumann entropy, extending the known Rényi-2 correspondence. Spectral entropy integrals and compatible realification transfer classical determinant inequalities to bosonic states and, in the forward direction, to even fermionic Gaussian states under complete-mode canonical anticommutation relation (CAR) restrictions. A high-temperature limit gives the bosonic converse. Both transfers include pure modes and imply the Zhang-Yeung non-Shannon inequality. We also derive quantitative independence bounds from conditional mutual information ε = I(A:C | B). For bosons, bounded covariance or total photon number gives a trace-distance bound C√ε for ρAC relative to ρA ⊗ ρC, with spectral and matrix Gram refinements of the prefactor. For fermions, an explicit square-root bound requires no energy or spectral gap assumption, and a complementary bound of order √[ε log(1/ε)] is uniform in the number of conditioning modes with A, C fixed. Known Gaussian continuity theorems convert the new covariance estimates to state distance. The fixed-mode square-root exponents are optimal. Combining fermionic rigidity with the established entropy-deficit identity yields an operational lower bound on non-Gaussianity from CMI and a probability difference for an even measurement event on AC. Version 1.0. Complete manuscript with Appendices A–G.