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/0109079 · Physical Review Letters

Qubit Channels Can Require More Than Two Inputs to Achieve Capacity

Christopher King, Michael Nathanson, Mary Beth Ruskai

Published Jan 16, 2002• 24 citations
arXivHTMLPDF

Abstract

We give examples of qubit channels that require three input states in order to achieve the Holevo capacity.
DOI
10.1103/physrevlett.88.057901

Related papers

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

Masahito Hayashi, H. Imai, Keiji Matsumoto +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 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.

arXiv:quant-ph/0403176•Quantum Information and Computation•Jan 1, 2005•51 citations

Negative Qubit Channel Examples with Multi-Qubit Baths

James M. McCracken

Synthesis lectures on quantum computing•Jan 1, 2014•0 citations

How many bits are needed to transmit a qubit reliably?

P. K. Aravind

Physics Letters A•May 1, 1998•3 citations

Qubit channels that achieve capacity with two states

Dominic William Berry

Four signalling states are sufficient to achieve the Holevo capacity for qubit channels, but in many cases are not necessary. There are examples known where the capacity is achieved for two orthogonal input states, two nonorthogonal states, and examples where three states are necessary and sufficient. Many previous results were obtained for a class of channel for which three states are sufficient. In this study, a systematic theory for this class of channel was developed. Simple criteria are presented that, when satisfied, mean that two states are sufficient for the ensemble. When these criteria are satisfied, there is a simple method to determine whether the states in the ensemble should be orthogonal or nonorthogonal. When the criteria are not satisfied, it is still possible that two states are sufficient, though it is possible that three states are necessary. In the case where three states are necessary, the form of the optimal ensemble is predicted. These results provide an efficient method for calculating the Holevo capacity for all channels in this class.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 18, 2005•0 citations

Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

Ziao Tang, Chengkai Zhu, Ge Bai +1 more

Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability $p$, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is $h_2((1+\sqrt p)/2)$ ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for $p<1$, and construct a binary Kraus representation attaining the uniform formation bound.

quant-pharXiv:2609.28592•Sep 24, 2026•3 citations

Capacities of Quantum Channels and How to Find Them

Peter W. Shor

Abstract: We survey what is known about the information transmitting capacities of quantum channels, and give a proposal for how to calculate some of these capacities using linear programming. 1

•Apr 14, 2003•43 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.
Four signalling states are sufficient to achieve the Holevo capacity for qubit channels, but in many cases are not necessary. There are examples known where the capacity is achieved for two orthogonal input states, two nonorthogonal states, and examples where three states are necessary and sufficient. Many previous results were obtained for a class of channel for which three states are sufficient. In this study, a systematic theory for this class of channel was developed. Simple criteria are presented that, when satisfied, mean that two states are sufficient for the ensemble. When these criteria are satisfied, there is a simple method to determine whether the states in the ensemble should be orthogonal or nonorthogonal. When the criteria are not satisfied, it is still possible that two states are sufficient, though it is possible that three states are necessary. In the case where three states are necessary, the form of the optimal ensemble is predicted. These results provide an efficient method for calculating the Holevo capacity for all channels in this class.
Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability ppp, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is h2((1+p)/2)h_2((1+\sqrt p)/2)h2​((1+p​)/2) ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for p<1p<1p<1, and construct a binary Kraus representation attaining the uniform formation bound.