Unconstrained distillation capacities of a pure-loss bosonic broadcast channel

Unconstrained distillation capacities of a pure-loss bosonic broadcast channel

Masahiro Takeoka1, Kaushik P. Seshadreesan2, and Mark M. Wilde3 1 Quantum ICT Laboratory, National Institute of Information and Communications Technology, Koganei, Tokyo 184-8795, Japan 2 Max-Planck-Institut für die Physik des Lichts, 91058 Erlangen, Germany 3 Hearne Institute for Theoretical Physics, Department of Physics and Astronomy,
Center for Computation and Technology, Louisiana State University, Baton Rouge, Louisiana 70803, USA
Abstract

Bosonic channels are important in practice as they form a simple model for free-space or fiber-optic communication. Here we consider a single-sender multiple-receiver pure-loss bosonic broadcast channel and determine the unconstrained capacity region for the distillation of bipartite entanglement and secret key between the sender and each receiver, whenever they are allowed arbitrary public classical communication. We show how the state merging protocol leads to achievable rates in this setting, giving an inner bound on the capacity region. We also determine an outer bound on the region and find that the outer bound matches the inner bound in the infinite-energy limit, thereby establishing the unconstrained capacity region for such channels. Our result could provide a useful benchmark for implementing a broadcasting of entanglement and secret key through such channels. An important open question relevant to practice is to determine the capacity region in both this setting and the single-sender single-receiver case when there is an energy constraint on the transmitter.

I Introduction

Quantum key distribution (QKD) [1, 2] and entanglement distillation (ED) [3] are two cornerstones of quantum communication. QKD enables two or more cooperating parties to distill and share unconditionally secure random bit sequences, which could then be used for secure classical communication. ED, on the other hand, allows them to distill pure maximal entanglement from a quantum state shared via a noisy communication channel, which could then be used to faithfully transfer quantum states by using quantum teleportation [4]. In both protocols, the parties are allowed to perform (in principle) an unlimited amount of local operations and classical communication (LOCC).

Quantum communication technologies have matured tremendously in recent years. In particular, QKD has been available commercially for a number of years and has now expanded to inter-city networks [5, 6]. Also, efforts are currently underway to accomplish QKD in free space between the earth and satellites [7].

Quantum communication, however, faces an important challenge. Like most other quantum technologies, its performance is affected by noise. Loss is the main source of error in typical optical communication channels and severely limits the rates and distances at which secret key or quantum entanglement can be distilled using the channel. All practical implementations of QKD to date are known to exhibit a rate-loss tradeoff, in which the rate of secret key extraction drops with increasing distance [8]. In the case of the standard optical-fiber communication channel, the drop is exponential with increasing distance.

Some time after these limitations were observed, Refs. [9, 10] provided a mathematical proof, using the notion of squashed entanglement [11], that the tradeoff is indeed a fundamental limitation even with unconstrained input energy. One of the main results of [9, 10] is an upper bound on the two-way LOCC assisted quantum and secret key agreement capacity of a pure-loss bosonic channel, which is solely a function of the channel transmittance . If the transmitter can consume only a finite amount of energy (as is in some practical cases), then tighter bounds are available [9, 10]. As a consequence, no yet-to-be-discovered protocol could ever surpass the limitations established in [9, 10]. Ref. [12] extended the squashed entanglement technique to obtain upper bounds for a variety of phase-insensitive Gaussian channels. Concurrently with [12], Ref. [13] improved the infinite-energy bound from [9, 10] and conclusively established the unconstrained capacity of the pure-loss bosonic channel as . It is still an open question to determine the constrained capacity (i.e., when the transmitter is limited to consuming finite energy).

