Efficient high-capacity quantum secret sharing with two-photon entanglement

An efficient high-capacity quantum secret sharing scheme is proposed following some ideas in quantum dense coding with two-photon entanglement. The message sender, Alice prepares and measures the two-photon entangled states, and the two agents, Bob and Charlie code their information on their photons with four local unitary operations, which makes this scheme more convenient for the agents than others. This scheme has a high intrinsic efficiency for qubits and a high capacity.Comment: 5 pages, no figures. A inappreciable error is correcte

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

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

The Buffered \pi-Calculus: A Model for Concurrent Languages

Message-passing based concurrent languages are widely used in developing large distributed and coordination systems. This paper presents the buffered $\pi$-calculus --- a variant of the $\pi$-calculus where channel names are classified into buffered and unbuffered: communication along buffered channels is asynchronous, and remains synchronous along unbuffered channels. We show that the buffered $\pi$-calculus can be fully simulated in the polyadic $\pi$-calculus with respect to strong bisimulation. In contrast to the $\pi$-calculus which is hard to use in practice, the new language enables easy and clear modeling of practical concurrent languages. We encode two real-world concurrent languages in the buffered $\pi$-calculus: the (core) Go language and the (Core) Erlang. Both encodings are fully abstract with respect to weak bisimulations