Classical capacities of quantum channels with environment assistance

Siddharth Karumanchi, Stefano Mancini, Andreas Winter, Dong Yang

I Introduction

The noise in quantum communication is modelled by a quantum channel, which is a completely positive and trace preserving (CPTP) map on the set of states (density operators) of a system devoted to carry information. Note that this view contains classical channels as a special case (cf. ). Every quantum channel can be viewed as a unitary interaction between the information carrying system and an environment, where the latter is customarily considered not under control. Therefore, the initial environment state together with the unitary defines the channel when the final environment is traced out. In this standard picture, the initial environment state is simply fixed, and the environment output is completely lost. However, the possibility of an active helper, one that reads information from the channel environment and communicates it to the channel receiver, is an interesting one that has been considered before with some success . In the present paper, instead, we shall be concerned with a benevolent party (a helper, hence called Helen) setting the initial environment state in order to assist sender and receiver of the channel to communicate. We considered transmission of quantum information in this model in our earlier work . Here we look at classical communication: as in , we have a model of passive environment assistance, where Helen simply sets an initial state of the environment as part of the code, once and for all; likewise, we motivated to consider passive environment assistance with entanglement between Helen and the receiver Bob of the channel output. Because classical information, unlike quantum information, can be freely shared, here we can then contrast these passive models with one where Helen’s state can also depend on the message to be sent; we call it conferencing encoders, allowing local operations and classical communication (LOCC) between the sender Alice and Helen.

The structure of the paper is as follows: Section II introduces the notation and provides the details of the proposed models. Section III contains the coding theorems of passive environment assisted capacities. There, after making general observations, we also provide examples of super-additivity of capacities. Then, in Section IV we go on to study the entanglement environment assisted capacities. In the following Section V we make general observations about the conferencing encoders model, and go on to show that for a unitary operator the classical capacity with conferencing encoders is non-zero. Finally, the appendix give details of the parametrization for two-qubit unitaries (Appendix A).

II Notation and models

For any super-operator N:L(A)→L(B)\mathcal{N}:\mathcal{L}(A)\rightarrow\mathcal{L}(B) the induced trace norm is defined as

Furthermore, for any super-operator N:L(A)→L(B)\mathcal{N}:\mathcal{L}(A)\rightarrow\mathcal{L}(B) we will make use of the diamond norm defined as

Note that the maximum in this definition is attained on a rank-one operator ρ=∣ψ⟩⟨φ∣\rho=|\psi\rangle\langle\varphi|, with unit vectors ∣ψ⟩|\psi\rangle and ∣φ⟩|\varphi\rangle. If N\mathcal{N} is Hermitian-preserving, then the maximum is indeed attained on a pure state ρ=∣ψ⟩ ⁣⟨ψ∣\rho=|\psi\rangle\!\langle\psi|. For any super-operator N:L(A)→L(B)\mathcal{N}:\mathcal{L}(A)\rightarrow\mathcal{L}(B) the diamond norm and the induced trace norm are related as follows:

For a density operator αA\alpha^{A} the von Neumann entropy is defined as

For two density operators α\alpha and β\beta the quantum relative entropy of α\alpha with respect to β\beta is defined as

Furthermore, for any density operator ρAB\rho^{AB} on a bipartite system, the quantum mutual information is defined as

We have three presumably inequivalent models of classical communication, depending on role of the helper. In the first model under consideration, we assume that Helen sets the initial state of the environment to enhance the classical communication from Alice to Bob as depicted in Fig. 1. Since Helen has no role in the protocol after setting the initial environment state, this model is thus referred to as passive environment-assisted model.

We assume that there are no quantum correlations between Alice’s and Helen inputs. Consider a unitary or more generally an isometry W:A⊗E⟶B⊗FW:A\otimes E\longrightarrow B\otimes F, which defines the channel (CPTP map) N:L(A⊗E)→L(B)\mathcal{N}:\mathcal{L}(A\otimes E)\rightarrow\mathcal{L}(B), whose action on the input state ρ\rho on A⊗EA\otimes E is

Then, an effective channel Nη:L(A)→L(B)\mathcal{N}_{\eta}:\mathcal{L}(A)\rightarrow\mathcal{L}(B) is established between Alice and Bob once the initial state η\eta on EE is set:

For a given CPTP map N:L(A)→L(B)\mathcal{N}:\mathcal{L}(A)\rightarrow\mathcal{L}(B), we can consider the Stinespring isometry V:A⟶B⊗FV:A\longrightarrow B\otimes F. This is a special case of the above model where the initial environment EE is one-dimensional, i.e. Helen has no choice of the initial environment state. The classical capacity for the above case is given by the Holevo-Schumacher-Westmoreland theorem (cf. ),

where the quantum mutual information is evaluated with respect to the state

The maximization is over the ensembles {px,ρxAn}\{p_{x},\rho^{A^{n}}_{x}\} where the states ρxAn\rho^{A^{n}}_{x} are input across AnA^{n} . Here {∣x⟩}\{|x\rangle\} are the orthonormal basis of the classical reference system XX. It is known that the supremum over nn (the “regularization”) is necessary , except for some special channels .

When the encoding by the sender is restricted to separable states ρxAn\rho_{x}^{A^{n}}, i.e. convex combinations of tensor products ρxAn=ρ1xA1⊗…⊗ρnxAn\rho_{x}^{A^{n}}=\rho_{1x}^{A_{1}}\otimes\ldots\otimes\rho_{nx}^{A_{n}}, the classical communication capacity admits a single-letter characterization, given by the so-called Holevo information of quantum channel,

where the quantum mutual information is evaluated with respect to the state σ:=∑xpx∣x⟩ ⁣⟨x∣⊗N(ρxA)\sigma:=\sum\limits_{x}p_{x}|x\rangle\!\langle x|\otimes\mathcal{N}(\rho_{x}^{A}).

The ensemble that achieves the maximum in Eq. (13), say {px∗,ϕx∗}\{p^{*}_{x},\phi^{*}_{x}\}, is called the optimal ensemble. Let ϕavg∗=∑xpx∗ϕx∗\phi_{avg}^{*}=\sum\limits_{x}p^{*}_{x}\phi^{*}_{x} be the average of the optimal ensemble. From we know the existence of such an ensemble that achieves the Holevo information, and has the following relative entropic formulation,

For any ρA\rho^{A}, we have the following inequality,

