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

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

基于纠缠态的量子通信网络的量子信道建立速率模型

针对基于纠缠态的量子通信网络, 提出了网络模型. 基于网络模型, 首先分析了基础链路的量子信道建立速率. 然后根据基础链路的量子信道建立速率, 针对不同的量子信道建立方法, 对中继长链路上的量子信道建立速率进行分析, 得到在逐点方法和分段方法下所对应的量子信道建立速率. 最后, 利用逾渗模型, 对大规模纠缠态量子通信网络中任意两点间的量子信道建立速率进行分析, 推导出n个节点量子通信网络中, 量子信道建立速率为Ω (1/n).     

Quantum communication for satellite-to-ground networks with partially entangled states

To realize practical wide-area quantum communication,a satellite-to-ground network with partially entangled states is developed in this paper.For efficiency and security reasons,the existing method of quantum communication in distributed wireless quantum networks with partially entangled states cannot be applied directly to the proposed quantum network.Based on this point,an efficient and secure quantum communication scheme with partially entangled states is presented.In our scheme,the source node performs teleportation only after an end-to-end entangled state has been established by entanglement swapping with partially entangled states.Thus,the security of quantum communication is guaranteed.The destination node recovers the transmitted quantum bit with the help of an auxiliary quantum bit and specially defined unitary matrices.Detailed calculations and simulation analyses show that the probability of successfully transferring a quantum bit in the presented scheme is high.In addition,the auxiliary quantum bit provides a heralded mechanism for successful communication.Based on the critical components that are presented in this article an efficient,secure,and practical wide-area quantum communication can be achieved.     

Implementation of nonlocal quantum swap operation on two entangled pairs

We propose a scheme for the implementation of nonlocal quantum swap operation on two spatially separated entangled pairs and we show that the operation can swap two qubits of these entangled pairs.We discuss the resources of the entangled qubits and classical communication bits required for the optimal implementation of the nonlocal quantum swap operation.We also put forward a scheme for probabilistic implementation of nonlocal swap operation via a nonmaximally entangled quantum channel.The probability of a successful nonlocal swap operation is obtained by introducing a collective unitary transformation.     

Demonstration of fully-connected quantum communication network exploiting entangled sideband modes

Quantum communication network scales point-to-point quantum communication protocols to more than two detached parties, which would permit a wide variety of quantum communication applications. Here, we demonstrate a fully-connected quantum communication network, exploiting three pairs of Einstein−Podolsky−Rosen (EPR) entangled sideband modes, with high degree entanglement of 8.0 dB, 7.6 dB, and 7.2 dB. Each sideband modes from a squeezed field are spatially separated by demultiplexing operation, then recombining into new group according to network requirement. Each group of sideband modes are distributed to one of the parties via a single physical path, making sure each pair of parties build their own private communication links with high channel capacity better than any classical scheme.     

Perfect quantum teleportation and dense coding protocols via the 2N-qubit W state

In this paper, we investigate perfect quantum teleportation and dense coding by using an 2N-qubit W state channel. In the quantum teleportation scheme, an unknown N-qubit entangled state can be perfectly teleported. One ebit of entanglement and two bits of classical communication are consumed in the teleportation process, just like when using the Bell state channel. While N+1 bits of classical information can be transmitted by only sending N particles in the dense coding protocol.     

一种网络多用户量子认证和密钥分配理论方案

提出了一种网络多用户量子认证和密钥分配理论方案.类似于现代密码学中的网络认证体系结构提出了一种基于网络中用户与所属的可信服务器之间共享Einstein-Podolsky-Rosen(EPR)纠缠对进行身份认证和密钥分配的分布式客户机/服务器体系结构.基于该体系结构实现网络中任意用户之间的身份认证和密钥分配.可信服务器只提供用户的身份认证以及 交换粒子之间的纠缠使得两个想要秘密通信的用户的粒子纠缠起来.密钥的生成由发起请求 的用户自己完成.网络中的用户只需和所属的可信服务器共享EPR纠缠对通过经典信道和量子 信道与服务器通信.用户不需要互相共享EPR纠缠对，这使得网络中的EPR对的数量由O(n²)减小到O(n). 关键词： 量子认证 量子密钥分配 客户机/服务器 纠缠交换     

量子Turbo码

量子纠错编码技术在量子通信和量子计算领域起着非常重要的作用.构造量子纠错编码的主要方法是借鉴经典纠错编码技术,目前几乎所有经典纠错编码方案都已经被移植到量子领域中来,然而在经典编码领域纠错性能最杰出的Turbo码却至今没有量子对应.提出了一种利用量子寄存器网络构造量子递归系统卷积码的简单实现方案,同时利用量子SWAP门设计了一种高效的量子交织器门组网络方案.最后仿照经典Turbo码的设计原理提出串行级联的量子Turbo码,同时提出了可行的译码方法.量子Turbo码不仅丰富了量子纠错码研究的领域,同时为解释 关键词： 量子递归系统卷积码 量子Turbo码 量子纠错编码 量子信息     

Probabilistic quantum teleportation of shared quantum secret

Very recently, Lee et al. proposed a secure quantum teleportation protocol to transfer shared quantum secret between multiple parties in a network[Phys. Rev. Lett. 124 060501 (2020)]. This quantum network is encoded with a maximally entangled GHZ state. In this paper, we consider a partially entangled GHZ state as the entanglement channel, where it can achieve, probabilistically, unity fidelity transfer of the state. Two kinds of strategies are given. One arises when an auxiliary particle is introduced and a general evolution at any receiver's location is then adopted. The other one involves performing a single generalized Bell-state measurement at the location of any sender. This could allow the receivers to recover the transmitted state with a certain probability, in which only the local Pauli operators are performed, instead of introducing an auxiliary particle. In addition, the successful probability is provided, which is determined by the degree of entanglement of the partially multipartite entangled state. Moreover, the proposed protocol is robust against the bit and phase flip noise.     

基于cluster态的信道容量可控的可控量子安全直接通信方案

提出了一种基于五粒子cluster态的信道容量可控的可控量子安全直接通信方案.通信三方利用五粒子cluster态自身的粒子分布情况,结合诱骗光子,对粒子分别做Z基单粒子测量和Bell基测量,便可完成信道的第一次安全性检测.通信控制方Cindy通过对手中的粒子序列随机选用测量基(Z基或者X基)测量来决定信道容量,并通过经典信道公布结果.发送方Alice将要发送的信息以及校检信息用于对手中的粒子序列进行幺正操作编码,并插入诱骗光子后将编码后的粒子序列发给接收方Bob并通过经典信道告知其诱骗光子的位置信息.Bob接收到粒子序列后,按照经典信道Alice发送的信息,结合Cindy公布的信息,剔除诱骗光子后按照一定的规则对手中的两组粒子序列进行Bell基测量,便可解码完成第二次安全性检测以及得到Alice发送的信息.通过对五粒子cluster态的纠缠结构性质进行分析,阐明了五粒子cluster态在该方案中所表现出的特点的物理缘由.结果表明,只需变化测量基的规则和用于编码的粒子,可以将该方案推广成可控双向量子安全直接通信.     

Quantum multicast schemes of different quantum states via non-maximally entangled channels with multiparty involvement

Due to the unavoidable interaction between the quantum channel and its ambient environment, it is difficult to generate and maintain the maximally entanglement. Thus, the research on multiparty information transmission via non-maximally entangled channels is of academic value and general application. Here, we utilize the non-maximally entangled channels to implement two multiparty remote state preparation schemes for transmitting different quantum information from one sender to two receivers synchronously. The first scheme is adopted to transmit two different four-qubit cluster-type entangled states to two receivers with a certain probability. In order to improve success probabilities of such multicast remote state preparation using non-maximally entangled channels, we put forward the second scheme, which deals with the situation that is a synchronous transfer of an arbitrary single-qubit state and an arbitrary two-qubit state from one sender to two receivers. In particular, its success probability can reach 100% in principle, and independent of the entanglement degree of the shared non-maximally entangled channel. Notably, in the second scheme, the auxiliary particle is not required.     

Quantum Network Coding on Networks with Arbitrarily Distributed Hidden Channels

