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:quant-ph/0505151 · IMPERIAL COLLEGE PRESS eBooks

Gaussian Quantum Channels

Jens Eisert, Michael M. Wolf

Published Feb 1, 2007• 115 citations
arXivHTMLPDF

Abstract

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 issues. Some of the known results are extended. In particular, it is shown that the quantum conditional entropy is maximized by Gaussian states and that some implications for additivity problems can be extended to the Gaussian setting.

DOI
10.1142/9781860948169_0002

Related papers

Quantum proper entropies and additive capacities of quantum information channels

V. P. Belavkin

An elementary algebraic approach to unified quantum information theory is given. The operational meaning of entanglement as specifically quantum encoding is disclosed. General relative entropy as information divergence is introduced, and three most important types of relative information, namely, the Araki-Umegaki type (A-type), the Belavkin-Staszewski type (B-type), and the thermodynamical (C-type) are discussed. It is shown that true quantum entanglement-assisted entropy is greater than semiclassical (von Neumann) quantum entropy, and the proper positive quantum conditional entropy is introduced. The general quantum mutual information via entanglement is defined, and the corresponding types of quantum channel capacities as a supremum via the generalized encodings are formulated. The additivity problem for quantum logarithmic capacities for products of arbitrary quantum channels under appropriate constraints on encodings is discussed. It is proved that true quantum capacity, which is achieved on the standard entanglement as an optimal quantum encoding, retains the additivity property of the logarithmic quantum channel entanglement-assisted capacities on the products of quantum input states. This result for quantum logarithmic information of A-type, which was obtained earlier by the author, is extended to any type of quantum information.

Mathematical Notes•Feb 1, 2011•0 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

Gaussian optimizers and the additivity problem in quantum information theory

A S Holevo

We give a survey of the two remarkable analytical problems of quantum information theory. The main part is a detailed report of the recent (partial) solution of the quantum Gaussian optimizers problem which establishes an optimal property of Glauber's coherent states -- a particular instance of pure quantum Gaussian states. We elaborate on the notion of quantum Gaussian channel as a noncommutative generalization of Gaussian kernel to show that the coherent states, and under certain conditions only they, minimize a broad class of the concave functionals of the output of a Gaussian channel. Thus, the output states corresponding to the Gaussian input are "the least chaotic", majorizing all the other outputs. The solution, however, is essentially restricted to the gauge-invariant case where a distinguished complex structure plays a special role. We also comment on the related famous additivity conjecture, which was solved in principle in the negative some five years ago. This refers to the additivity or multiplicativity (with respect to tensor products of channels) of information quantities related to the classical capacity of quantum channel, such as $(1\rightarrow p)$-norms or the minimal von Neumann or Rényi output entropies. A remarkable corollary of the present solution of the quantum Gaussian optimizers problem is that these additivity properties, while not valid in general, do hold in the important and interesting class of the gauge-covariant Gaussian channels.

arXiv:1501.00652•Russian Mathematical Surveys•Apr 30, 2015•51 citations

Gaussian classical-quantum channels: Gain from entanglement-assistance

Alexander Semenovich Holevo

In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; embedding of the classical input in quantum input is always possible, and therefore the classical entanglement-assisted capacity C ea under an appropriate input constraint is well defined. We prove the general property of entropy increase for a weak complementary channel, which implies the equality C = C ea (where C is the unassisted capacity) for a certain class of c-q Gaussian channels under an appropriate energy-type constraint. On the other hand, we show by an explicit example that the inequality C < C ea is not unusual for constrained c-q Gaussian channel.

Problems of Information Transmission•Jan 1, 2014•2 citations

Gaussian classical-quantum channels: gain of entanglement-assistance

Alexander Semenovich Holevo

In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity C_{ea} under appropriate input constraint is well defined. We prove a general property of entropy increase for weak complementary channel, that implies the equality C_{ea}=C (where C is the unassisted capacity) for certain class of c-q Gaussian channel under appropriate energy-type constraint. On the other hand, we show by explicit example that the inequality C