with the equality holding for any member of the optimal ensemble. Also note that for a given channel N\mathcal{N}, though we can have many optimal ensembles that achieve the Holevo information, the average of the optimal ensemble is unique . An important class of channels which admit single-letter characterization of classical capacity i.e. C(N)=χ(N)C(\mathcal{N})=\chi(\mathcal{N}), are the entanglement-breaking channels . Actually, for any two entanglement-breaking channels, N1\mathcal{N}_{1} and N2\mathcal{N}_{2}, we have the following additivity property :

A variant of the passive environment-assisted model where Helen has pre-shared entanglement with Bob, thus referred to as entanglement-environment-assisted model, can also be considered. In such a case we can extend the notation of Nη=N(∙⊗η)\mathcal{N}_{\eta}=\mathcal{N}(\bullet\otimes\eta) and let, for a state κ\kappa on EKEK,

A new model called conferencing helper is introduced, where we contemplate the possibility of local operations and classical communication (LOCC) between Alice and Helen, thus allowing Helen to play an active role in the encoding process (in contrast to the previous models discussed above), see Fig. 2. Of course the possibility that Alice and Helen share entanglement has to be excluded otherwise we recover the situation of a quantum channel determined by Alice and Helen input system and Bob output obtained by tracing away part of the system. For a given unitary or more generally an isometry W:A⊗E⟶B⊗FW:A\otimes E\longrightarrow B\otimes F, which defines the channel N:L(A⊗E)→L(B)\mathcal{N}:\mathcal{L}(A\otimes E)\rightarrow\mathcal{L}(B), whose action on a input state is

the state ηi\eta_{i} can be adjusted according to the classical message with the proviso that the global input state of the systems AA and EE is separable.

Furthermore, we would mention that throughout the paper log⁡\log is intended as logarithm on base 22 and ln⁡\ln the natural logarithm. The binary entropy is denoted by

The cyclic shift operator X(x)X(x) and the phase operator Z(z)Z(z) acting on the computational basis {∣j⟩}0,1,2,...,d−1\{|j\rangle\}_{0,1,2,...,d-1} of a dd-dimensional Hilbert space are defined in the following way

Here the complex number ω=exp⁡(2πid)\omega=\exp(\frac{2\pi i}{d}) is a primitive dd-th root of unity and ii denotes the imaginary unit. Given the operators in Eq. (20), for each pair (x,z)(x,z), we can identify the discrete Weyl operator W(x,z)∈U(d)W(x,z)\in\rm U(d) defined as

III Passive Environment Assisted Capacities

In this Section we define the passive environment-assisted model rigorously and provide different notions of assisted codes, depending on the capabilities of Helen (whether she can input arbitrary entangled states across different instances of isometry or whether she is restricted to separable states). Furthermore, a capacity when Helen is restricted to separable states and Alice’s encoding is restricted to product state across nn instances of the channel is also considered.

A passive environment-assisted classical code of block length nn is a family of triples {αmAn,ηEn,Λm}\{\alpha_{m}^{A^{n}},\eta^{E^{n}},\Lambda_{m}\} with the error probability Pe‾:=1∣M∣∑mPe(m)\overline{P_{e}}:=\frac{1}{|M|}\sum_{m}P_{e}(m) and the rate 1nlog⁡∣M∣\frac{1}{n}\log|M|. A rate RR is achievable if there is a sequence of codes over their block length nn with Pe‾\overline{P_{e}} converging to and rate converging to RR. The passive environment-assisted classical capacity of WW, denoted by CH(W)C_{H}(W) or equivalently CH(N)C_{H}(\mathcal{N}), is the maximum achievable rate. If the helper is restricted to fully separable states ηEn\eta^{E^{n}}, i.e. convex combinations of tensor products ηEn=η1E1⊗⋯⊗ηnEn\eta^{E^{n}}=\eta_{1}^{E_{1}}\otimes\cdots\otimes\eta_{n}^{E_{n}}, the largest achievable rate is denoted CH⊗(W)=CH⊗(N)C_{H\otimes}(W)=C_{H\otimes}(\mathcal{N}).

As the error probability is linear in the environment state η\eta, without loss of generality η\eta may be assumed to be pure, for both unrestricted and separable helper. We shall assume this from now on, without necessarily specifying it each time.

For an isometry W:AE⟶BFW:AE\longrightarrow BF, the passive environment-assisted classical capacity is given by

where the mutual information is evaluated with respect to the state

and the maximization is over the ensemble {p(x),αxAn}\{p(x),\alpha^{A^{n}}_{x}\} and pure environment input states η(n)\eta^{(n)} on EnE^{n}.

Similarly, the capacity with separable helper is given by the formula,

where the maximum is only over (pure) product states, i.e. η(n)=η1⊗⋯⊗ηn\eta^{(n)}=\eta_{1}\otimes\cdots\otimes\eta_{n}.

As a consequence, CH(W)=lim⁡n→∞1nCH⊗(W⊗n)C_{H}(W)=\lim_{n\rightarrow\infty}\frac{1}{n}C_{H\otimes}(W^{\otimes n}).

The direct part (the “≥\geq” inequality), follows directly from the HSW theorem , applied to the channel (N⊗n)η(n)(\mathcal{N}^{\otimes n})_{\eta^{(n)}}; to be precise asymptotically many copies of this block-channel, so that the i.i.d. arguments hold true (cf. ).

For the converse part (the “≤\leq” inequality), consider a code of block length nn with error probability Pe‾\overline{P_{e}}. The state after encoding operation and action of the channel is given by

and the state after decoding operation is given by

The first inequality follows from the application of Fano’s inequality and the second one follows from the data processing inequality, where ϵ=1n+RPe‾\epsilon=\frac{1}{n}+R\overline{P_{e}}. Setting M=XM=X we have

As n→∞n\rightarrow\infty and Pe‾→0\overline{P_{e}}\rightarrow 0, the upper bound on the rate follows – depending on CHC_{H} or CH⊗C_{H\otimes}, without or with restrictions on η(n)\eta^{(n)}. ∎

