Bounds on Entanglement Distillation and Secret Key Agreement for Quantum Broadcast Channels


The squashed entanglement of a quantum channel is an additive function of quantum channels, which finds application as an upper sure on the rate at that secret key and entanglement will be generated when using a quantum channel a giant range of times additionally to unlimited classical Communication. This quantity has led to an upper bound of on the capacity of a pure-loss bosonic channel for such a task, where is the average fraction of photons that create it from the input to the output of the channel. The aim of this paper is to extend these results beyond the one-sender single-receiver setting to the more general case of one sender and multiple receivers (a quantum broadcast channel). We employ multipartite generalizations of the squashed entanglement to constrain the rates at which secret key and entanglement can be generated between any subset of the users of such a channel, along the way developing several new properties of those measures. We tend to apply our results to the case of a pure-loss broadcast channel with one sender and 2 receivers.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing - 2018ABSTRACT:We study the problem of recovering an s-sparse signal x* ? C n from corrupted measurements y = Ax* + z* + w,
PROJECT TITLE :Quantized Spectral Compressed Sensing: Cramer–Rao Bounds and Recovery Algorithms - 2018ABSTRACT:Efficient estimation of wideband spectrum is of nice importance for applications like cognitive radio. Recently,
PROJECT TITLE :On the Use of Extrinsic Probabilities in the Computation of Non-Bayesian Cramér–Rao Bounds for Coded Linearly Modulated Signal - 2018ABSTRACT:This contribution considers the non-Bayesian Cramér-Rao bound (CRB)
PROJECT TITLE :User Assignment in C-RAN Systems: Algorithms and Bounds - 2018ABSTRACT:In this Project, we investigate the problem of mitigating interference between therefore-known as antenna domains of a cloud radio access network
PROJECT TITLE :On the Ergodic Rate Lower Bounds With Applications to Massive MIMO - 2018ABSTRACT:A well-known lower sure widely utilized in the large MIMO literature hinges on channel hardening, i.e., the phenomenon for which,

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry