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/0403176 · Quantum Information and Computation

Qubit channels which require four inputs to achieve capacity: Implications for additivity conjectures

Masahito Hayashi, H. Imai, Keiji Matsumoto, Mary Beth Ruskai, T. Shimono

Published Jan 1, 2005• 48 citations
arXivHTMLPDF

Abstract

An example is given of a qubit quantum channel which requires four inputs to maximize the Holevo capacity. The example is one of a family of channels which are related to 3-state channels. The capacity of the product channel is studied and numerical evidence presented which strongly suggests additivity. The numerical evidence also supports a conjecture about the concavity of output entropy as a function of entanglement parameters. However, an example is presented which shows that for some channels this conjecture does not hold for all input states. A numerical algorithm for finding the capacity and optimal inputs is presented and its relation to a relative entropy optimization discussed.

DOI
10.26421/qic5.1-2

Related papers

Qubit channels which require four inputs to achieve capacity

HayashiMasahito, ImaiHiroshi, MatsumotoKeiji +2 more

An example is given of a qubit quantum channel which requires four inputs to maximize the Holevo capacity. The example is one of a family of channels which are related to 3-state channels. The capa...

Quantum Information and Computation•Jan 1, 2005•1 citation

Maximization of capacity and lp norms for some product channels

Christopher King

It is conjectured that the Holevo capacity of a product channel Ω⊗Φ is achieved when product states are used as input. Amosov, Holevo, and Werner have also conjectured that the maximal lp norm of a product channel is achieved with product input states. In this article we establish both of these conjectures in the case that Ω is arbitrary and Φ is a CQ or QC channel (as defined by Holevo). We also establish the Amosov, Holevo and Werner conjecture when Ω is arbitrary and either Φ is a qubit channel and p=2, or Φ is a unital qubit channel and p is integer. Our proofs involve a new conjecture for the norm of an output state of the half-noisy channel I⊗Φ, when Φ is a qubit channel. We show that this conjecture in some cases also implies additivity of the Holevo capacity.

arXiv:quant-ph/0103086•Journal of Mathematical Physics•Mar 1, 2002•52 citations

The Holevo capacity of infinite dimensional channels

Максим Евгеньевич Широков

The notion of the Holevo capacity for arbitrarily constrained infinite dimensional quantum channels is introduced. It is shown that despite nonexistence of an optimal ensemble in this case it is possible to define the notion of the output optimal average state for such a channel. The characterization of the output optimal average state and a minimax expression for the Holevo capacity are obtained. This makes it possible to prove equivalence of several additivity properties for infinite dimensional quantum channels. The notion of the $\chi$-function for an infinite dimensional channel is considered, its strong concavity and lower semicontinuity are shown. The problem of continuity of the Holevo capacity is also discussed. It is shown that the Holevo capacity is continuous function of a channel in the finite dimensional case while in general it is only lower semicontinuous. This conclusion is confirmed by the example. The main result of this note is the statement that additivity of the Holevo capacity for all finite dimensional channels implies additivity of the Holevo capacity for all infinite dimensional channels with arbitrary constraints. The subadditivity of the $\chi$-function for two infinite dimensional channels with one of them noiseless or entanglement breaking is also proved.

•Aug 2, 2004•5 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•105 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

Minimal entropy of states emerging from noisy quantum channels

Christopher King, Mary Beth Ruskai

We consider the minimal entropy of qubit states transmitted through two uses of a noisy quantum channel, which is modeled by the action of a completely positive trace-preserving (or stochastic) map. We provide strong support for the conjecture that this minimal entropy is additive, namely, that the minimum entropy can be achieved when product states are transmitted. Explicitly, we prove that for a tensor product of two unital stochastic maps on qubit states, using an entanglement that involves only states which emerge with minimal entropy cannot decrease the entropy below the minimum achievable using product states. We give a separate argument, based on the geometry of the image of the set of density matrices under stochastic maps, which suggests that the minimal entropy conjecture holds for nonunital as well as for unital maps. We also show that the maximal norm of the output states is multiplicative for most product maps on n-qubit states, including all those for which at least one map is unital. For the class of unital channels on C/sup 2/, we show that additivity of minimal entropy implies that the Holevo (see IEEE Trans. Inform. Theory, vol.44, p.269-73, 1998 and Russian Math. Surv., p.1295-1331, 1999) capacity of the channel is additive over two inputs, achievable with orthogonal states, and equal to the Shannon capacity. This implies that superadditivity of the capacity is possible only for nonunital channels.