The channel whose inputs are Alice and Helen and outputs Bob can be viewed as a quantum version of multiple access channels (MAC) with two senders and one receiver which was studied in . In such a model both Alice and Helen try to communicate their individual independent messages to Bob. The rates RA,RHR_{A},R_{H} at which Alice and Helen can respectively communicate with Bob gives the capacity region (RA,RH)(R_{A},R_{H}). If this capacity region is known, then the passive environment assisted capacity is given by max⁡{R:(R,0)∈capacity region}\max\{R:(R,0)\in\text{capacity region}\}. Whenever single letter characterization for a MAC is available this might be helpful in the evaluation of environment assisted capacities, but in general when the regularization is required this view may not help.

For separable helper, and when in addition Alice’s encoding is restricted to product input states, i.e.

Then, from Eq. (25), we have the product state capacity with separable helper given by

where the mutual information is evaluated with respect to the state σ:=∑xp(x)∣x⟩ ⁣⟨x∣⊗Nη(ρx)\sigma:=\sum\limits_{x}p(x)|x\rangle\!\langle x|\otimes\mathcal{N_{\eta}}(\rho_{x}) and the maximization is over the ensemble {p(x),ρx}\{p(x),\rho_{x}\} and the state ηE\eta^{E}.

For any ηE\eta^{E} and for all ρA\rho^{A} it is

where ωηB:=NηA→B(ρavg,ηA)\omega_{\eta}^{B}:=\mathcal{N}_{\eta}^{A\rightarrow B}(\rho_{avg,\eta}^{A}) and ρavg,ηA\rho_{avg,\eta}^{A} is the average of the optimal ensemble that achieves the Holevo information for Nη\mathcal{N_{\eta}}.

where the mutual information for the former case is evaluated with respect to the state σ:=∑xp(x)∣x⟩ ⁣⟨x∣⊗Nη(αx)\sigma:=\sum\limits_{x}p(x)|x\rangle\!\langle x|\otimes\mathcal{N}_{\eta}(\alpha_{x}) and the maximization is over the ensemble {p(x),αx}\{p(x),\alpha_{x}\} and the state ηE\eta^{E}. In the latter case, when Helen is the sender, the mutual information is evaluated with respect to the state μ:=∑xp(x)∣x⟩ ⁣⟨x∣⊗Mα(ηx)\mu:=\sum\limits_{x}p(x)|x\rangle\!\langle x|\otimes\mathcal{M}_{\alpha}(\eta_{x}) and the maximization is over the ensemble {p(x),ηx}\{p(x),\eta_{x}\} and the state αA\alpha^{A}. Here, the effective channels Nη:L(A)→L(B)\mathcal{N}_{\eta}:\mathcal{L}(A)\rightarrow\mathcal{L}(B) and Mα:L(E)→L(B)\mathcal{M}_{\alpha}:\mathcal{L}(E)\rightarrow\mathcal{L}(B) are respectively

is the minimum output entropy of the given unitary WW.

[Kretschmann/Schlingemann/Werner ] For any two quantum channels N1,N2:L(A)→L(B)\mathcal{N}_{1},\mathcal{N}_{2}:\mathcal{L}(A)\rightarrow\mathcal{L}(B) with Stinespring dilations V1,V2:A⟶B⊗FV_{1},V_{2}:A\longrightarrow B\otimes F, the following holds:

where the infimum is over the unitaries U:F⟶FU:F\longrightarrow F.

For any unitary W:A⊗E⟶B⊗FW:A\otimes E\longrightarrow B\otimes F, with ∣A∣=∣E∣=∣B∣=∣F∣=d|A|=|E|=|B|=|F|=d, it holds

This is a kind of uncertainty relation for \scalebox{1.5}{\chi}_{H\otimes}^{A} and \scalebox{1.5}{\chi}_{A\otimes}^{H}, saying that not both of them can be arbitrary small.

Let SWAP⁡:A⊗E⟶B⊗F\operatorname{SWAP}:A\otimes E\longrightarrow B\otimes F be the swap operator, defined by SWAP⁡(∣ψ⟩A⊗∣φ⟩E):=∣φ⟩B⊗∣ψ⟩F\operatorname{SWAP}(|\psi\rangle^{A}\otimes|\varphi\rangle^{E}):=|\varphi\rangle^{B}\otimes|\psi\rangle^{F}. Let us define a quantum channel which has dilation SWAP⁡\operatorname{SWAP} as follows

Assume \scalebox{1.5}{\chi}_{H\otimes}^{A}=\epsilon. Then, from Eq. (33), for all ηE\eta^{E} on EE and ρA\rho^{A} on AA,

where ωηB:=NηA→B(ρavg,ηA)\omega_{\eta}^{B}:=\mathcal{N_{\eta}}^{A\rightarrow B}(\rho_{avg,\eta}^{A}) and ρavg,ηA\rho_{avg,\eta}^{A} is the average of the optimal ensemble that achieves Holevo information for Nη\mathcal{N_{\eta}}. From the quantum Pinsker inequality , for all ρA\rho^{A} on AA

Using the relation between the induced trace norm and the diamond norm as expressed by Eq. (5), gives

From the left half of the continuity bound in Lemma 4, we have

where the minimum is achieved by UFU^{F}. The channels PαE→B(ηE):=TrF(W(α⊗η)W†)\mathcal{P}_{\alpha}^{E\rightarrow B}(\eta^{E}):=\textrm{Tr}_{F}(W(\alpha\otimes\eta)W^{{\dagger}}), and idE→B\textrm{id}^{E\rightarrow B} have the dilations WW and SWAP⁡\operatorname{SWAP} respectively. From the right half of the continuity bound, we get

Thus, from the continuity of χ\chi (see Eq. (124))

and \scalebox{1.5}{\chi}_{A\otimes}^{H}\geq\chi(\mathcal{P}_{\alpha}) (see Eq. (32)), we have

Then, rewriting the above inequality in terms of ϵ\epsilon,

The function f(ϵ)f(\epsilon) is non-negative for ϵ∈[0,ϵ0]\epsilon\in[0,\epsilon_{0}] with

Putting everything together for ϵ∈[0,ϵ0]\epsilon\in[0,\epsilon_{0}], we arrive at

As the function ϵ+f(ϵ)\epsilon+f(\epsilon) is monotonically decreasing in the interval ϵ∈(0,ϵ0]\epsilon\in(0,\epsilon_{0}], the minimum is attained at ϵ0\epsilon_{0}, thus we obtain

