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

Probabilistic Teleportation of an Arbitrary n-Particle Entangled State and Its Quantum Logic Circuit

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

A scheme to probabilistically teleport an arbitrary n-particle entangled state using n pair non-maximally entangled state as the quantum channel via entanglement swapping is proposed. During the teleportation procedure, the sender Alice makes Bell-state measurements on her particle pairs and tells receiver Bob the measurement result through classical communication. According to the classical message, Bob makes corresponding unitary transformation on his own particles to reconstruct the original state. In this scheme, all particles are divided into n groups （i, ix,iy, ai, i=1～n）. The advantage is that the complex unitary transformation for n -t- 1 particles in 2＂＋l-dimentional Hilbert space is avaided. In each repeat operation, only simple unitary transformation for 2 particles in 4-dimentional Hilbert space is made, which considerably reduces difficulty in experiment. Then quantum logic circuit is shown for probabilistic teleportation of n-particle state and logic circuit for the particle group （ i, ix, iy, ai） is given as well. Result shows that the total probability of successful teleportation is 2^nпi=1^n│Ci│^2.