Single-photon-assisted entanglement concentration of a multi-photon system in a partially entangled W state with weak cross-Kerr nonlinearity

We propose a nonlocal entanglement concentration protocol (ECP) for $N$-photon systems in a partially entangled W state, resorting to some ancillary single photons and the parity-check measurement based on cross-Kerr nonlinearity. One party in quantum communication first performs a parity-check measurement on her photon in an $N$-photon system and an ancillary photon, and then she picks up the even-parity instance for obtaining the standard W state. When she obtains an odd-parity instance, the system is in a less-entanglement state and it is the resource in the next round of entanglement concentration. By iterating the entanglement concentration process several times, the present ECP has the total success probability approaching to the limit in theory. The present ECP has the advantage of a high success probability. Moreover, the present ECP requires only the $N$-photon system itself and some ancillary single photons, not two copies of the systems, which decreases the difficulty of its implementation largely in experiment. It maybe have good applications in quantum communication in future.Comment: 7 pages, 3 figure

Multiparty quantum secret sharing with pure entangled states and decoy photons

We present a scheme for multiparty quantum secret sharing of a private key with pure entangled states and decoy photons. The boss, say Alice uses the decoy photons, which are randomly in one of the four nonorthogonal single-photon states, to prevent a potentially dishonest agent from eavesdropping freely. This scheme requires the parties of communication to have neither an ideal single-photon quantum source nor a maximally entangled one, which makes this scheme more convenient than others in a practical application. Moreover, it has the advantage of having high intrinsic efficiency for qubits and exchanging less classical information in principle.Comment: 5 pages, no figure

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 bound on the rate at which secret key and entanglement can be generated when using a quantum channel a large number of times in addition to unlimited classical communication. This quantity has led to an upper bound of $\log((1+\eta)/(1-\eta))$ on the capacity of a pure-loss bosonic channel for such a task, where $\eta$ is the average fraction of photons that make it from the input to the output of the channel. The purpose of the present paper is to extend these results beyond the single-sender single-receiver setting to the more general case of a single 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 these measures. We apply our results to the case of a pure-loss broadcast channel with one sender and two receivers.Comment: 35 pages, 1 figure, accepted for publication in IEEE Transactions on Information Theor