We present the uncertainty relation in the form of Eq. (55) motivated by the well-known entropic uncertainty relation . Actually we get a tighter lower bound on \scalebox{1.5}{\chi}_{A\otimes}^{H} as a function of \scalebox{1.5}{\chi}_{H\otimes}^{A}:=\epsilon from Eq. (51) as can be seen in the Fig. 4.

Let UU be a random gate in U(d2)\rm U(d^{2}) according to the Haar measure, then for any δ>0\delta>0,

It follows that when d→∞d\rightarrow\infty, by the concentration of measure phenomenon , with overwhelming probability

The classical capacity of a quantum channel is zero iff the channel maps all inputs to a constant output, i.e. the output of the channel is independent of the input. This helps us to identify the unitaries which have CH⊗=0C_{H\otimes}=0. These unitaries must have effective channels with constant output for every choice of the initial environment state. At least in the case when ∣A∣=∣F∣|A|=|F| and ∣B∣=∣E∣|B|=|E|, the unitary is the SWAP⁡\operatorname{SWAP}. Furthermore, for these unitaries, CH(SWAP⁡)=CH⊗(SWAP⁡)=0C_{H}(\operatorname{SWAP})=C_{H\otimes}(\operatorname{SWAP})=0.

III-B Controlled-unitaries

As we have noticed, the above defined passive assisted capacities, like the standard classical capacity of a quantum channel (cf. ), admit multi-letter characterizations, thus posing a hard optimization problem. It is therefore important to single out classes of unitaries, if any, for which we can reduce to the single-letter case. We focus on controlled-unitaries, which apart from allowing for a simple characterization of capacities, provide examples for interesting phenomena like super-additivity.

We say that a unitary operator UU is universally entanglement-breaking (resp. universally classical-quantum), if for every ∣η⟩∈E|\eta\rangle\in E, the effective channel Nη:L(A)→L(B)\mathcal{N}_{\eta}:\mathcal{L}(A)\rightarrow\mathcal{L}(B) is entanglement-breaking (resp. classical-quantum). The set of universally entanglement-breaking (resp. universally classical-quantum) unitaries is denoted E\mathfrak{E} (resp. CQ\mathfrak{CQ}).

For these unitaries, CH⊗C_{H\otimes} reduces to the single-letter case. Indeed, for any W∈EW\in\mathfrak{E}, we have

where the mutual information is evaluated with respect to the state σ:=∑xp(x)∣x⟩ ⁣⟨x∣⊗Nη(ρx)\sigma:=\sum\limits_{x}p(x)|x\rangle\!\langle x|\otimes\mathcal{N_{\eta}}(\rho_{x}) and the maximization is over the ensemble {p(x),ρx}\{p(x),\rho_{x}\}. This follows from additivity of Holevo information for entanglement-breaking channels,

Let us define a unitary operator Uc:A⊗E⟶B⊗FU_{c}:A\otimes E\longrightarrow B\otimes F with ∣A∣=∣B∣=∣E∣=∣F∣=d|A|=|B|=|E|=|F|=d as follows

Here {∣i⟩}\{|i\rangle\} denotes an orthonormal basis of AA and Ui∈U(d)U_{i}\in\rm U(d). When the initial environment state is ∣η⟩|\eta\rangle, the Kraus operators of the effective channel Nη:L(A)→L(B)\mathcal{N}_{\eta}:\mathcal{L}(A)\rightarrow\mathcal{L}(B) are given by Ki=Ui∣η⟩⟨i∣K_{i}=U_{i}|\eta\rangle\langle i|. Thus Nη\mathcal{N}_{\eta} is a classical-quantum channel for each choice of ∣η⟩|\eta\rangle, and as consequence Uc∈CQU_{c}\in\mathfrak{CQ}. Hence

For Uc⊗Vc:A′E′AE→B′F′BFU_{c}\otimes V_{c}:A^{\prime}E^{\prime}AE\rightarrow B^{\prime}F^{\prime}BF, the Kraus operators of the effective channel Nη:L(A⊗A′)→L(B⊗B′)\mathcal{N}_{\eta}:\mathcal{L}(A\otimes A^{\prime})\rightarrow\mathcal{L}(B\otimes B^{\prime}), when the initial state of the environments E′EE^{\prime}E is ∣η⟩|\eta\rangle, are Kij=(Ui⊗Vj)∣η⟩⟨ij∣K_{ij}=(U_{i}\otimes V_{j})|\eta\rangle\langle ij| which is also a classical-quantum channel. Hence Uc⊗Vc∈CQU_{c}\otimes V_{c}\in\mathfrak{CQ}. We can also say

Universal properties of bipartite unitary operators have been studied in although with different motivation than in this manuscript. As we are interested in evaluating environment-assisted capacities, we restrict the universal properties to pure environment states. We can extend the universal properties to a general density operators in the case of entanglement-breaking, and classical-quantum because of the convexity of these set of maps. In particular, they treat in full generality the question of bipartite unitaries which give constant channels for all input-environment states (see Theorem 2.4, Remark 2.5 of ) (cf. Remark 9 in which we restricted to the case when ∣A∣=∣F∣|A|=|F| and ∣B∣=∣E∣|B|=|E|).

We have identified unitaries with CH=0C_{H}=0. It is much harder to characterize unitaries with quantum capacity QH=0Q_{H}=0 . SWAP⁡\operatorname{SWAP} was the only unitary which was identified to have QH=0Q_{H}=0. It was also conjectured there that SWAP⁡\sqrt{\operatorname{SWAP}} has zero passive environment assisted capacity. From the previous discussions UcU_{c} has zero passive environment assisted quantum capacity. When an arbitrary initial environment state ∣η⟩(n)|\eta\rangle^{(n)} is input across EnE^{n}, the effective channel Nη(n):An→Bn\mathcal{N}_{\eta^{(n)}}:A^{n}\rightarrow B^{n} is classical-quantum channel, thus the quantum capacity of the effective channel is Q(Nη(n))=0Q(\mathcal{N}_{\eta^{(n)}})=0. As a consequence of coding theorems for transmission of quantum information with a passive separable helper (QH⊗Q_{H\otimes}) and passive helper (QHQ_{H}), they are related by QH(Uc)=lim⁡n→∞1nQH⊗(Uc⊗n)Q_{H}(U_{c})=\lim_{n\rightarrow\infty}\frac{1}{n}Q_{H\otimes}(U_{c}^{\otimes n}). Thus QH(Uc)=0Q_{H}(U_{c})=0.

The maximum is attained at ∣c0∣2=q=12|c_{0}|^{2}=q=\frac{1}{2} and it is

III-C Super-additivity

In this Subsection, we find two unitaries such that when they are used in conjunction, and their initial environments are entangled, they transmit more classical information than the sum of the classical information transferred by them individually. This phenomenon is called super-additivity.

The following examples use the setting and notations of Fig. 5.

Let Vc=∑i=02∣i⟩F⟨i∣A⊗ViE→BV_{c}=\sum\limits_{i=0}^{2}|i\rangle^{F}\langle i|^{A}\otimes V^{E\rightarrow B}_{i} act on 2 qutrit systems and ViV_{i} given as

We can use Eq. (63) to evaluate CH⊗(Vc)C_{H\otimes}(V_{c}), namely

Consider the scenario in Fig. 5, where Helen inputs a state ∣Φ⟩=12(∣00⟩+∣11⟩)|\Phi\rangle=\frac{1}{\sqrt{2}}(|00\rangle+|11\rangle) across EE′EE^{\prime}. In such a scenario the effective channel is NΦ:AA′→BB′\mathcal{N}_{\Phi}:AA^{\prime}\rightarrow BB^{\prime} and when we input {∣00⟩,∣01⟩,∣02⟩}\{|00\rangle,|01\rangle,|02\rangle\} in A′AA^{\prime}A the outputs in B′BB^{\prime}B result respectively

which are orthogonal, thus making the classical capacity of the effective channel equal to log⁡3\log 3. Therefore

since SWAP⁡\operatorname{SWAP} has zero passive environment assisted capacities (see Remark 9).

Let us consider Vc:AE→BFV_{c}:AE\rightarrow BF with ∣A∣=∣F∣=d2,∣E∣=∣B∣=d|A|=|F|=d^{2},|E|=|B|=d, given by

IV Entanglement-environment-assisted capacity

As we have noticed in the previous Section, SWAP⁡\operatorname{SWAP}, in spite of having no communication capabilities with passive environment assistance on its own, can indeed enhance the classical communication when used in conjunction with other specific unitaries. In other words SWAP⁡\operatorname{SWAP} acts like a “dummy” channel but helps to establish entanglement between the receiver and the initial environment, as shown in Fig. 6. This is equivalent to sharing an entangled state between Helen and Bob which motivates us to rigorously define the following model of communication.

An entanglement-environment-assisted classical code of block length nn is a family of triples {αmAn,κEnK,Λm}\{\alpha_{m}^{A^{n}},\kappa^{E^{n}K},\Lambda_{m}\} with error probability Pe‾:=1∣M∣∑mPe(m)\overline{P_{e}}:=\frac{1}{|M|}\sum_{m}P_{e}(m) and rate 1nlog⁡∣M∣\frac{1}{n}\log|M|. A rate RR is achievable if there is a sequence of codes over their block length nn with Pe‾\overline{P_{e}} converging to and rate converging to RR. The entanglement-assisted environment classical capacity of WW, denoted by CEH(W)C_{EH}(W) or equivalently CEH(N)C_{EH}(\mathcal{N}), is the maximum achievable rate.

For an isometry W:AE⟶BFW:AE\longrightarrow BF, the entanglement-environment-assisted classical capacity is given by

where the mutual information is evaluated with respect to the state

and the maximization is over the ensemble {p(x),αxAn}\{p(x),\alpha^{A^{n}}_{x}\} and pure environment input states κ(n)\kappa^{(n)} on EnKE^{n}K.

The direct part (the “≥\geq” inequality), follows directly from the HSW Theorem (cf. ).

For the converse part (the “≤\leq” inequality), consider a code of block length nn with error probability Pe‾\overline{P_{e}}. The state after encoding operation and action of the channel is given by

and the state after decoding operation is given by

The first inequality follows from the application of Fano’s inequality and the second one follows from the data processing inequality, where ϵ=1n+RPe‾\epsilon=\frac{1}{n}+R\overline{P_{e}}. Setting M=XM=X we have

As n→∞n\rightarrow\infty and ϵ→0\epsilon\rightarrow 0, the upper bound on the rate follows. ∎

The classical capacity assisted by entangled states of the form κEnKn=κE1K1⊗⋯⊗κEnKn\kappa^{E^{n}K^{n}}=\kappa^{E_{1}K_{1}}\otimes\cdots\otimes\kappa^{E_{n}K_{n}} in Definition 13 is denoted by CEH⊗(W)C_{EH\otimes}(W), in analogy with CH⊗(W)C_{H\otimes}(W). Thus, we can say for UcU_{c} (from Eq. (64)),

As a consequence CEH⊗C_{EH\otimes} admits a single-letter characterization for UcU_{c} given by

For two unitary operators {U1,U2}∈SU(2)\{U_{1},U_{2}\}\in\rm SU(2) with probability {p1,p2}\{p_{1},p_{2}\}, we have

where ∣μ⟩|\mu\rangle is a pure state in AA and ∣γ⟩|\gamma\rangle is a pure state in ARAR.

We can use Lemma 15 to evaluate CEH⊗C_{EH\otimes} for the universally classical-quantum two-qubit unitary interactions. It results

which shows that entanglement does not enhance the classical capacity in this case. But clearly from the examples of super-additivity presented in the Subsection III-C, we can see that pre-shared entanglement between Helen and Bob does indeed increase the classical communication capability.

V Conferencing sender and helper

In this Section we define the capacity with conferencing encoders, that is when Alice and Helen can freely communicate classical messages. A product state capacity with conferencing encoders is also defined when Alice and Helen are respectively restricted to product state encoding.

