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 ancilla 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 similarprotocol proposed by Li et al. [Phys. Rev. A 61 (2000) 034301] arecompared mutually and discussed. It is found that they are equallyefficient and can reach the success probability threshold determinedby the inherent entanglement of the quantum channel.     

Probabilistic Teleportation of Multi-particle d-Level Quantum State

The general scheme for teleportation of a multi-particle d-level quantum state is presented when m pairs of partially entangled particles are utilized as quantum channels. The probabilistic teleportation can be achieved with a successful probability of $ \prod \limits_{N=0}^{d-1} ({C_0^N})^2/{d^M}$, which is determined by the smallest coefficients of each entangled channels.     

Quantum Logic Networks for Probabilistic and Controlled Teleportation of Unknown Quantum States

We present simplification schemes for probabilistic and controlled teleportation of the unknown quantum states of both one particle and two particles and construct efficient quantum logic networks for implementing the new schemes by means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement, and classically controlled operations. In these schemes the teleportation are not always successful but with certain probability.     

Quantum Logic Networks for Probabilistic and Controlled Teleportation of Unknown Quantum States

We present simplification schemes for probabilistic and controlled teleportation of the unknown quantum states of both one particle and two particles and construct efficient quantum logic networks for implementing the new schemes by means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement, and classically controlled operations. In these schemes the teleportation are not always successful but with certain probability.     

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.     

Probabilistic Teleportation of an Arbitrary Two-Particle State and Its Quantum Circuits

Two simple schemes for probabilistic teleportation of an arbitrary unknown two-particle state using a non-maximally entangled EPR pair and a non-maximally entangled GHZ state as quantum channels are proposed. After receiving Alice's Bell state measurement results, Bob performs a collective unitary transformation on his inherent particles without introducing the auxiliary qubit. The original state can be probabilistically teleported. Meanwhile, quantum circuits for realization of successful teleportation are also presented.     

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

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

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.     

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

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

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 piecewiseglobal chain teleportation protocol (PGCTP) for keeping away from the inconvenience of error-correction of GCTP. We show that PGCTP is more efficient than SCTP.     

Probabilistic Teleportation of an Unknown One-Particle State by a Three-Particle General W State

Two schemes for teleporting an unknown one-particle state are proposed when a general W state is utilized as quantum channel. In the first scheme, after the sender （Alice） makes a Bell-state measurement on her particles, the recipient （Bob） performs a Von Neumann measurement and introduces an auxiliary particle, and carries out a unitary transformation on his particle and the auxiliary particle, and performs a Von Neumann measurement on the auxiliary particle to confirm whether the teleportation succeeds or not. In the second scheme, the recipient （Bob） does not need to perform the first Von Neumann measurement or introduce the auxiliary particle, which is necessary in the first scheme. It is shown that the maxima/probabilities of successful teleportation of the two schemes are identical if the recipient （Bob） performs an appropriate unitary transformation and adopts a proper particle on which he recovers the quantum information of state to be teleported.     

Probabilistic Teleportation of Two-Particle State of General Formation

A scheme for probabilistic teleporting an unknown two-particle state of general formation by partly pure entangled four-particle state is proposed. It is shown that after performing two Bell state measurements, proper unitary transformation and the measurement on an auxiliary qubit, the unknown two-particle state of general formation, which was destroyed at one place, can be reconstructed at another place with certain probability.     

Probabilistic Teleportation of One-Particle State of S-level

A scheme for probabilistically teleporting an unknown one-particle state of S-level by a group of pairs ofpartially entangled 2-level particle state is proposed. In this scheme unitary transformation and local measurement takethe place of Bell state measurement, then proper unitary transformation and the measurement on an auxiliary qubitwith the aid of classical communication are performed. In this way the unknown one-particle state of S-level can betransferred onto a group of remote 2-level particles with certain probability. Furthermore, the receiver can recover theinitial signalstate on an S-level particle at his hand.     

Probabilistic Teleportation of a Four-Particle Entangled State

A Scheme for teleporting an unknown four-particle entangled state is proposed via entangled swapping. In this scheme, four pairs of entangled particles are used as quantum channel. It is shown that, if the four pairs of particles are nonmaximally entangled, the teleportation can be successfully realized with certain probability if a receiver adopts some appropriate unitary transformations.     

通过纠缠交换实现N粒子任意态的概率传态

量子隐形传态的杰出安全特性使其在未来的通讯领域充满潜力.量子力学的不确定性原理和不可克隆定理禁止对量子态进行直接复制,因此,量子隐形传态将量子态划分为经典和量子两部分,信息分别经由经典和量子通道从发送者Alice传递给远方的接收者Bob,根据这两种信息,Bob实行相应操作就可以以一定的几率重建初始传送态.利用一般意义的隐形传态方案,提出一种简便的新方法实现了一个N粒子任意态的概率传态.方法采用N个非最大纠缠的三粒子GHZ态作为量子通道,避免了引入额外的辅助粒子.为了实现传态,Alice将所有粒子分成N份,对第i份的粒子对(i,x_i)实行Bell测量并将结果通过经典通道通知Bob,Bob对粒子(y_i,z_i)进行相应的操作就可以完成第i个粒子信息的传送.当完成N次相似的重复操作后,Bob就可以准确地重建初始传送态.文中以Bell态测量为基本手段,重复的操作同时也降低了实验难度,作为一个特例,文中给出了一个两粒子任意态的传态方案.     

Quantum Teleportation Schemes of an N-Particle State via Three-Particle General W States

Two schemes of teleporting an N-particle arbitrary and unknown state are proposed when N groups of three- particle general W states are utilized as quantum channels. In the first scheme, the quantum channels are shared by the sender and the recipient. After the sender＇s Bell-state measurements on his （her） particles, the recipient carries out unitary transformations on his （her） particles. And then, the recipient performs computational basis measurements to realize the teleportation. The recipient can recover the state on either of particle sequences with the equal maximal probability of successful teleportation if he （she） performs appropriate unitary transformations. In the second scheme, the quantum channels are shared by the sender, the recipient and the third ones. After the sender＇s Be11-state measurements and the third ones＇ computational basis measurements if they agree to cooperate, the recipient will introduce auxiliary particles and carry out appropriate unitary transformations. Finally, the recipient performs computational basis measurements to fulfill the teleportation. The second scheme can be realized if and only if the third ones agree to cooperate with the recipient.     

通过cluster态实现两粒子纠缠态的量子几率隐形传态

提出通过一个四粒子cluster非最大纠缠态作为量子信道来实现一未知两粒子纠缠态的量子几率隐形传态方案。在此方案中,纠缠态可以实现一定的几率传输,此几率由cluster态中绝对值较小的两个系数决定。如果我们用cluster最大纠缠态作为量子信道,此时几率隐形传态就成了一般的隐形传态,即成功传输的几率为100%。     

Probabilistic Teleportation of One-Particle State of S-level

A scheme for probabilistically teleporting an unknown one-particle state of S-level by a group of pairs of partially entangled 2-level particle state is proposed. In this scheme unitary transformation and local measurement take the place of Bell state measurement, then proper unitary transformation and the measurement on an auxiliary qubit with the aid of classical communication are performed. In this way the unknown one-particle state of S-level can be transferred onto a group of remote 2-level particles with certain probability. Furthermore, the receiver can recover the initial signal state on an S-level particle at his hand.