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

Kluwer Academic Publishers eBooks

Additivity/Multiplicativity Communication Channels

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

Published Feb 24, 2006• 0 citations
Publisher

Abstract

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.

DOI
10.1007/0-306-47114-0_1

Related papers

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

Counterexample to an additivity conjecture for output purity of quantum channels

R. F. Werner, A. S. Holevo

A conjecture arising naturally in the investigation of additivity of classical information capacity of quantum channels states that the maximal purity of outputs from a quantum channel, as measured by the p-norm, should be multiplicative with respect to the tensor product of channels. We disprove this conjecture for p>4.79. The same example (with p=∞) also disproves a conjecture for the multiplicativity of the injective norm of Hilbert space tensor products.

arXiv:quant-ph/0203003•Journal of Mathematical Physics•Sep 1, 2002•213 citations

On the multiplicativity conjecture for quantum channels

Grigori Gennadievich Amosov, Alexander Semenovich Holevo

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 quantum information theory. The proof of the conjecture is given for the case of natural numbers $p$.

arXiv:math-ph/0103015•Mar 12, 2001•33 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

Notes on multiplicativity of maximal output purity for completely positive qubit maps

K M R Audenaert

A problem in quantum information theory that has received considerable attention in recent years is the question of multiplicativity of the so-called maximal output purity (MOP) of a quantum channel. This quantity is defined as the maximum value of the purity one can get at the output of a channel by varying over all physical input states, when purity is measured by the Schatten $q$-norm, and is denoted by $ν_q$. The multiplicativity problem is the question whether two channels used in parallel have a combined $ν_q$ that is the product of the $ν_q$ of the two channels. A positive answer would imply a number of other additivity results in QIT. Very recently, P. Hayden has found counterexamples for every value of $q>1$. Nevertheless, these counterexamples require that the dimension of these channels increases with $1-q$ and therefore do not rule out multiplicativity for $q$ in intervals $[1,q_0)$ with $q_0$ depending on the channel dimension. I argue that this would be enough to prove additivity of entanglement of formation and of the classical capacity of quantum channels. More importantly, no counterexamples have as yet been found in the important special case where one of the channels is a qubit-channel, i.e. its input states are 2-dimensional. In this paper I focus attention to this qubit case and I rephrase the multiplicativity conjecture in the language of block matrices and prove the conjecture in a number of special cases.

arXiv:0709.0855•Journal of Physics Conference Series•Mar 1, 2008•1 citation

Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels

Peter W. Shor

We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for classical capacity) that can occur. One of the more important open questions of quantum information theory is the determination of the capacity of a quantum channel for carrying classical information. This question has been only partially resolved. If entanglement between multiple inputs to the channel is not allowed, a formula for the classical capacity of a quantum channel has indeed been discovered [1, 2]. This capacity formula for a quantum channel Ψ is χ ∗ (Ψ) = max p i,ρ i H Ψ(piρi) − ∑

•Jan 31, 2002•171 citations
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 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 multiplicativity conjecture for quantum communication channels is formulated, validity of which for the values of parameter ppp close to 1 is related to the solution of the fundamental problem of additivity of the channel capacity in quantum information theory. The proof of the conjecture is given for the case of natural numbers ppp.
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:
A problem in quantum information theory that has received considerable attention in recent years is the question of multiplicativity of the so-called maximal output purity (MOP) of a quantum channel. This quantity is defined as the maximum value of the purity one can get at the output of a channel by varying over all physical input states, when purity is measured by the Schatten qqq-norm, and is denoted by νqν_qνq​. The multiplicativity problem is the question whether two channels used in parallel have a combined νqν_qνq​ that is the product of the νqν_qνq​ of the two channels. A positive answer would imply a number of other additivity results in QIT. Very recently, P. Hayden has found counterexamples for every value of q>1q>1q>1. Nevertheless, these counterexamples require that the dimension of these channels increases with 1−q1-q1−q and therefore do not rule out multiplicativity for qqq in intervals [1,q0)[1,q_0)[1,q0​) with q0q_0q0​ depending on the channel dimension. I argue that this would be enough to prove additivity of entanglement of formation and of the classical capacity of quantum channels. More importantly, no counterexamples have as yet been found in the important special case where one of the channels is a qubit-channel, i.e. its input states are 2-dimensional. In this paper I focus attention to this qubit case and I rephrase the multiplicativity conjecture in the language of block matrices and prove the conjecture in a number of special cases.
We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for classical capacity) that can occur. One of the more important open questions of quantum information theory is the determination of the capacity of a quantum channel for carrying classical information. This question has been only partially resolved. If entanglement between multiple inputs to the channel is not allowed, a formula for the classical capacity of a quantum channel has indeed been discovered [1, 2]. This capacity formula for a quantum channel Ψ is χ ∗ (Ψ) = max p i,ρ i H Ψ(piρi) − ∑