A classical code for conferencing encoders of block length nn is a family of triples (∣αm⟩An,∣ηm⟩En,Λm)(|\alpha_{m}\rangle^{A^{n}},|\eta_{m}\rangle^{E^{n}},\Lambda_{m}) with the error probability Pe‾:=1∣M∣∑mPe(m)\overline{P_{e}}:=\frac{1}{|M|}\sum_{m}P_{e}(m) and rate 1nlog⁡∣M∣\frac{1}{n}\log|M|. A rate RR is achievable if there is a sequence of codes over their block length nn with Pe‾\overline{P_{e}} converging to and rate converging to RR. The classical capacity with conferencing encoders of WW denoted by Cconf(W)C_{\rm conf}(W) or equivalently Cconf(N)C_{\rm conf}(\mathcal{N}) is the maximum achievable rate. If the sender and helper are restricted to fully separable states αmAn\alpha^{A^{n}}_{m} and ηmEn\eta^{E^{n}}_{m} , i.e. convex combinations of tensor products ηmEn=(η1mE1⊗⋯⊗ηnmEn)\eta^{E^{n}}_{m}=(\eta_{1m}^{E_{1}}\otimes\cdots\otimes\eta_{nm}^{E_{n}}), and αmAn=(α1mA1⊗⋯⊗αnmAn)\alpha^{A^{n}}_{m}=(\alpha_{1m}^{A_{1}}\otimes\cdots\otimes\alpha_{nm}^{A_{n}}) for all mm the largest achievable rate is denoted Cconf⊗(W)=Cconf⊗(N)C_{\rm conf\otimes}(W)=C_{\rm conf\otimes}(\mathcal{N}) and henceforth referred to as classical capacity with product conferencing encoders.

For an isometry W:AE⟶BFW:AE\longrightarrow BF, the classical capacity of conferencing encoders model is given by

where the mutual information is evaluated with respect to the state

and the maximization is over the ensemble {p(x),αxAn⊗ηxEn}\{p(x),\alpha^{A^{n}}_{x}\otimes\eta_{x}^{E^{n}}\}. The classical capacity with product conferencing encoders is given by

where the mutual information is evaluated with respect to the state

and the maximization is over the ensemble {p(x),αxA⊗ηxE}\{p(x),\alpha^{A}_{x}\otimes\eta_{x}^{E}\}.

The direct part, “≥\geq” inequality, of the coding theorem follows from the HSW Theorem (cf. ). For the converse part, “≤\leq” inequality, consider a code of block length nn with error probability Pe‾\overline{P_{e}}. The state after encoding operation and action of the channel is given by

and the state after decoding operation is given by

The first inequality follows from the application of Fano’s inequality and the second one follows from the data processing inequality, where ϵ=1n+RPe‾\epsilon=\frac{1}{n}+R\overline{P_{e}}. Setting M=XM=X we have

As n→∞n\rightarrow\infty and Pe‾→0\overline{P_{e}}\rightarrow 0, the upper bound on the rate follows for Cconf⁡\operatorname{C_{conf}}. For Cconf⊗⁡\operatorname{C_{conf\otimes}} we have an additional step, namely the additivity of mutual information. ∎

From Theorem 17 it is also clear that Cconf(W)=lim⁡n→∞1nCconf⊗(W⊗n)C_{\rm conf}(W)=\lim_{n\rightarrow\infty}\frac{1}{n}C_{\rm conf\otimes}(W^{\otimes n}).

In classical information theory, conferencing encoders for MAC were introduced in where coding theorems were provided. Here each sender can gain partial knowledge of the other sender(s) message through conferencing, i.e. a noiseless exchange of messages, eventually constrained to occur at a given rate. This is an example of “cooperation” which is receiving an increasing attention in classical communication systems (see for e.g. ), while it is still very rarely considered in the quantum domain. An exception is provided by where the results of have been extended to classical-quantum MAC (both the inputs being classical and output quantum). In the conferencing encoders model, unlike , we assume free classical communication between Alice and Helen, with both of them aiming to send the same message. We must remark here that the use of this resource, i.e. free classical communication between Alice and Helen, does not trivialize the task as the global input state is still restricted to the set of separable states.

Entanglement played a peculiar role in the passive environment-assisted capacities and entanglement-environment-assisted capacities. We shall see in this Section that this is also true for the case of conferencing encoders. We consider the following example to highlight the role of entanglement with conferencing encoders.

Let us assume ∣A∣=∣B∣=∣E∣=∣F∣=d|A|=|B|=|E|=|F|=d. From Eq. (87) we see that

where Smin(U)S_{\rm min}(U) is the minimum output entropy of UU as defined in Eq. (37).

For a given unitary U:A⊗E⟶B⊗FU:A\otimes E\longrightarrow B\otimes F, the Shor’s augmented unitary Uaug:A0⊗E⟶B⊗F0U^{\rm aug}:A_{0}\otimes E\longrightarrow B\otimes F_{0} with A0=L⊗AA_{0}=L\otimes A and F0=F⊗LF_{0}=F\otimes L, where ∣L∣=d2|L|=d^{2}, is depicted by the quantum circuit in Fig. 9. Then for any environment state η\eta, the effective channel for UaugU^{\rm aug} is given by

Here W(x,z)W(x,z) are the discrete Weyl operators. Then, for the augmented unitary,

For any given unitaries W1:A⊗E⟶B⊗FW_{1}:A\otimes E\longrightarrow B\otimes F and W2:A′⊗E′⟶B′⊗F′W_{2}:A^{\prime}\otimes E^{\prime}\longrightarrow B^{\prime}\otimes F^{\prime} we can ask whether the product conferencing encoders capacity is additive, i.e. whether the following equality holds true

Now with the following example we show that the above inequality is strict in general.

From Lemma 7, we can guarantee the existence of a unitary V:A⊗E⟶B⊗FV:A\otimes E\longrightarrow B\otimes F (here all the parties are of equal dimension dd) with the following lower bound on the minimum entropy:

Now consider V∗:A′⊗E′⟶B′⊗F′V^{*}:A^{\prime}\otimes E^{\prime}\longrightarrow B^{\prime}\otimes F^{\prime} where the primed systems are isomorphic to the unprimed ones. Here V∗V^{*} is the conjugate of VV. It is useful to note that

The unitaries of interest are the Shor augmented unitaries VaugV^{\rm aug} and V∗augV^{*\rm aug}. From Eq. (95) we have

Let us evaluate the product conferencing encoders capacity of Vaug⊗V∗augV^{\rm aug}\otimes V^{*\rm aug}. As Vaug⊗V∗augV^{\rm aug}\otimes V^{*\rm aug} is isomorphic to (V⊗V∗)aug(V\otimes V^{*})^{\rm aug}, from Eq. (95), we have

When Alice inputs a maximally entangled state across AA′AA^{\prime}, denoted by ∣Φ⟩AA′|\Phi\rangle^{AA^{\prime}}, Helen inputs a maximally entangled state across EE′EE^{\prime}, denoted by ∣Φ⟩EE′|\Phi\rangle^{EE^{\prime}} the following holds true

Thus Smin(V⊗V∗)=0S_{\rm min}(V\otimes V^{*})=0, and from Eq. (101), we have

exhibiting the role of entanglement in enhancing conferencing communication. We would like to emphasise that in this example entanglement enables us to send the entire bandwidth, without which we can only send paltry amount of information.

V-B The classical capacity with conferencing encoders is always non-zero

From Remark 9, we have seen that SWAP⁡\operatorname{SWAP} has CH=0C_{H}=0. Now, when conferencing is allowed, i.e. Alice and Helen are on the same footing as the sender of information, we can send classical information at the maximum rate. This motivates us to study whether some positive amount of classical information can always be transmitted with conferencing encoders.

From the definition of Cconf⊗C_{\rm conf\otimes} and the previously defined quantities \scalebox{1.5}{\chi}^{A}_{H\otimes}, \scalebox{1.5}{\chi}^{H}_{A\otimes} (see Section III-A) we can see that

Thus, for a unitary U:A⊗E⟶B⊗FU:A\otimes E\longrightarrow B\otimes F with ∣A∣=∣B∣=∣E∣=∣F∣=d|A|=|B|=|E|=|F|=d, we can invoke the uncertainty relation of Theorem 5, to give a lower bound on the Cconf⊗C_{\rm conf\otimes} which reads as

Now we derive a lower bound when the dimensions of A,B,E,FA,B,E,F are not equal.

Given a unitary U:A⊗E⟶B⊗FU:A\otimes E\longrightarrow B\otimes F with ∣A∣∣E∣=∣B∣∣F∣|A||E|=|B||F|, then

Let Cconf⊗(U)=δC_{\rm conf\otimes}(U)=\delta. Then, from the quantum Pinsker inequality , we have

where ΩB:=∑piN(αiA⊗ηiE)\Omega^{B}:=\sum p_{i}\mathcal{N}(\alpha_{i}^{A}\otimes\eta_{i}^{E}), the output of average of the ensemble {pi,αiA⊗ηiE}\{p_{i},\alpha_{i}^{A}\otimes\eta_{i}^{E}\} which achieves the product conferencing capacity. Let us now consider the set of density operators {σm.nY}\{\sigma^{Y}_{m.n}\} defined as follows:

Here {∣m⟩}\{|m\rangle\} denote the computational basis of the Hilbert space YY. The set {σm,n}\{\sigma_{m,n}\} spans L(Y)\mathcal{L}(Y). Also {σm,nA}⊗{σo,pE}\{\sigma^{A}_{m,n}\}\otimes\{\sigma^{E}_{o,p}\} spans L(A⊗E)\mathcal{L}(A\otimes E). Thus for an arbitrary state on AEAE, we can write

The maximization is over all the indices with at least one of the primed indices not equal to unprimed indices. From Eq. (109) we can see that maximum is indeed reached for the case when exactly one primed index is different from the unprimed ones. Now

which is due to the application of triangle inequality. From Eq. (108) and Eq. (111) we have

Let us further choose two states ρiAE:=U†(ωiB⊗κiF)U\rho_{i}^{AE}:=U^{{\dagger}}(\omega_{i}^{B}\otimes\kappa_{i}^{F})U with the property that \mathopen{}\mathclose{{}\left\|\omega_{1}-\omega_{2}}\right\|_{1}=2, i.e they are perfectly distinguishable states. We will hence have

Hence, it must be 83δln⁡2(∣A∣∣E∣)2≥1\sqrt{\frac{8}{3}\delta\ln 2}(|A||E|)^{2}\geq 1, otherwise we have a contradiction. This leads to \delta\geq\frac{3}{8\ln 2}\mathopen{}\mathclose{{}\left(\frac{1}{|A||E|}}\right)^{4}. ∎

It follows that when d→∞d\rightarrow\infty, by the concentration of measure phenomenon , with overwhelming probability

For two-qubit unitaries a much tighter lower bound can be found which actually coincides with the upper bound, so giving the classical capacity with conferencing encoders.

In the qubit case, i.e. ∣A∣=∣E∣=∣B∣=∣F∣=2|A|=|E|=|B|=|F|=2, for any unitary U:A⊗E⟶B⊗FU:A\otimes E\longrightarrow B\otimes F we have

Let UU be a two-qubit unitary. For its adjoint U†U^{\dagger} we have

where ∣Φi⟩AE|\Phi_{i}\rangle^{AE} are generically entangled across AEAE.

Now, note that the subspace spanned by ∣Φ0⟩AE|\Phi_{0}\rangle^{AE} and ∣Φ1⟩AE|\Phi_{1}\rangle^{AE} contains at least one product state . Say that

is a product state in AEAE. For each choice of ∣ϕ⟩B|\phi\rangle^{B} we can find

such that U†(∣ϕ⟩B⊗∣ψ⟩F)U^{{\dagger}}(|\phi\rangle^{B}\otimes|\psi\rangle^{F}) is a product state in AEAE. Let ∣ψ0⟩F|\psi_{0}\rangle^{F} and ∣ψ1⟩F|\psi_{1}\rangle^{F} be such states for the choices ∣0⟩B|0\rangle^{B} and ∣1⟩B|1\rangle^{B} respectively of ∣ϕ⟩B|\phi\rangle^{B}. Hence, for a given UU, we can find two input states which are product across AEAE,

such that we have two orthogonal output signals in system BB, thus achieving the capacity of 1 bit. ∎

The capacities CHC_{H}, CH⊗C_{H\otimes}, CEHC_{EH}, CconfC_{\rm conf} and CconfC_{\rm conf} are continuous in the channel, with respect to the diamond (or completely bounded) norm. Concretely, if \mathopen{}\mathclose{{}\left\|\mathcal{N}-\mathcal{M}}\right\|_{\diamond}\leq\epsilon, then we have:

Since each of these capacities are expressed in terms of the quantum mutual information of a classical-quantum state, and the optimization is over extra parameters due to the initial environment state, the above results can be obtained following the same arguments as in ; cf. . One distinction being the usage of the improved Alicki-Fannes continuity bound for conditional entropy compared to the original form of Alicki-Fannes as used in .

VI Conclusions