arXiv:quant-ph/9911079•IEEE Transactions on Information Theory•Jan 1, 2001•345 citations
An example is given of a qubit quantum channel which requires four inputs to maximize the Holevo capacity. The example is one of a family of channels which are related to 3-state channels. The capacity of the product channel is studied and numerical evidence presented which strongly suggests additivity. The numerical evidence also supports a conjecture about the concavity of output entropy as a function of entanglement parameters. However, an example is presented which shows that for some channels this conjecture does not hold for all input states. A numerical algorithm for finding the capacity and optimal inputs is presented and its relation to a relative entropy optimization discussed.
It is conjectured that the Holevo capacity of a product channel Ω⊗Φ is achieved when product states are used as input. Amosov, Holevo, and Werner have also conjectured that the maximal lp norm of a product channel is achieved with product input states. In this article we establish both of these conjectures in the case that Ω is arbitrary and Φ is a CQ or QC channel (as defined by Holevo). We also establish the Amosov, Holevo and Werner conjecture when Ω is arbitrary and either Φ is a qubit channel and p=2, or Φ is a unital qubit channel and p is integer. Our proofs involve a new conjecture for the norm of an output state of the half-noisy channel I⊗Φ, when Φ is a qubit channel. We show that this conjecture in some cases also implies additivity of the Holevo capacity.
The notion of the Holevo capacity for arbitrarily constrained infinite dimensional quantum channels is introduced. It is shown that despite nonexistence of an optimal ensemble in this case it is possible to define the notion of the output optimal average state for such a channel. The characterization of the output optimal average state and a minimax expression for the Holevo capacity are obtained. This makes it possible to prove equivalence of several additivity properties for infinite dimensional quantum channels. The notion of the χ\chiχ-function for an infinite dimensional channel is considered, its strong concavity and lower semicontinuity are shown. The problem of continuity of the Holevo capacity is also discussed. It is shown that the Holevo capacity is continuous function of a channel in the finite dimensional case while in general it is only lower semicontinuous. This conclusion is confirmed by the example. The main result of this note is the statement that additivity of the Holevo capacity for all finite dimensional channels implies additivity of the Holevo capacity for all infinite dimensional channels with arbitrary constraints. The subadditivity of the χ\chiχ-function for two infinite dimensional channels with one of them noiseless or entanglement breaking is also proved.
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.
We consider the minimal entropy of qubit states transmitted through two uses of a noisy quantum channel, which is modeled by the action of a completely positive trace-preserving (or stochastic) map. We provide strong support for the conjecture that this minimal entropy is additive, namely, that the minimum entropy can be achieved when product states are transmitted. Explicitly, we prove that for a tensor product of two unital stochastic maps on qubit states, using an entanglement that involves only states which emerge with minimal entropy cannot decrease the entropy below the minimum achievable using product states. We give a separate argument, based on the geometry of the image of the set of density matrices under stochastic maps, which suggests that the minimal entropy conjecture holds for nonunital as well as for unital maps. We also show that the maximal norm of the output states is multiplicative for most product maps on n-qubit states, including all those for which at least one map is unital. For the class of unital channels on C/sup 2/, we show that additivity of minimal entropy implies that the Holevo (see IEEE Trans. Inform. Theory, vol.44, p.269-73, 1998 and Russian Math. Surv., p.1295-1331, 1999) capacity of the channel is additive over two inputs, achievable with orthogonal states, and equal to the Shannon capacity. This implies that superadditivity of the capacity is possible only for nonunital channels.