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

Lecture notes series, Institute For Mathematical Sciences

TWO MATHEMATICAL PROBLEMS IN QUANTUM INFORMATION THEORY

Alexander Semenovich Holevo

Published Jun 1, 2010• 1 citation
Publisher

Abstract

We survey the modern status of two major analytical problems in quantum information theory. One is the famous additivity conjecture for information quantities related to the classical capacity of quantum channel. Another is less familiar and less studied problem of optimizers of the information quantities characterizing Bosonic Gaussian channels. We show that for gauge-invariant channels, the validity of the Gaussian minimizer conjecture for the output entropy implies Gaussianity of the ensemble maximizing the χ-capacity.

DOI
10.1142/9789814313322_0005

Related papers

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•54 citations

On some additivity problems in quantum information theory

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.

arXiv:math-ph/0003002•Mar 4, 2000•125 citations

Additivity/Multiplicativity Communication Channels

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Feb 24, 2006•0 citations

Probability Measures on the Set of Quantum States in Optimization Problems for Information Quantities

A. S. Holevo

A number of optimization problems in quantum information theory, such as one-shot classical capacity of a quantum channel, entanglement of formation of a state, classical capacity of a quantum observable, and accessible information of an ensemble of quantum states, can be formulated as the calculation of the convex closure of the output entropy of a certain quantum channel. This general problem can be considered as a convex programming problem for which necessary and sufficient optimality conditions can be established along with a dual problem. These optimality conditions imply some tight lower bounds for entropy, either quantum or classical, which are related to the famous logarithmic Sobolev inequality.

Theory of Probability and Its Applications•Aug 1, 2026•0 citations

The additivity problem for constrained quantum channels

Александр Семенович Холево, Максим Евгеньевич Широков

One of the central problems of quantum information theory [1] is the additivity conjecture for the channel capacity of quantum communication channels [2]–[4]. Recently Shor showed [5] that the validity of this conjecture for all quantum channels was equivalent to a whole series of (super)additivity properties for other important characteristics such as minimal output entropy and entanglementof formation. The present paper introduces the new property of strong additivity (additivity for channels with input constraints) with several equivalent formulations, establishes that it is satisfied for some nontrivial classes of channels and notes that the validity of the additivity conjecture for all channels implies strong additivity. Let H, H′ be finite-dimensional unitary spaces. By a quantum channel we mean a completely positive trace-preserving linear map Φ: B(H) → B(H′), where B(H) is the algebra of all operators on H. In particular, Φ generates an affine map of the convex set S(H) of states (density operators) on the space H into the set S(H′) of states on H′ [1]. The quantum analogue of Shannon’s theorem, established in [4], gives the following expression for the classical channel capacity:

Russian Mathematical Surveys•Apr 30, 2004•0 citations

The additivity problem in quantum information theory

Alexander Semenovich Holevo

In this lecture we survey the present status of the additivity problem for the classical capacity and related characteristics of quantum channels – one of the most profound mathematical problems of quantum information theory.

Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006•May 15, 2007•29 citations
We survey the modern status of two major analytical problems in quantum information theory. One is the famous additivity conjecture for information quantities related to the classical capacity of quantum channel. Another is less familiar and less studied problem of optimizers of the information quantities characterizing Bosonic Gaussian channels. We show that for gauge-invariant channels, the validity of the Gaussian minimizer conjecture for the output entropy implies Gaussianity of the ensemble maximizing the χ-capacity.
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.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A number of optimization problems in quantum information theory, such as one-shot classical capacity of a quantum channel, entanglement of formation of a state, classical capacity of a quantum observable, and accessible information of an ensemble of quantum states, can be formulated as the calculation of the convex closure of the output entropy of a certain quantum channel. This general problem can be considered as a convex programming problem for which necessary and sufficient optimality conditions can be established along with a dual problem. These optimality conditions imply some tight lower bounds for entropy, either quantum or classical, which are related to the famous logarithmic Sobolev inequality.
One of the central problems of quantum information theory [1] is the additivity conjecture for the channel capacity of quantum communication channels [2]–[4]. Recently Shor showed [5] that the validity of this conjecture for all quantum channels was equivalent to a whole series of (super)additivity properties for other important characteristics such as minimal output entropy and entanglementof formation. The present paper introduces the new property of strong additivity (additivity for channels with input constraints) with several equivalent formulations, establishes that it is satisfied for some nontrivial classes of channels and notes that the validity of the additivity conjecture for all channels implies strong additivity. Let H, H′ be finite-dimensional unitary spaces. By a quantum channel we mean a completely positive trace-preserving linear map Φ: B(H) → B(H′), where B(H) is the algebra of all operators on H. In particular, Φ generates an affine map of the convex set S(H) of states (density operators) on the space H into the set S(H′) of states on H′ [1]. The quantum analogue of Shannon’s theorem, established in [4], gives the following expression for the classical channel capacity: