# Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback

We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we conclude that a classical feedback channel does not improve the classical capacity of a quantum erasure channel, and by taking into account energy constraints, we conclude the same for a pure-loss bosonic channel. The method for establishing the aforementioned entropy bound involves identifying an information measure having two key properties: 1) it does not increase under a one-way local operations and classical communication channel from the receiver to the sender and 2) a quantum channel from sender to receiver cannot increase the information measure by more than the maximum output entropy of the channel. This information measure can be understood as the sum of two terms, with one corresponding to classical correlation and the other to entanglement.

## Authors

• 6 publications
• 8 publications
• 2 publications
• 36 publications
05/31/2018

### New lower bounds to the output entropy of multi-mode quantum Gaussian channels

We prove that quantum thermal Gaussian input states minimize the output ...
04/25/2019

### A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity

Based on Arimoto's work in 1978, we propose an iterative algorithm for c...
02/04/2022

### Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games

Can quantum entanglement increase the capacity of (classical) covert cha...
05/29/2018

### Well defined quantum key distribution using calibration, synchronization, and a programmable quantum channel

Well defined quantum key distribution between two users requires both ca...
08/27/2020

### Quantum information theory and Fourier multipliers on quantum groups

In this paper, we compute the exact value of the classical capacity and ...
11/26/2018

### Quantum Shockwave Communication

We present a scheme to produce shockwaves in quantum fields by means of ...
03/15/2021

### On entanglement assistance to a noiseless classical channel

For a classical channel, neither the Shannon capacity, nor the sum of co...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## I Introduction

A famous result of Shannon is that a free feedback channel does not increase the capacity of a classical channel for communication [1]. That is, the feedback-assisted capacity is equal to the channel’s mutual information. Shannon’s result indicates that the mutual information formula for capacity is particularly robust, in the sense that, a priori, one might consider a feedback channel to be a strong resource for assisting communication.

With the rise of quantum information theory, several researchers have found variations and generalizations of Shannon’s aforementioned result, in the context of communication over quantum channels. For example, Bowen proved that the capacity of a quantum channel for sending classical messages, when assisted by a free quantum feedback channel, is equal to the channel’s entanglement-assisted capacity [2], which is in turn equal to the mutual information of a quantum channel [3, 4, 5]. This result indicates that the mutual information of a quantum channel is robust, in a sense similar to that mentioned above. The result also indicates that the best strategy, in the limit of many channel uses, is to use the quantum feedback channel once in order to establish sufficient shared entanglement between the sender and receiver, and to subsequently employ an entanglement-assisted communication protocol [3, 4, 5]. Bowen’s result was strengthened to a strong converse statement in [6, 7]. Bowen et al. proved that the capacity of an entanglement-breaking channel for sending classical messages is not increased by a free classical feedback channel [8], and this result was strengthened to a strong converse statement in [9]. Ref. [10] discussed several inequalities relating the classical capacity assisted by classical feedback to other capacities. At the same time, it is known that in general there can be an arbitrarily large gap between the unassisted classical capacity and the classical capacity assisted by classical feedback [11].

Our aim here is to go beyond [8] to establish an upper bound on the classical capacity of an arbitrary, not just entanglement-breaking, quantum channel assisted by a classical feedback channel. Due to the fact that a quantum feedback channel is a stronger resource than a classical feedback channel, an immediate consequence of Bowen’s result [2] is that the entanglement-assisted capacity is an upper bound on the classical capacity assisted by classical feedback. However, since a quantum channel can, in general, establish quantum entanglement [12, 13, 14] and entanglement can increase capacity [3, 4, 5], in such cases it may appear difficult to establish an upper bound on this capacity other than the entanglement-assisted capacity. Our main result is that this is actually possible: we prove here that the maximum output entropy of a quantum channel is an upper bound on its classical capacity assisted by classical feedback. As a generalization of this result, we find that the maximum average output entropy is an upper bound on the same capacity for a channel that is a probabilistic mixture of other channels.

The approach that we take for establishing the aforementioned bounds is similar in spirit to approaches used to bound other assisted capacities or protocols [15, 16, 17, 18]. We identify an information measure that has two key properties: 1) it does not increase under a free operation, which in this case is a one-way local operations and classical communication (1W-LOCC) channel from the receiver to the sender, and 2) a quantum channel from sender to receiver cannot increase the information measure by more than the maximum output entropy of the channel. This information measure can be understood as the sum of two terms, with one corresponding to classical correlation and the other to entanglement.

We organize the rest of the paper as follows. Section II provides a formal definition of a protocol for classical communication over a quantum channel assisted by classical feedback. Section III discusses explicitly how to purify such a protocol, which is an important conceptual step for our analysis. Section IV introduces our key information measure and several important supplementary lemmas regarding it. Section V then employs this information measure and the supplementary lemmas to establish the maximum output entropy bound for classical capacity assisted by classical feedback. We apply this bound to the erasure channel and pure-loss bosonic channel in Section VI. We conclude in Section VII.

## Ii Protocol for classical communication over a quantum channel assisted by classical feedback

To begin with, let , let , and let . Let be a quantum channel, and let be a Hamiltonian acting on the input system of . An protocol for classical communication over a quantum channel consists of uses of the quantum channel , along with the assistance of a classical feedback channel from the receiver Bob to the sender Alice, in order for Alice to send one of

messages to Bob such that the error probability is no larger than

. Furthermore, the average state at the input of each channel use should have energy no larger than , when taken with respect to the Hamiltonian .

In more detail, the protocol consists of an initial classical–quantum state , with classical and quantum, of the form

 σF0B′1=∑f0p(f0)|f0⟩⟨f0|F0⊗σf0B′1. (1)

It also involves encoding channels, with each one denoted by for , as well as decoding channels, with each of them denoted by for . Note that all systems are classical because the feedback channel is constrained to be a classical channel. So this means that each decoding channel is a quantum instrument. The final decoding is denoted by .

We now detail the form of such a protocol. It begins with Alice preparing the following classical–quantum state:

 ρWA′0≡1MM∑m=1|m⟩⟨m|W⊗ρmA′0, (2)

for some set of quantum states. The global initial state is then . Alice then performs the encoding channel and the state becomes as follows:

 ω(1)WA′1A1B′1≡E1A′0F0→A′1A1(ρWA′0⊗σF0B′1). (3)

Alice transmits the system through the first use of the channel , resulting in the following state:

 ρ(1)WA′1B1B′1≡NA1→B1(ω(1)WA′1A1B′1). (4)

Bob processes his systems with the decoding channel and Alice acts with the encoding channel , resulting in the state

 ω(2)WA′2A2B′2≡(E2A′1F1→A′2A2∘D1B1B′1→F1B′2)(ρ(1)WA′1B1B′1). (5)

This process iterates more times, resulting in the following states:

 ρ(i)WA′iBiB′i≡NAi→Bi(ω(i)WA′iAiB′i), (6)
 ω(i+1)WA′i+1Ai+1B′i+1≡(Ei+1A′iFi→A′i+1Ai+1∘DiBiB′i→FiB′i+1)(ρ(i)WA′iBiB′i), (7)

for . The final decoding (measurement) channel  results in the following state:

 ρW^W≡(TrA′n∘DnBnB′n→^W)(ρ(n)WA′nBnB′n). (8)

Figure 1 depicts the above protocol for .

For an protocol, the following is satisfied

 12∥∥¯¯¯¯ΦW^W−ρW^W∥∥1≤ε, (9)

where is the maximally classically correlated state. Note that , where

here denotes the uniform random variable corresponding to the message choice and

denotes the random variable corresponding to the classical value in the register of the state . Furthermore, the following energy constraint applies as well:

 Tr{H¯¯¯ωA}≤E,¯¯¯ωA≡1nn∑i=1ω(i)Ai, (10)

which limits the energy of the average input state.

## Iii Purified protocol

Our goal is to bound the rate of such a protocol. With this in mind, we can devise a protocol that simulates the above one. It consists of purifying each step of the above protocol and Bob keeping a copy of the classical feedback, such that at each time step, conditioned on the value of the message in and the feedback in the existing systems labeled by , the state is pure. To be clear, we go through the steps of the purified protocol. In order to simplify notation, we let be a joint system throughout, referring to both the original system as well as a purifying system, and we take the same convention for . The initial state of Alice is as follows:

 ρW^A0≡1MM∑m=1|m⟩⟨m|W⊗ψm^A0, (11)

where is a purification of , such that tracing over a subsystem of gives . The initial state of Bob is as follows:

 σF0F′0^B1≡∑f0p(f0)|f0⟩⟨f0|F0⊗|f0⟩⟨f0|F′0⊗φf0^B1, (12)

where is a purification of , such that tracing over a subsystem of gives , and he keeps an extra copy of the classical data. Let denote an isometric channel extending the encoding channel , for . Since the system is classical, for , the decoding channel can be written explicitly as

 DiBiB′i→FiB′i+1=∑fiDi,fiBiB′i→B′i+1⊗|fi⟩⟨fi|Fi, (13)

such that  is a collection of completely positive maps such that the sum map is trace preserving. Let be a linear map such that tracing over a subsystem of gives the original map , and define the map

 Vi,fiBi^Bi→^Bi+1(τBi^Bi)≡Vi,fiBi^Bi→^Bi+1τBi^Bi[Vi,fiBi^Bi→^Bi+1]†.

Then we define the enlarged decoding channel as

 ViBi^Bi→Fi^Bi+1F′i≡∑fiVi,fiBi^Bi→^Bi+1⊗|fi⟩⟨fi|Fi⊗|fi⟩⟨fi|F′i.

Note that this enlarged decoding channel keeps an extra copy of the classical feedback value for Bob in the register . The final decoding channel in the original protocol is equivalent to a measurement channel, and thus can be written as

 DnBnB′n→^W(τBnB′n)=∑wTr{ΛwBnB′nτBnB′n}|w⟩⟨w|^W,

where is a POVM. We enlarge it as follows in the simulation protocol:

 VnBn^Bn→^Bn+1^W(τBn^Bn)=∑w√ΛwBnB′nτBn^Bn√ΛwBnB′n⊗|w⟩⟨w|^W, (14)

where the meaning of the notation is that the map acts nontrivially on the subsystems in the original protocol and trivially on all other subsystems, while mapping all systems to a system large enough to accommodate all of them. In the simulation protocol, we also consider an isometric channel that simulates the original channel as follows: .

Thus, the various states involved in the purified protocol are as follows. The global initial state is . Alice performs the enlarged encoding channel and the state becomes as follows:

 ω(1)W^A1A1^B1F′0≡U1^A0F0→^A1A1(ρW^A0⊗σF0F′0^B1). (15)

Alice transmits the system through the first use of the extended channel , resulting in the following state:

 ρ(1)W^A1B1^B1E1F′0=UNA1→B1E1(ω(1)W^A1A1^B1F′0). (16)

Bob processes his systems with the enlarged decoding channel and Alice acts with the enlarged encoding channel , resulting in the state . This process iterates more times, resulting in the following states:

 ρ(i)W^AiBi^BiEi1[Fi−10]′≡UNAi→BiEi(ω(i)W^AiAi^BiEi−11[Fi−10]′),
 ω(i+1)W^Ai+1Ai+1^Bi+1Ei1[Fi0]′≡(Ui+1^AiFi→^Ai+1Ai+1∘ViBi^Bi→FiF′i^Bi+1)(ρ(i)W^AiBi^BiEi1[Fi−10]′), (17)

for . The final enlarged decoding channel  results in the following state: . Note that we recover each state of the original protocol from Section II by performing particular partial traces.

## Iv Information measure for analysis of protocol

The key information measure that we use to analyze this protocol is as follows:

 I(W;CF)τ+S(C|WF)τ, (18)

where is a classical–quantum state of the form

 τWFC=∑w,fp(w,f)|w⟩⟨w|W⊗|f⟩⟨f|F⊗τw,fC. (19)

The first term in (18) represents the classical correlation between system and systems , while the second term represents the average entanglement between the system of the state and a purifying reference system.

We now establish some properties of the information measure in (18). Let us first recall the following lemma from [19]:

###### Lemma 1

