Probabilistic Teleportation of an Arbitrary n-Particle Entangled State

A scheme for teleporting an arbitrary n-particle entangled state via n pairs of non-maximally entangled states is proposed. The probability of successful teleportation is determined only by the smaller coefficients of the partially entangled pairs. The method is very easy to be realized.     

三维类猫态的受控概率量子隐形传态

提出两种对三维三粒子类猫态的受控概率隐形传态方案.首先用一个部分三维五粒子纠缠态作为量子信道来实现,再用两个部分三维两粒子态和一个部分三维三粒子态作为量子信道来实现.两种方案的经典信息代价不同,成功的概率也不同.     

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.     

Quantum Logic Networks for Probabilistic Teleportation of an Arbitrary Three-Particle State

The scheme for probabilistic teleportation of an arbitrary three-particle state is proposed. By using single qubit gate and three two-qubit gates, efficient quantum logic networks for probabilistic teleportation of an arbitrary three-particle state are constructed.     

Quantum Logic Networks for Probabilistic Teleportation of an Arbitrary Three-Particle State

The scheme for probabilistic teleportation of an arbitrary three-particle state is proposed. By using single qubit gate and three two-qubit gates, efficient quantum logic networks for probabilistic teleportation of an arbitrary three-particle state are constructed.     

Schemes for Probabilistic Teleportation of a Three-Atom GHZ Class State via Cavity QED

Using a quantum channel composed of a two-atom and a three-atom nonmaximally entangled states,we present two schemes to teleport a three-atom GHZ class state via entanglement swapping in cavity QED with different success probabilities. The schemes can be respectively realized with the large-detuned vacuum cavities and with the large-detuned thermal cavities by separate atomic measurements after we choose appropriate atom-cavity-field interaction time.     

Probabilistic Teleportation of an Arbitrary Three-Level Two-Particle State and Classical Communication Cost

We propose a scheme to probabilistically teleport an unknown arbitrary three-level two-particle state by using two partial entangled two-particle states of three-level as the quantum channel. The classical communication cost required in the ideal probabilistic teleportation process is also calculated. This scheme can be directly generalized to teleport an unknown and arbitrary three-level K-particle state by using K partial entangled two-particle states of three-level as the quantum channel.     

Teleportation of an Arbitrary Two-Particle State via a Single Cluster-Class State

Teleportation of an arbitrary two-qubit state with a single partially entangled state, a four-qubit linear cluster-class state, is studied. The case is more practical than previous ones using maximally entangled states as the quantum channel. In order to realize teleportation, we first construct a cluster-basis of 16 orthonormal cluster states. We show that quantum teleportation can be successfully implemented with a certain probability if the receiver can adopt appropriate unitary transformations after receiving the sender＇s cluster-basis measurement information. In addition, an important conclusion can be obtained that a four-qubit maximally entangled state （cluster state） can be extracted from a single copy of the cluster-class state with the same probability as the teleportation in principle.     

Probabilistic Teleportation of a Three-Particle State

A scheme for teleporting a three-particle state is proposed when three pairs of entangled particles are used as quantum channels. Quantum teleportation can be successfully realized with a certain probability if the receiver adopts an appropriate unitary-reduction strategy. The probability of successful teleportation is determined by the smaller coetficients of the three entangled pairs.     

通过四个纠缠态粒子来实现未知的三个纠缠态粒子的量子几率隐形传输

提出一种分别利用四个三态粒子的最大纠缠态和非最大纠缠态作为量子通道来传输一未知的三个三态粒子纠缠态的方案.首先考察量子通道是最大纠缠态的情况,然后进一步考察量子通道是非最大纠缠态的情况,同时发现在后者情况时,通过引进一个辅助粒子,并构造一幺正变换矩阵,即可以一定的几率完成该三态粒子纠缠态的隐形传输.     

Controlled Probabilistic Teleportation of an Unknown Multi-Particle High-Dimensional Entangled State

We propose a protocol for controlled probabilistic teleportation of an unknown tripartite qutrit entangled state with two partial tripartite qutrit entangled states as the quantum channel. It is found that teleportation associated with the generalized qutrit Bell-basis measurement, the generalized qutrit π-state measurement and the generalized Hadamard operator in three-dimensional Hilbert space. We generalize the protocol for controlled probabilistic teleportation of an unknown k-particle qudit entangled state with a multi-particle qudit entangled state and a tripartite qudit entangled state as the quantum channel. We also calculate the classical communication cost required in both cases.     

Probabilistic Controlled Teleportation of an Arbitrary Three-Qubit State

Recently Jiang et al. [Chin. Phys. Lett. 24 （2007） 1144] gave a scheme for probabilistic controlled teleportation of a triplet W state from the sender Alice to the distant receiver Bob. The m controlled qubits are shared by m（s1, s2,..., sm） spatially-separated supervisors. Based on transformation operator, we can extend to teleporting an arbitrary three-qubit state. The relation between the transformation operators and the Bob＇s unitary transformation is also obtained.     

Increasing Success Probability of a Probabilistic Quantum Teleportation

The probabilistic quantum teleportation scheme [Phys. Lett. A 305 （2002） 12] is improved via two seemingly different methods （i.e., the usual aneilla method and the so-called Kraus method）, respectively. The essence of the improvements is to fetch a part from the residues so that the success probability is accordingly increased. The two improved versions and a similar protocol proposed by Li et al. [Phys. Rev. A 61 （2000） 034301] are compared mutually and discussed. It is found that they are equally efficient and can reach the success probability threshold determined by the inherent entanglement of the quantum channel.     

任意 n 粒子纠缠态的概率传送及其量子逻辑线路

采用n对两粒子非最大纠缠态作为量子通道,使用纠缠交换的方法实现了n粒子任意纠缠态的概率隐形传送。在传输过程中,发送者Alice对自己所拥有的粒子进行贝尔基测量,并将测量结果通过经典通道通知远方的接收者Bob,Bob根据所获取的信息对他的粒子实行相应的幺正变换以恢复原始的粒子信息态,从而成功实现隐形传送。该方案将所有参与传送的粒子划分为n个单元,将对n 1个粒子在2n 1维基下的复杂联合幺正操作分解为n次类似的重复操作,每次重复都是对两个粒子在四维基下的简单操作,大大降低了实验实现的难度。设计了n粒子量子态概率传送的量子逻辑线路,并对每组重复操作的单元线路做了提取。传送成功的总概率为2n∏ni=1ci2。     

A New Scheme for Probabilistic Teleportation and Its Potential Applications

We propose a novel scheme to probabilistically teleport an unknown two-level quantum state when the information of the partially entangled state is only available for the sender. This is in contrast with the fact that the receiver must know the non-maximally entangled state in previous typical schemes for the teleportation. Additionally, we illustrate two potential applications of the novel scheme for probabilistic teleportation from a sender to a receiver with the help of an assistant, who plays distinct roles under different communication conditions, and our results show that the novel proposal could enlarge the applied range of probabilistic teleportation.     

Probabilistic Chain Teleportation of a Qutrit-State

We investigate chain teleportation of a qutrit-state via the non-maximally two-qutrit entangled channels. For the case of four parties, the efficiencies of two chain teleportation protocols, the separate chain teleportation protocol （SCTP）, and the global chain teleportation protocol （GCTP）, are calculated. In SCTP the errors are corrected between every step while in GCTP the errors are corrected only at the end. Furthermore, we present a piecewise global chain teleportation protocol （PGCTP） for keeping away from the inconvenience of error-correction of GCTP. We show that PGCTP is more efficient than SCTP.     

Optimal Schemes of Teleportation One-Particle State by a Three-Particle General W State

Recently, Xiu et al. [Commun. Theor. Phys. 49 （2008） 905] proposed two schemes of teleporting an N particle arbitrary and unknown state when N groups of three particle general W states are utilized a.s quantum channels. They gave the maximal probability of successful teleportation. Here we find that their operation is not the optimal and the successful probability of the teleportation is not maximum. Moreover, we give the optimal schemes operation and obtain maximal successful probability for teleportation.     

Controlled Quantum Teleportation of a One-Particle Unknown State via a Three-Particle Entangled State

A kind of three-particle entangled state is applied as quantum channel of the controlled quantum teleportation of a one-particle unknown state. The one-particle unknown state is transmitted from the sender to the recipient under the control of the supervisor. After the sender makes Bell-state measurement and the supervisor performs von Neumann measurement, the recipient carries out unitary transformation on his own particle depending on classical information from the sender and the supervisor. The teleportation cannot be completed successfully by the recipient if the supervisor does not agree to cooperate. The roles of the recipient and the supervisor may be exchanged in this scheme. The scheme is flexible and feasible because the sequence of manipulation of the sender and the supervisor may be exchanged and only simple unitary transformation is included.     

Teleportation Capability of Six-Qubit Cluster State

Recently Wei-Bo Gao et al. [Phys. Rev. Lett. 104 （2010） 020501]; reported on the creation of a 4-photon 6-qubit cluster state. It is shown this states can be utilized for perfect teleportation of arbitrary three qubit systems and controlled teleportation of an arbitrary two-qubit state. Therefore, the six-qubit cluster state as quantum channels is equivalent to that of maximally six-qubit entangled state.