We have laid the foundations of classical communication with environment assistance at the input. In such a model a benevolent helper is able to select the initial environment state of the channel, modelled as unitary interaction.They admit multi-letter formula, both for the unrestricted and separable helper, which are hard to compute. These capacities are continuous like the unassisted ones, which are special case of our model. We further identified a class of unitaries which admit single-letter formula for the transmission of classical capacity with separable helper. Also, we have shown super-additivity for both CH⊗C_{H\otimes} and CHC_{H}. Due to the unique role SWAP⁡\operatorname{SWAP} plays in the examples of super-additivity, we considered entanglement-environment-assisted capacities, where there is a pre-shared entanglement between the helper and receiver.

The UcU_{c} (as defined in Section III-B) constitute an interesting class of unitaries which are universally classical-quantum (∈CQ\in\mathfrak{CQ}). In fact the CH⊗C_{H\otimes} and CEH⊗C_{EH\otimes} admits single-letter characterization. The capacity can be related to the problem of distinguishability of unitaries, when Holevo quantity is a measure of distinguishability. When we consider the distinguishability as mentioned in (i.e. with ancillary system), this is equal to CEH⊗(Uc)C_{EH\otimes}(U_{c}). So, the additivity of these quantities can be related to the additivity of distinguishability for unitary operations.

We have introduced a conferencing encoders model where the sender and the helper are equipped with LOCC. Like the previous environment assisted models, they admit a regularized formulae and are continuous. For a given unitary we can always transmit non-zero amount of classical information using a conferencing helper model. It would be interesting to find unitaries (if they exist) such that CHAC_{H}^{A} and CAHC_{A}^{H} are small but CconfC_{\rm conf} is large. At least in the case of unitaries where all the parties have equal dimensions, we can rule out such a possibility. This is due to the fact that a small CHAC_{H}^{A} implies a large CAHC_{A}^{H} due to an uncertainty type relation, thus making CconfC_{\rm conf} large. Furthermore, we have evaluated the classical capacity for conferencing encoders for two-qubit unitaries, which turns out to be 1 bit. The computation of unrestricted helper capacities CH,CEH,CconfC_{H},C_{EH},C_{\rm conf} is a major open problem.

Finally, it is worth noticing that if Helen exploits entanglement across channel uses we get memory effects on communication, hence the present study can shed further light on the subject of memory quantum channels .

Acknowledgements

SK thanks the Universitat Autònoma de Barcelona for kind hospitality. AW’s work is supported by the European Commission (STREP “RAQUEL”), the European Research Council (Advanced Grant “IRQUAT”), the Spanish MINECO (project FIS2013-40627-P), with the support of FEDER funds, as well as by​ ​the ​​Generalitat de Catalunya CIRIT, project 2014-SGR-966. DY’s work was supported by the European Research Council (Advanced Grant “IRQUAT”) and the NSFC (Grant No. 11375165).

Appendix A Parametrization of two-qubit unitaries

A general two-qubit unitary interaction can be described by 1515 real parameters. For the analysis of classical capacities under consideration we follow the arguments used in to reduce the parameters to 33 by the action of local unitaries with some further observations in . According to the definition of capacities, the local unitaries on AA, BB, EE and FF do not affect the environment-assisted classical capacity, as they could be incorporated into the encoding and decoding maps, respectively, or can be reflected in a different choice of environment state.

Any two-qubit unitary interaction VAEV^{AE} is equivalent, up to local unitaries before and after the VAEV^{AE}, to one of the form

where σx\sigma_{x}, σy\sigma_{y} and σz\sigma_{z} are the Pauli operators and π2≥αx≥αy≥∣αz∣≥0\frac{\pi}{2}\geq\alpha_{x}\geq\alpha_{y}\geq|\alpha_{z}|\geq 0. Furthermore the λk\lambda_{k}s are

and the ∣Φk⟩|\Phi_{k}\rangle are the so-called “magic basis” vectors

This is of course the familiar Bell basis, but with peculiar phases.

describes all two-qubit unitaries up to local basis choice . This forms a tetrahedron with vertices (0,0,0)(0,0,0), (π2,0,0)(\frac{\pi}{2},0,0), (π2,π2,−π2)(\frac{\pi}{2},\frac{\pi}{2},-\frac{\pi}{2}) and (π2,π2,π2)(\frac{\pi}{2},\frac{\pi}{2},\frac{\pi}{2}).

As we are interested in evaluating the capacities of unitaries, we use,

where U∗U^{*} is the complex conjugate of UU. Note that the latter has the same environment-assisted classical capacities; indeed, any code for UU is transformed into one for U∗U^{*} by taking complex conjugates. The reduced parameter space given by

describes all two-qubit unitaries up to local basis choice and complex conjugation (we should note that in general U⊗VU\otimes V and U⊗V∗U\otimes V^{*} have different environment assisted capacities and in such cases we should consider Ttotal\mathfrak{T}_{total}, say for example to provide a complete characterization of super-additivity). This forms a tetrahedron with vertices (0,0,0)(0,0,0), (π2,0,0)(\frac{\pi}{2},0,0), (π2,π2,0)(\frac{\pi}{2},\frac{\pi}{2},0) and (π2,π2,π2)(\frac{\pi}{2},\frac{\pi}{2},\frac{\pi}{2}).

Now when we apply SWAP⁡\operatorname{SWAP} to Uc′(d)U^{{}^{\prime}}_{c}(d) i.e., the unitary of interest, \operatorname{SWAP}\cdot U^{\prime}_{c}(d)=U\mathopen{}\mathclose{{}\left(\frac{\pi}{2},\frac{\pi}{2},\frac{\pi}{2}+d}\right) is outside the parameter tetrahedron T\mathfrak{T}. From Eq. (128), we get U\mathopen{}\mathclose{{}\left(\frac{\pi}{2},\frac{\pi}{2},\frac{\pi}{2}+d}\right)=U^{*}\mathopen{}\mathclose{{}\left(\frac{\pi}{2},\frac{\pi}{2},\frac{\pi}{2}-d}\right), upto local unitaries, which lie in the parameter space. In essence, up to local unitaries and complex conjugation Uc(2):=∑i=01∣i⟩F⟨i∣A⊗UiE→BU_{c(2)}:=\sum\limits_{i=0}^{1}|i\rangle^{F}\langle i|^{A}\otimes U_{i}^{E\rightarrow B} has parameters (π2,π2,u)(\frac{\pi}{2},\frac{\pi}{2},u) where u=π2−du=\frac{\pi}{2}-d.

References