We study various super-activation effects in the following zero-error communication scenario: One sender wants to send classical or quantum information through a noisy quantum channel to one receiver with zero probability of error. First we show that there are quantum channels of which a single use is not able to transmit classical information perfectly yet two uses can. This is achieved by employing entangled input states between different uses of the given channel and thus cannot happen for classical channels. Second we exhibit a class of quantum channel with vanishing zero-error classical capacity such that when a noiseless qubit channel or one ebit shared entanglement are available, it can be used to transmit
log2d noiseless qubits, where 2d is the dimension of input state space. Third we further construct quantum channels with vanishing zero-error classical capacity when assisted with classical feedback can be used to transmit both classical and quantum information perfectly. These striking findings not only indicate both the zero-error quantum and classical capacities of quantum channels satisfy a strong super-additivity beyond any classical channels, but also highlight the activation power of auxiliary physical resources in zero-error communication.
We study the one-shot zero-error classical capacity of a quantum channel assisted by quantum no-signalling correlations, and the reverse problem of exact simulation of a prescribed channel by a noiseless classical one. Quantum no-signalling correlations are viewed as two-input and two-output completely positive and trace preserving maps with linear constraints enforcing that the device cannot signal. Both problems lead to simple semidefinite programmes (SDPs) that depend only on the Choi-Kraus (operator) space of the channel. In particular, we show that the zero-error classical simulation cost is precisely the conditional min-entropy of the Choi-Jamiołkowski matrix of the given channel. The zero-error classical capacity is given by a similar-looking but different SDP; the asymptotic zero-error classical capacity is the regularization of this SDP, and in general, we do not know of any simple form. Interestingly, however, for the class of classical-quantum channels, we show that the asymptotic capacity is given by a much simpler SDP, which coincides with a semidefinite generalization of the fractional packing number suggested earlier by Aram Harrow. This finally results in an operational interpretation of the celebrated Lovász ϑ function of a graph as the zero-error classical capacity of the graph assisted by quantum no-signalling correlations, the first information theoretic interpretation of the Lovász number.
We initiate the study of zero-error communication via quantum channels when the receiver and the sender have at their disposal a noiseless feedback channel of unlimited quantum capacity, generalizing Shannon's zero-error communication theory with instantaneous feedback. We first show that this capacity is only a function of the linear span of Choi-Kraus operators of the channel, which generalizes the bipartite equivocation graph of a classical channel, and which we dub non-commutative bipartite graph. Then, we go on to show that the feedback-assisted capacity is non-zero (allowing for a constant amount of activating noiseless communication) if and only if the non-commutative bipartite graph is non-trivial, and give a number of equivalent characterizations. This result involves a far-reaching extension of the conclusive exclusion of quantum states. We then present an upper bound on the feedback-assisted zero-error capacity, motivated by a conjecture originally made by Shannon and proved later by Ahlswede. We demonstrate that this bound to have many good properties, including being additive and given by a minimax formula. We also prove a coding theorem showing that this quantity is the entanglement-assisted capacity against an adversarially chosen channel from the set of all channels with the same Choi-Kraus span, which can also be interpreted as the feedback-assisted unambiguous capacity. The proof relies on a generalization of the Postselection Lemma (de Finetti reduction) that allows to reflect additional constraints, and which we believe to be of independent interest. This capacity is a relaxation of the feedback-assisted zero-error capacity; however, we have to leave open the question of whether they coincide in general. We illustrate our ideas with a number of examples, including classical-quantum channels and Weyl diagonal channels, and close with an extensive discussion of open questions.
Duan and Winter studied the one-shot zero-error classical capacity of a quantum channel assisted by quantum non-signalling correlations, and formulated this problem as a semidefinite program depending only on the Kraus operator space of the channel. For the class of classical-quantum channels, they showed that the asymptotic zero-error classical capacity assisted by quantum non-signalling correlations, minimized over all classicalquantum channels with a confusability graph G, is exactly log ϑ(G), where ϑ(G) is the celebrated Lov´asz theta function. In this paper, we show that the one-shot capacity for a classical-quantum channel, induced from a circulant graph G defined by equal-sized cyclotomic cosets, is logbϑ(G)c, which further implies that its asymptotic capacity is log ϑ(G). This type of graphs include the cycle graphs of odd length, the Paley graphs of prime vertices, and the cubit residue graphs of prime vertices. Examples of other graphs are also discussed. This gives Lov´asz ϑ function another operational meaning in zero-error classical-quantum communication.
We study the classical communication over quantum channels when assisted by no-signalling (NS) and PPT-preserving (PPT) codes. We first show that both the optimal success probability of a given transmission rate and one-shot ϵ-error capacity can be formalized as semidefinite programs (SDPs) when assisted by NS or NS∩PPT codes. Based on this, we derive SDP finite blocklength converse bounds for general quantum channels, which also reduce to the converse bound of Polyanskiy, Poor, and Verdu for classical channels. Furthermore, we derive an SDP strong converse bound for the classical capacity of a general quantum channel: for any code with a rate exceeding this bound, the optimal success probability vanishes exponentially fast as the number of channel uses increases. In particular, applying our efficiently computable bound, we derive improved upper bounds to the classical capacity of the amplitude damping channels and also establish the strong converse property for a new class of quantum channels.
We study zero-error communication and exact simulation of quantum channels assisted by quantum no-signalling correlations. For a channel with Kraus operator space
K, we introduce a semidefinite programming parameter
Γ(K) that is exactly multiplicative under tensor products and upper-bounds
ΘNS(K), where
log2ΘNS(K)=C0,NS(K) and
C0,NS(K) denotes the asymptotic quantum no-signalling-assisted zero-error capacity. Among known upper bounds on
ΘNS given by semidefinite programs,
Γ is the tightest. We also prove that the previously introduced simulation lower bound
Σ−(K) is exactly multiplicative and satisfies
ΘNS(K)≤Γ(K)≤Σ−(K)≤Γ(K)2. Using this multiplicativity, we show that neither
S0,NS(K)=log2Σ−(K) nor its regularized extension
S0,NS(K)=limn→∞n−1log2Σ−(K⊗n) holds in general. This answers an open question about the asymptotic simulation cost
S0,NS(K). For classical-quantum channels, we obtain sharp bounds. If
r is the effective output dimension, then
ΘNS≤Γ≤(1+r1/2)ΘNS/2 and
Γ≤Σ−≤(1+r1/2)Γ/2. If
k is the minimum rank of the output support projections, then
Σ−/ΘNS≤[(1+r1/2)/(1+k1/2)]2, and this bound is sharp for every
1≤k≤r. Thus, we obtain the sharp bound
S0,NS−C0,NS≤2log2[(1+r1/2)/(1+k1/2)].