Shi Shou-Hua

Revisiting quantum secure direct communication with W state

The quantum secure direct communication protocol recently proposed by Cao and Song [Chin, Phys. Lett. 23 (2006) 290] (i.e., the C-S QSDC protocol) is revisited. A security leak is pointed out. Taking advantage of this leak, an eavesdropper may adopt the intercept-measure-resend strategy to attack the quantum channel such that in the C-S QSDC protocol the secret message can be completely eavesdropped. To fix the leak, the original version of the C-S QSDC protocol is revised. As a consequence, the security is improved and assured at least in the ideal case of an ideal quantum channel.

Classical Communication Cost and Probabilistic Remote Preparation of Four-Particle Entangled W State

We present a scheme for probabilistic remote preparation of the four-particle entangled W state by using four partial entangled two-particle states as the quantum channel. In this scheme, if Alice (sender) performs four-particle projective measurements and Bob (receiver) adopts some appropriate unitary operation, the remote state preparation can be successfully realized with certain probability. The classical communication cost is also calculated. However, the success probability of preparation can be increased to 1 for four kinds of special states.

Probabilistic Teleportation of an Arbitrary Unknown Two-Qubit State via Positive Operator-Valued Measure and Two Non-maximally Entangled States

We present a scheme for probabilistically teleporting an arbitrary unknown two-qubit state through a quantum channel made up of two nonidentical non-maximally entangled states. In this scheme, the probabilistic teleportation is realized by using a proper positive operator-valued measure instead of usual projective measurement.

Assisted Cloning and Orthogonal Complementing of an Arbitrary Unknown Two-Qubit Entangled State

Based on A.K. Patis original idea [Phys. Rev. A 61 (2000) 022308] on single-qubit-state-assisted clone, very recently Zhan has proposed two assisted quantum cloning protocols of a special class of unknown two-qubit entangled states [Phys. Lett. A 336 (2005) 317]. In this paper we further generalize Zhans protocols such that an arbitrary unknown two-qubit entangled state can be treated.

Revisiting Probabilistic Teleportation Scheme for Atomic State via Cavity QED

A probabilistic teleportation scheme for atomic state via cavity QED [Phys. Rev. A 70 (2004) 054303] is revisited and accordingly some improvements are made.

Robust Quantum Secure Direct Communication and Deterministic Secure Quantum Communication over Collective Dephasing Noisy Channel

We propose two schemes for quantum secure direct communication (QSDC) and deterministic secure quantum communication (DSQC) over collective dephasing noisy channel. In our schemes, four special two-qubit states are used as the quantum channel. Since these states are unchanged through the collective dephasing noisy channel, the effect of the channel noise can be perfectly overcome. Simultaneously, the security against some usual attacks can be ensured by utilizing the various checking procedures. Furthermore, these two schemes are feasible with present-day technique.

Deterministic Secure Quantum Communication with Cluster State and Bell-Basis Measurements

We present a novel protocol for deterministic secure quantum communication by using the four-qubit cluster state as quantum channel. It is shown that two legitimate users can directly transmit the secret messages based on Bell-basis measurements and classical communication. The present protocol makes use of the ideas of block transmission and decoy particle checking technique. It has a high capacity as each cluster state can carry two bits of information, and has a high intrinsic efficiency because almost all the instances except the decoy checking particles (its number is negligible) are useful. Furthermore, this protocol is feasible with present-day technique.

Robust Multiparty Quantum Secret Key Sharing Over Two Collective-Noise Channels via Three-Photon Mixed States

We present a robust (n,n)-threshold scheme for multiparty quantum secret sharing of key over two collective-noise channels (i.e., the collective dephasing channel and the collective rotating channel) via three-photon mixed states. In our scheme, only if all the sharers collaborate together can they establish a joint key with the message sender and extract the secret message from the senders encrypted message. This scheme can be implemented using only a Bell singlet, a one-qubit state and polarization identification of single photon, so it is completely feasible according to the present-day technique.

Three-Party Quantum State Sharing of an Arbitrary Unknown Two-Qubit State Based on Entanglement Swapping and Bell-State Measurements

We propose a scheme for sharing an arbitrary unknown two-qubit state among three parties by using a four-qubit cluster-class state and a Bell state as a quantum channel. With a quantum controlled phase gate (QCPG) operation and a local unitary operation, any one of the two agents has the access to reconstruct the original state if he/she collaborates with the other one, whilst individual agent obtains no information. As all quantum resource can be used to carry the useful information, the intrinsic efficiency of qubits approaches the maximal value. Moreover, the present scheme is more feasible with present-day technique.

Remote Preparation of Multipartite Equatorial Entangled States in High Dimensions with Three Parties

A scheme for probabilistic remotely preparing N-particle d-dimensional equatorial entangled states via entangled swapping with three parties is presented. The quantum channel is composed of N – 1 pairs of bipartite d-dimensional non-maximally entangled states and a tripartite d-dimension non-maximally entangled state. It is shown that the sender can help either of the two receivers to remotely prepare the original state, and the N-particle projective measurement and the generalized Hadamard transformation are needed in this scheme. The total success probability and classical communication cost are calculated.