Let be a pure bipartite state, and let be an ensemble of pure bipartite states obtained from by means of a 1W-LOCC channel of the form

 ∑xUxA→A′⊗VxB→B′⊗|x⟩⟨x|X, (20)

where is a collection of completely positive trace non-increasing maps with and is a collection of isometric channels, so that

 φxA′B′ ≡1p(x)(UxA→A′⊗VxB→B′)(ϕAB), (21) p(x) ≡Tr{(UxA→A′⊗VxB→B′)(ϕAB)}. (22)

Then the following inequality holds for .

The above lemma leads to the following one, which is the statement that the quantity in (18) is monotone with respect to 1W-LOCC channels:

###### Lemma 2

Let be a classical–quantum state, with classical systems and quantum systems pure when conditioned on , and let be a 1W-LOCC channel of the form in (20). Then the following holds

 I(W;BF)τ+S(B|WF)τ≥I(W;B′FX)θ+S(B′|WFX)θ,

where .

Proof. The inequality holds from data processing. In more detail, consider that is equal to

 =TrA′{∑x(UxA→A′⊗VxB→B′)(τWFAB)⊗|x⟩⟨x|X} =∑xVxB→B′(τWFB)⊗|x⟩⟨x|X, (23)

where the last equality follows because each map is trace preserving. So the state can be understood as arising from the action of the quantum instrument on the state , and since this is a channel from to , the data processing inequality applies so that . The inequality follows from an application of Lemma 1, by conditioning on the classical systems .

The following lemma places an entropic upper bound on the amount by which the quantity in (18) can increase by the action of a channel :

###### Lemma 3

Let be a classical–quantum state of the following form:

 τWFAB′=∑w,fp(w,f)|w⟩⟨w|W⊗|f⟩⟨f|F⊗τw,fAB′. (24)

Then

 I(W;BB′F)ω+S(BB′|WF)ω−[I(W;B′F)τ+S(B′|WF)τ]≤S(B)ω, (25)

where .

Proof. Consider that

 I(W;BB′F)ω+S(BB′|WF)ω −[I(W;B′F)τ+S(B′|WF)τ] =I(W;BB′F)ω+S(BB′|WF)ω −[I(W;B′F)ω+S(B′|WF)ω] (26) =I(W;B|B′F)ω+S(B|B′WF)ω (27) =S(B|B′F)ω−S(B|B′WF)ω+S(B|B′WF)ω (28) =S(B|B′F)ω≤S(B)ω. (29)

All inequalities follow from definitions and applying chain rules for mutual information and entropy. The final inequality follows because conditioning does not increase entropy.

## V Maximum output entropy bound

Now that we have identified a quantity that does not increase under 1W-LOCC from Bob to Alice and cannot increase by more than the output entropy of a channel under its action, we can use these properties to establish the following upper bound on the rate of a feedback-assisted communication protocol:

###### Theorem 4

For an protocol for classical communication over a quantum channel assisted by classical feedback, of the form described in Section II, the following bound applies

 (1−ε)log2M≤n⋅supρ:Tr{Hρ}≤ES(N(ρ))+h2(ε). (30)

Proof. Let us consider the purified simulation of a given protocol, as given in Section III. We start with

 log2M =I(W;^W)¯¯¯Φ (31) ≤I(W;^W)ρ+εlog2M+h2(ε), (32)

where we have applied the condition in (9) and standard entropy inequalities. Continuing, we find that

 I(W;^W)ρ ≤I(W;Bn^Bn[Fn−10]′)ρ(n)+S(Bn^Bn|[Fn−10]′W)ρ(n) (33) =I(W;Bn^Bn[Fn−10]′)ρ(n)+S(Bn^Bn|[Fn−10]′W)ρ(n) −[I(W;^B1F′0)ω(1)+S(^B0|F′0W)ω(1)] (34) =I(W;Bn^Bn[Fn−10]′)ρ(n)+S(Bn^Bn|[Fn−10]′W)ρ(n) −[I(W;^B1F′0)ω(1)+S(^B0|F′0W)ω(1)] +n∑i=2I(W;^Bi[Fi−10]′)ω(i)+S(^Bi|[Fi−10]′W)ω(i) −[I(W;^Bi[Fi−10]′)ω(i)+S(^Bi|[Fi−10]′W)ω(i)].

The first inequality follows from data processing and non-negativity of entropy. The first equality follows because for the initial state (there is no classical correlation between and , and the state on system is pure when conditioned on ). The last equality follows by adding and subtracting the same term. Continuing, we find that the quantity in the last line above is bounded as

 ≤I(W;Bn^Bn[Fn−10]′)ρ(n)+S(Bn^Bn|[Fn−10]′W)ρ(n) −[I(W;^B1F′0)ω(1)+S(^B0|F′0W)ω(1)] +n∑i=2I(W;Bi−1^Bi−1[Fi−20]′)ρ(i−1) +S(Bi−1^Bi−1|[Fi−20]′W)ρ(i−1) −[I(W;^Bi[Fi−10]′)ω(i)+S(^Bi|[Fi−10]′W)ω(i)] =n∑i=1I(W;Bi^Bi[Fi−10]′)ρ(i)+S(Bi^Bi|[Fi−10]′W)ρ(i) −[I(W;^Bi[Fi−10]′)ω(i)+S(^Bi|[Fi−10]′W)ω(i)] (35) ≤n∑i=1S(Bi)ρ(i)≤nS(B)N(¯¯¯ω)≤nsupρ:Tr{Hρ}≤ES(N(ρ)). (36)

The first inequality follows from Lemma 2. The first equality follows by collecting terms. The second inequality follows from Lemma 3. The third inequality follows from concavity of entropy and the definition of in (10). The final inequality follows from the energy constraint in (10), and by optimizing over all input states that satisfy this energy constraint. By combining (31)–(32) and (33)–(36), we arrive at (30).

In Appendix A, we show how to extend this result to the maximum average output entropy:

###### Theorem 5

Let , where

is a probability distribution and

is a set of channels. For an protocol for classical communication over the channel assisted by classical feedback, of the form described in Section II, the following bound applies

 (1−ε)log2M≤n⋅supρ:Tr{Hρ}≤E∑xpX(x)S(Nx(ρ))+h2(ε).

## Vi Examples

From the upper bound in Theorem 4, we conclude that the feedback-assisted capacity of a noiseless qudit channel of dimension is log.

Furthermore, consider a pure-loss bosonic channel [20] with transmissivity . Taking the Hamiltonian as the photon number operator and energy constraint , it is known from [20] that this channel’s energy constrained classical capacity and maximum output entropy are equal to , where . Applying these results and Theorem 4, we conclude that classical feedback does not increase the energy-constrained classical capacity of the pure-loss bosonic channel.

A quantum erasure channel is defined as for , where is the state of a -dimensional input system and is an erasure state orthogonal to all inputs. Applying Theorem 5, we conclude that the classical capacity of the erasure channel assisted by classical feedback is equal to , so that classical feedback does not increase the classical capacity of the erasure channel.

## Vii Conclusion

Our main result is that the maximum average output entropy of a quantum channel is an upper bound on its classical capacity assisted by classical feedback. Note that the bound is a weak converse bound. Going forward from here, it would be good to find strong converse and tighter bounds on the classical capacity assisted by classical feedback.

Acknowledgements. We acknowledge discussions with Xin Wang, Patrick Hayden, and Tsachy Weissman. DD is supported by a National Defense Science and Engineering Graduate Fellowship. YQ is supported by a Stanford Graduate Fellowship and a National University of Singapore Overseas Graduate Scholarship. PWS is supported by the NSF under Grant No. CCF-1525130 and through the NSF Science and Technology Center for Science of Information under Grant No. CCF0-939370. MMW acknowledges NSF grant no. 1350397. DD would like to thank God for all His provisions.

## References

• [1] C. Shannon, “The zero error capacity of a noisy channel,” IRE Transactions on Information Theory, vol. 2, no. 3, pp. 8–19, September 1956.
• [2] G. Bowen, “Quantum feedback channels,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2429–2434, October 2004.
• [3] C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted classical capacity of noisy quantum channels,” Physical Review Letters, vol. 83, no. 15, pp. 3081–3084, October 1999.