Although perfect quantum network coding has been proved to be achievable,it is still puzzling whether it is feasible whenever one or more of the channels are replaced by the hidden ones emerging from quantum entanglement.The question is answered in this paper.First,we propose a quantum network coding protocol over a butterfly network with two hidden channels.Second,we investigate a more general situation,where d-level quantum letters are transmitted through the network containing arbitrarily distributed hidden channels,and prove that quantum network coding on such networks is still achievable.     

未知EPR态及其正交态的概率复制

纠缠态在量子计算和量子信息中起着十分重要的作用。利用部分纠缠态作为资源提出了一种方案,根据该方案,能够以某些概率成功地复制出未知的EPR(Einstein Podolsky Rosen)态和它的正交态,使得通信双方都能够获得要传送的EPR态。方案的第一步是采用部分纠缠态作为量子信道去实现EPR态的隐形传态。根据量子不可克隆定理,输入态在发送方受到破坏。方案的第二步通过引入一个辅助量子位,发送者Alice在态的配制者Victor的帮助下,将以联合概率成功地获得未知EPR态和它的正交态。从而实现了量子态的重建。     

Quantum Network Coding on Networks with Arbitrarily Distributed Hidden Channels

Although perfect quantum network coding has been proved to be achievable, it is still puzzling whether it is feasible whenever one or more of the channels are replaced by the hidden ones emerging from quantum entanglement. The question is answered in this paper. First, we propose a quantum network coding protocol over a butterfly network with two hidden channels. Second, we investigate a more general situation, where d-level quantum letters are transmitted through the network containing arbitrarily distributed hidden channels, and prove that quantum network coding on such networks is still achievable.     

Probabilistic Teleportation of Three-Atom State via Five-Atom Cluster State

A scheme for probabilistic teleportation of an unknown three-atom entangled state via a five-atom non-maximally entangled cluster state as quantum channel is proposed. In this scheme, the sender performs two Bell state and a single-atom measurements on the atoms, the receiver can reconstruct the original state with a certain probability by introducing an auxiliary atom and operating appropriate unitary transformations and controlled-not (C-not) operations according to the sender Alice's measurement results. As a result, the probability of successful teleportation is determined by the smallest two of the coefficients'absolute values of the cluster state. The considerable advantage of our scheme is that we employ a non-maximally entangled cluster state as quantum channel in the scheme, which can greatly reduce the amount of entanglement resources and need less classical bits. If we employ a maximally entangled cluster state as quantum channel, the probabilistic teleportation scheme becomes usual teleportation, the successful probability being 100%.     

一种低经典通信消耗的量子远程态制备方案

设计了一组新的量子远程态制备步骤,在发送方对手中的粒子完成测量后,接收方采用该步骤可以有效降低远程态制备的经典通信消耗-给出一种利用部分纠缠的三粒子Greenberger-Horne-Zeilinger(GHZ)态和部分纠缠的二粒子态作信道,远程制备一个三粒子GHZ态的方案,以此方案为例具体说明上述方法的运用步骤并给出了该方法的适用范围-结果表明,运用该方法后只需消耗1bit经典信息即可远程制备一个三粒子GHZ态- 关键词： 远程态制备 经典通信消耗 三粒子Greenberger-Horne-Zeilinger态 量子信道     

Centrally controlled quantum teleportation

Through designing a quantum communication network, we propose a protocol for the teleportation between multiple senders and multiple receivers via only one controller. In order to rationally employ the quantum entanglement resources, the controller shares the entangled state with every sender, while there is no directly shared entanglement link between sender and receiver. The security is analyzed in detail. Moreover, this protocol reduces the classical communication cost in the public channel by means of the coding.     

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.     

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.     

Quantum Dense Coding Without Joint Measurement

We propose two schemes for quantum dense coding without Bell states measurement. One is deterministic, the other is probabilistic. In the deterministic scheme, the initial entangled state will be not destructed. In the probabilistic scheme, the initial unknown nonmaximal entangled state will be transformed into a maximalentangled one. Our schemes require two auxiliary particles and perform single-qubit measurements on them. Thus our schemes are simple and economic.