One of the long-term goals of quantum communication is to establish a quantum internet [14]: a large collection of interconnected quantum networks between multiple users that enables secure classical communication and distributed quantum information processing. Apart from point-to-point links, network architectures based on single-sender multiple-receivers (modeled as broadcast channels) and vice versa (multiple access channels) are also important in this context. Even though various network quantum communication scenarios have been examined [15, 16, 17, 18, 19, 20], there has been limited work on the capacity of entanglement and secret key distillation assisted by unlimited LOCC. Only recently in [21] were outer bounds on the achievable rates established for multipartite secret key agreement and entanglement generation between any subset of the users of a general single-sender -receiver quantum broadcast channel (QBC) (for any ) when assisted by unlimited LOCC between all the users. The main idea was to employ multipartite generalizations of the squashed entanglement [22, 23] and the methods of [9, 10].

In this paper, we consider a single-sender multiple-receiver pure-loss bosonic QBC and establish the unconstrained capacity region for the distillation of bipartite entanglement and secret key between the sender and each receiver assisted by unlimited LOCC. To prove the statement, we establish inner bounds on the achievable rate region by employing the quantum state merging protocol [24, 25]. The converse part relies upon several tools. First, we utilize a teleportation simulation argument originally introduced in [26, Section V] and recently generalized in [13] to wider families of channels and continuous-variable systems. Next, it is known that the relative entropy of entanglement is an upper bound on the distillable key of a bipartite state [27], and the recent work in [13] stated how it is possible to combine the relative entropy of entanglement upper bound with the teleportation simulation argument to arrive at upper bounds on the secret-key agreement capacity of certain single-sender single-receiver channels. We find that the outer bounds match the inner bounds in the infinite-energy limit, thereby establishing the unconstrained capacity region. An important open question is to determine the constrained capacity region, i.e., when only finite energy is available at the transmitter.

The paper is organized as follows. In Section II, we describe a general LOCC-assisted distillation protocol for a QBC and the mathematical and physical model of the pure-loss bosonic QBC. The unconstrained capacity region is given in Section III along with a proof for the single-sender two-receiver case. Section IV concludes the paper. The appendix generalizes the main theorem to the single-sender multiple-receiver case.

Ii LOCC-assisted distillation protocol and the channel model

In the main text, we consider a single-sender two-receiver QBC (Fig. 1(a)) and an (, , , , , ) protocol described as follows (the appendix considers the generalization to multiple receivers). The sender, Alice, prepares some quantum systems in an initial quantum state and successively sends some of these systems to the receivers, Bob and Charlie, by interleaving channel uses of the broadcast channel with rounds of LOCC. The goal of the protocol is to distill bipartite maximally entangled states and and private states and (equivalently secret keys [28]). After each channel use, they can perform an arbitrary number of rounds of LOCC (in any direction with any number of parties). The quantities and denote entanglement rates (i.e., the logarithm of the Schmidt rank of and , respectively, normalized by the number of channel uses) and and are secret-key rates (i.e., the number of secret-key bits in , and , respectively, normalized by the number of channel uses). The protocol considered here is similar to the one described in [21], except that here we do not consider the other possible rates , , , and .

A rate tuple (, , , ) is achievable if for all and sufficiently large , there exists an (, , , , , ) protocol of the above form. The capacity region is the closure of the set of all achievable rates.

In the following, we concentrate on a specific channel: a pure-loss bosonic QBC which we denote by . For this channel, the input state is split into three systems and one system is sent to each of Bob, Charlie, and the environment with transmittance , , and , respectively, where .

Physically the signal splitting is modeled by a pair of two-input two-output beam splitters in which the signal is mixed with the vacuum state. For example, one can construct such a channel by a sequence of two beam splitters with transmittance and , respectively, where the first beam splitter splits the signal and the environment, and the second one splits the signal into Bob’s and Charlie’s parts (see Fig. 1(b)). Mathematically this is characterized by the following input-output relation:

(1)
(2)
(3)

where , , , are annihilation operators for Alice’s input, Bob’s output, and Charlie’s output modes, respectively, and and are annihilation operators for vacuum inputs from the environment.

Critical for our analysis is that the physical implementation of is not unique. One can model the same channel by a different concatenation of two other beam splitters: for example, we could have a first beam splitter split system from and , and then a second one split and . Obviously, it is also possible to split at the first beam splitter. These physical models are described in Fig. 1(c) and (d), respectively. In the next section, we will use these other physical models to explicitly calculate the rate regions.

Fig. 1: (a) Single-sender two-receiver quantum broadcast channel. (b)-(d) Various physical implementations of the pure-loss bosonic broadcast channel with transmittances and .

Iii Unconstrained capacity region

Our main contribution is the following theorem:

Theorem 1

The LOCC-assisted, unconstrained capacity region of the pure-loss bosonic QBC is given by

(4)
(5)
(6)

See the appendix for a generalization of this theorem to the multiple-receiver model from [29].

Iii-a Achievability part

To achieve the rate region (4)–(6), we consider a distillation protocol which employs quantum state merging. State merging was introduced in [24, 25] and provides an operational meaning for the conditional quantum entropy. For a state , its conditional quantum entropy is defined as where and are the quantum entropies of and its marginal , respectively. For many copies of shared between Alice and Bob, is the optimal rate at which maximally entangled two-qubit states need to be consumed to transfer Alice’s systems to Bob’s side via LOCC. If is negative, the result is that after transferring Alice’s systems, they can gain (i.e., distill) entanglement at rate . State merging also yields a quantum analog of the Slepian-Wolf theorem in classical distributed compression problem and has been applied to the QBC in [19, 20].

Here we consider the following alternative state merging based protocol. Alice first prepares copies of a two-mode squeezed vacuum (TMSV)

(7)

where is an -photon state, and is the average photon number of the state per mode. She sends system to Bob and Charlie through a pure-loss broadcast channel. After uses of the channel, Alice, Bob, and Charlie share copies of the state .

Then by using , they perform state merging to establish entanglement. More precisely, Bob and Charlie transfer their system back to Alice by LOCC (similar to reverse reconciliation in the point-to-point scenario). This could be done by applying the point-to-point state merging protocol successively [24, 25] or alternatively, by applying the multiparty simultaneous decoding state merging [30]. Then we obtain the achievable rate region for and as

(8)
(9)
(10)

Since one “ebit” of entanglement can generate one private bit of secret key, the left-hand side of the above inequalities can be modified as , .

The right-hand side of these inequalities can be explicitly calculated. Recall that the marginal of the TMSV is a thermal state with mean photon number . Its entropy is equal to , where . Also a pure-loss channel with transmittance maps a thermal state to another thermal state with reduced average photon number. Let be an isometric extension of and let

(11)

be a purification of . By using and observing the above facts, we have

In the limit as , this converges to . Similarly, we obtain

(12)
(13)

in the limit of infinitely large . Thus (4)–(6) are achievable when there is no energy constraint on the transmitter.

Iii-B Converse part

As stated at the end of Section I, the converse relies upon several tools and is given in terms of the relative entropy of entanglement (REE) [31]. The REE for a quantum state is defined by

(14)

where is the quantum relative entropy and SEP denotes the set of separable states. The original LOCC-assisted communication protocol can equivalently be rewritten by using a teleportation simulation argument [26, Section V] suitably extended to continuous-variable bosonic channels [13]. Teleportation simulation in the case of a point-to-point channel can be understood as the possibility of reducing a sequence of adaptive protocols involving two-way LOCC into a sequence of non-adaptive protocols followed by a final LOCC. For all ‘teleportation-simulable channels’ (more precisely the channels arising from the action of teleportation on a bipartite state) that allow for such a reduction, an upper bound on the entanglement and secret key agreement capacity can be given by the REE [13], because the REE is an upper bound on the distillable key of any bipartite state [27]. Furthermore, for pure-loss bosonic channels, one can use a concise formula for the REE given in [13]. With these techniques, an upper bound on the unconstrained capacity of a point-to-point pure-loss channel is equivalent to the REE of the state resulting from sending an infinite-energy TMSV through the channel, explicitly calculated to be equal to .

Since the pure-loss bosonic QBC is covariant with respect to displacement operations (which are the teleportation corrections for bosonic channels [32]), it is teleportation-simulable. Then the original broadcasting protocol described in the previous section can be replaced by the distillation of copies of via the final LOCC. This LOCC distills entanglement and secret key; i.e., it generates a state which is -close to :

(15)

with

(16)

where , , and are subsystems of , , and , respectively. Then by using several well known properties of REE (monotonicity under LOCC, continuity, and subadditivity for product states), we find that

(17)

where is a function such that . Similar bounds can be obtained in terms of and , leading to the following outer bound for the capacity region:

(18)
(19)
(20)

To calculate the right-hand side of each inequality, we use a calculation from [13]: for a point-to-point pure-loss bosonic channel with transmittance , which we denote by , the REE of with is given by .

For , consider the physical implementation of the channel in Fig. 1(b) and let be the state such that only the first beam splitter is applied. The second beam splitter is a local unitary in the sense that it operates on and whereas our partition is now between and . Thus it does not change the REE. Then we have . Also, since is a TMSV followed by a pure-loss channel with transmittance , we get

(21)

To calculate , we employ the physical implementation of the channel in Fig. 1(c) in which the first beam splitter with transmittance separates from the others. This beam splitter is followed by the second beam splitter with transmittance which separates and the environment .

Let be the TMSV in which only the first beam splitter is applied. Observe that it is a pure state and its marginal is a thermal state with average photon number . Combining these two observations, we can conclude that the state has the following Schmidt decomposition:

(22)

where is some orthonormal basis. Since is an orthonormal set, there exists a local unitary operation acting on systems and such that

(23)

where is some constant auxiliary state. Then we have

(24)

Let where . Note that . Since the local unitary operation does not change the REE between and , we have . Moreover, is the REE for the TMSV with followed by . Then by using the result in [13], we find

(25)

Similarly, with the physical implementation picture in Fig. 1(d), we obtain

(26)

which completes the proof of the converse part. Figure 2 illustrates an example of the unconstrained capacity region given in (4)–(6).

Fig. 2: LOCC-assisted capacity region given by (4)–(6) for the pure-loss bosonic broadcast channel, where .

Iv Conclusion

We have established the unconstrained capacity region of a pure-loss bosonic broadcast channel for LOCC-assisted entanglement and secret key distillation. This result is proved by using the quantum state merging protocol (for the inner bound) and the relative entropy of entanglement (for the outer bound), and it could provide a useful benchmark for the broadcasting of entanglement and secret key through such channels.

There are some interesting problems left open. First, we consider the scenario to share entanglement and a secret key between the sender and each receiver, but we think it is interesting to include other possibilities, i.e., and , and even tripartite entanglement, such as GHZ states, and tripartite common secret key. Such a scenario was discussed in [21], where an outer bound was established by making use of the squashed entanglement. However, these bounds might be further improved, and in addition, it is open to determine how to construct a protocol achieving tight inner bounds.

Second, one might attempt to generalize our scenario to other channels. A consequence of the teleportation simulation argument from [26, Section V] is that the REE upper bound can be applied to all teleportation-simulable channels, as shown in [13]. Thus the approach could work for all broadcast channels for which this is true. Finally, we think it is a pressing open question to determine the constrained capacity region (i.e., with a finite-energy constraint). Since the REE bound using the teleportation reduction technique requires infinite energy to realize an ideal teleportation, one needs an alternative approach here, such as the one given in [21] in order to obtain tighter outer bounds in some cases.

We acknowledge helpful discussions with Sam Braunstein, Saikat Guha, Michal Horodecki, Stefano Pirandola, and John Smolin. This research was supported by the Open Partnership Joint Projects of JSPS Bilateral Joint Research Projects and the ImPACT Program of Council for Science, Technology and Innovation, Japan. MMW is grateful to NICT for hosting and supporting him for a research visit during December 2015, and he acknowledges support from NSF Grant No. CCF-1350397. KPS thanks the Max Planck Society for funding.

References

  • [1] C. H. Bennett and G. Brassard, “Quantum cryptography: public key distribution and coin tossing,” Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, p. 175, 1984.
  • [2] A. K. Ekert, “Quantum cryptography based on Bell’s theorem,” Physical Review Letters, vol. 67, pp. 661–663, 1991.
  • [3] C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin, and W. K. Wootters, “Purification of noisy entanglement and faithful teleportation via noisy channels,” Physical Review Letters, vol. 76, pp. 722–725, January 1996.
  • [4] C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels,” Physical Review Letters, vol. 70, no. 13, pp. 1895–1899, March 1993.
  • [5] M. Peev, C. Pacher, and R. Alléaume, “The SECOQC quantum key distribution network in Vienna,” New Journal of Physics, vol. 11, p. 075001, 2009.
  • [6] M. Sasaki et al., “Field test of quantum key distribution in the Tokyo QKD network,” Optics Express, vol. 19, no. 11, pp. 10 387–10 409, 2011, arXiv:quant-ph/1103.3566.
  • [7] D. Elser et al., “Satellite Quantum Communication via the Alphasat Laser Communication Terminal,” 2015, arXiv:1510.04507v1.
  • [8] V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dušek, N. Lütkenhaus, and M. Peev, “The security of practical quantum key distribution,” Review of Modern Physics, vol. 81, pp. 1301–1350, 2009, arXiv:0802.4155.
  • [9] M. Takeoka, S. Guha, and M. M. Wilde, “Fundamental rate-loss tradeoff for optical quantum key distribution,” Nature Communications, vol. 5, p. 5235, October 2014.
  • [10] ——, “The squashed entanglement of a quantum channel,” IEEE Transactions on Information Theory, vol. 60, no. 8, pp. 4987–4998, August 2014, arXiv:1310.0129.
  • [11] M. Christandl and A. Winter, ““Squashed entanglement”: An additive entanglement measure,” Journal of Mathematical Physics, vol. 45, no. 3, pp. 829–840, March 2004, arXiv:quant-ph/0308088.
  • [12] K. Goodenough, D. Elkouss, and S. Wehner, “Assessing the performance of quantum repeaters for all phase-insensitive Gaussian bosonic channels,” Nov. 2015, arXiv:1511.08710.
  • [13] S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi, “Fundamental limits of repeaterless quantum communications,” 2015, arXiv:1510.08863.
  • [14] H. J. Kimble, “The quantum internet,” Nature, vol. 453, no. 7198, pp. 1023–1030, Jun. 2008.
  • [15] A. E. Allahverdyan and D. B. Saakian, “The broadcast quantum channel for classical information transmission,” pp. 1–8, 1998.
  • [16] A. Winter, “The capacity of the quantum multiple-access channel,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 3059–3065, 2001.
  • [17] S. Guha, J. Shapiro, and B. Erkmen, “Classical capacity of bosonic broadcast communication and a minimum output entropy conjecture,” Physical Review A, vol. 76, no. 3, p. 032303, September 2007.
  • [18] J. Yard, P. Hayden, and I. Devetak, “Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions,” IEEE Transactions on Information Theory, vol. 54, no. 7, pp. 3091–3113, 2008.
  • [19] ——, “Quantum broadcast channels,” IEEE Transactions on Information Theory, vol. 57, no. 10, pp. 7147–7162, October 2011.
  • [20] F. Dupuis, P. Hayden, and K. Li, “A father protocol for quantum broadcast channels,” IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2946–2956, June 2010.
  • [21] K. P. Seshadreesan, M. Takeoka, and M. M. Wilde, “Bounds on entanglement distillation and secret key agreement for quantum broadcast channels,” Accepted for publication in IEEE Transactions on Information Theory, 2015, arXiv:1503.08139.
  • [22] D. Avis, P. Hayden, and I. Savov, “Distributed compression and multiparty squashed entanglement,” Journal of Physics A: Mathematical and Theoretical, vol. 41, no. 11, p. 115301, March 2008, arXiv:0707.2792.
  • [23] D. Yang, K. Horodecki, M. Horodecki, P. Horodecki, J. Oppenheim, and W. Song, “Squashed entanglement for multipartite states and entanglement measures based on the mixed convex roof,” IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3375–3387, July 2009.
  • [24] M. Horodecki, J. Oppenheim, and A. Winter, “Partial quantum information.” Nature, vol. 436, no. 7051, pp. 673–6, August 2005.
  • [25] ——, “Quantum state merging and negative information,” Communications in Mathematical Physics, vol. 136, pp. 107–136, 2007.
  • [26] C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, “Mixed-state entanglement and quantum error correction,” Physical Review A, vol. 54, no. 5, p. 3824, 1996.
  • [27] K. Horodecki, M. Horodecki, P. Horodecki, and J. Oppenheim, “Secure key from bound entanglement,” Physical Review Letters, vol. 94, no. 16, p. 160502, April 2005, arXiv:quant-ph/0309110.
  • [28] ——, “General paradigm for distilling classical key from quantum states,” IEEE Transactions on Information Theory, vol. 55, no. 4, pp. 1898–1929, April 2009, arXiv:quant-ph/0506189.
  • [29] S. Guha, “Multiple-user quantum information theory for optical communication channels,” Ph.D. dissertation, Massachusetts Institute of Technology, June 2008.
  • [30] N. Dutil, “Multiparty quantum protocols for assisted entanglement distillation,” arXiv preprint arXiv:1105.4657, no. May, 2011.
  • [31] V. Vedral and M. B. Plenio, “Entanglement measures and purification procedures,” Physical Review A, vol. 57, no. 3, pp. 1619–1633, March 1998, arXiv:quant-ph/9707035.
  • [32] S. L. Braunstein and H. J. Kimble, “Teleportation of continuous quantum variables,” Physical Review Letters, vol. 80, pp. 869–872, 1998.

Appendix: the 1-to- broadcast channel

In this appendix, we generalize Theorem 1 to the 1-to- pure-loss broadcast channel for arbitrary positive integer .

Consider the pure-loss broadcast channel characterized by a set of transmittances with [29]. Let , , and be a complement of set . Then we have the following theorem:


Theorem 2

The LOCC-assisted unconstrained capacity region of the pure-loss bosonic QBC is given by

(27)

for all non-empty , where and .


Proof. The strategy of the proof is quite similar to that of Theorem 1. For the achievability, one can apply the point-to-point state merging protocol successively, which leads to the following achievable rate region:

(28)

where

(29)

The right-hand side of (28) is calculated to be

and taking , we get . Since one ebit of entanglement can generate one private bit of key, we can replace with which completes the achievability part.

Remark 3

Since the above rate region reflects the last gain/consumption of entanglement after the sequential operation of the point-to-point state mergings, it could be possible that the protocol is ‘catalytic,’ meaning that entanglement is consumed at some state merging which is compensated by the following other state mergings. However, this does not happen in our case. We can check it by the following simple observation. Gain/consumption of entanglement at any state merging is given by where is some nonempty subset of and is other subset (possibly empty) of satisfying . Since and is non-empty, this quantity always has a positive value meaning that entanglement is generated at all steps of the whole protocol.

For the converse, we need to configure the beam splitter network of the QBC properly. Note that the channel has transmittances , and . We can order these transmittances in some sequence and label it as . Then for any ordering, we can describe the channel by a sequence of beam splitters where the -th beam splitter’s transmittance is given by

(30)

Now, for each given involving parties, consider the following specific ordering. For with , assign with , , and for with , assign with . Then the transmittance of the beam splitter is where (see Fig. 3). From the main text, we already know that the REE for given partition and is simply characterized by this transmittance. As a consequence, the REE bound for turns out to be

(31)

where .

Fig. 3: Implementation of the 1-to- pure-loss bosonic broadcast channel.

 

Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
142636
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description