### Abstract

This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl and Winter, establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed log((1+η)/(1-η)) for a pure-loss bosonic channel for which a fraction η of the input photons make it to the output on average. The best known lower bound on these capacities is equal to log(1/(1-η)). Thus, in the high-loss regime for which η ≪ 1, this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.

Original language | English (US) |
---|---|

Article number | 6832533 |

Pages (from-to) | 4987-4998 |

Number of pages | 12 |

Journal | IEEE Transactions on Information Theory |

Volume | 60 |

Issue number | 8 |

DOIs | |

State | Published - Aug 2014 |

Externally published | Yes |

### Fingerprint

### Keywords

- private states
- pure-loss bosonic channel
- quantum capacity
- quantum key distribution
- secret key agreement capacity
- Squashed entanglement

### ASJC Scopus subject areas

- Information Systems
- Computer Science Applications
- Library and Information Sciences

### Cite this

*IEEE Transactions on Information Theory*,

*60*(8), 4987-4998. [6832533]. https://doi.org/10.1109/TIT.2014.2330313

**The squashed entanglement of a quantum channel.** / Takeoka, Masahiro; Guha, Saikat; Wilde, Mark M.

Research output: Contribution to journal › Article

*IEEE Transactions on Information Theory*, vol. 60, no. 8, 6832533, pp. 4987-4998. https://doi.org/10.1109/TIT.2014.2330313

}

TY - JOUR

T1 - The squashed entanglement of a quantum channel

AU - Takeoka, Masahiro

AU - Guha, Saikat

AU - Wilde, Mark M.

PY - 2014/8

Y1 - 2014/8

N2 - This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl and Winter, establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed log((1+η)/(1-η)) for a pure-loss bosonic channel for which a fraction η of the input photons make it to the output on average. The best known lower bound on these capacities is equal to log(1/(1-η)). Thus, in the high-loss regime for which η ≪ 1, this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.

AB - This paper defines the squashed entanglement of a quantum channel as the maximum squashed entanglement that can be registered by a sender and receiver at the input and output of a quantum channel, respectively. A new subadditivity inequality for the original squashed entanglement measure of Christandl and Winter leads to the conclusion that the squashed entanglement of a quantum channel is an additive function of a tensor product of any two quantum channels. More importantly, this new subadditivity inequality, along with prior results of Christandl and Winter, establishes the squashed entanglement of a quantum channel as an upper bound on the quantum communication capacity of any channel assisted by unlimited forward and backward classical communication. A similar proof establishes this quantity as an upper bound on the private capacity of a quantum channel assisted by unlimited forward and backward public classical communication. This latter result is relevant as a limitation on rates achievable in quantum key distribution. As an important application, we determine that these capacities can never exceed log((1+η)/(1-η)) for a pure-loss bosonic channel for which a fraction η of the input photons make it to the output on average. The best known lower bound on these capacities is equal to log(1/(1-η)). Thus, in the high-loss regime for which η ≪ 1, this new upper bound demonstrates that the protocols corresponding to the above lower bound are nearly optimal.

KW - private states

KW - pure-loss bosonic channel

KW - quantum capacity

KW - quantum key distribution

KW - secret key agreement capacity

KW - Squashed entanglement

UR - http://www.scopus.com/inward/record.url?scp=84904685232&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904685232&partnerID=8YFLogxK

U2 - 10.1109/TIT.2014.2330313

DO - 10.1109/TIT.2014.2330313

M3 - Article

AN - SCOPUS:84904685232

VL - 60

SP - 4987

EP - 4998

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 8

M1 - 6832533

ER -