arXiv:1211.4774•Nov 20, 2012•2 citations

Entanglement-Assisted Capacities of Constrained Quantum Channels

Alexander Semenovich Holevo

In this paper we fill a gap in previous works by proving the conjectured formula for the classical entanglement-assisted capacity of a quantum channel with additive constraint (such as the Bosonic Gaussian channel). Our main tools are the coding theorem for classical-quantum constrained channels and a finite-dimensional approximation of the input density operators for entanglement-assisted capacity. We also give sufficient conditions under which suprema in the capacity formulas are achieved.

Theory of Probability and Its Applications•Jan 1, 2004•53 citations
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 issues. Some of the known results are extended. In particular, it is shown that the quantum conditional entropy is maximized by Gaussian states and that some implications for additivity problems can be extended to the Gaussian setting.
An elementary algebraic approach to unified quantum information theory is given. The operational meaning of entanglement as specifically quantum encoding is disclosed. General relative entropy as information divergence is introduced, and three most important types of relative information, namely, the Araki-Umegaki type (A-type), the Belavkin-Staszewski type (B-type), and the thermodynamical (C-type) are discussed. It is shown that true quantum entanglement-assisted entropy is greater than semiclassical (von Neumann) quantum entropy, and the proper positive quantum conditional entropy is introduced. The general quantum mutual information via entanglement is defined, and the corresponding types of quantum channel capacities as a supremum via the generalized encodings are formulated. The additivity problem for quantum logarithmic capacities for products of arbitrary quantum channels under appropriate constraints on encodings is discussed. It is proved that true quantum capacity, which is achieved on the standard entanglement as an optimal quantum encoding, retains the additivity property of the logarithmic quantum channel entanglement-assisted capacities on the products of quantum input states. This result for quantum logarithmic information of A-type, which was obtained earlier by the author, is extended to any type of quantum information.
We give a survey of the two remarkable analytical problems of quantum information theory. The main part is a detailed report of the recent (partial) solution of the quantum Gaussian optimizers problem which establishes an optimal property of Glauber's coherent states -- a particular instance of pure quantum Gaussian states. We elaborate on the notion of quantum Gaussian channel as a noncommutative generalization of Gaussian kernel to show that the coherent states, and under certain conditions only they, minimize a broad class of the concave functionals of the output of a Gaussian channel. Thus, the output states corresponding to the Gaussian input are "the least chaotic", majorizing all the other outputs. The solution, however, is essentially restricted to the gauge-invariant case where a distinguished complex structure plays a special role. We also comment on the related famous additivity conjecture, which was solved in principle in the negative some five years ago. This refers to the additivity or multiplicativity (with respect to tensor products of channels) of information quantities related to the classical capacity of quantum channel, such as (1→p)(1\rightarrow p)(1→p)-norms or the minimal von Neumann or Rényi output entropies. A remarkable corollary of the present solution of the quantum Gaussian optimizers problem is that these additivity properties, while not valid in general, do hold in the important and interesting class of the gauge-covariant Gaussian channels.
In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; embedding of the classical input in quantum input is always possible, and therefore the classical entanglement-assisted capacity C ea under an appropriate input constraint is well defined. We prove the general property of entropy increase for a weak complementary channel, which implies the equality C = C ea (where C is the unassisted capacity) for a certain class of c-q Gaussian channels under an appropriate energy-type constraint. On the other hand, we show by an explicit example that the inequality C < C ea is not unusual for constrained c-q Gaussian channel.
In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity C_{ea} under appropriate input constraint is well defined. We prove a general property of entropy increase for weak complementary channel, that implies the equality C_{ea}=C (where C is the unassisted capacity) for certain class of c-q Gaussian channel under appropriate energy-type constraint. On the other hand, we show by explicit example that the inequality C