9-量子团簇态信道的非对称双向量子信息传输

利用一个9-量子团簇态为信道,分别提出了三个关于二量子态和三量子态的双向量子信息传输协议。在第一个协议中,Alice能把三量子a1、a2和a3的未知态传送给Bob,Bob能把二量子b1和b2的未知态传送给Alice。Alice采用特殊三粒子态测量基,使得方案简化了一半。在第二个协议中,Alice在远方的Bob处制备三粒子a1、a2和a3的已知态,同时Bob也能在Alice处制备二量子b1和b2的已知态。由于他们充分利用了前馈测量策略,制备任务能够完美完成。在第三个协议中,利用前两个协议的优点,Alice能成功将三量子a1、a2和a3的未知态传送给Bob,Bob也完美地在Alice处制备二量子b1和b2的已知态。     

通过五粒子信道的非对称双向量子信息传输

利用一个五粒子团簇态为信道,分别提出了三个关于二粒子态和单粒子态的双向受控量子信息传输协议。在第一个协议中,通过引入辅助粒子,实施受控非门运算和Bell态测量,Alice能把二粒子未知态传送给Bob,同时Bob也能把单粒子未知态传送给Alice。在第二个方案中,通过引入辅助粒子、巧妙构造正交基和执行单粒子投影测量,Alice能帮助Bob远程地制备二粒子已知态,同时Bob也能帮助Alice远程地制备单粒子已知态。由于他们充分利用了前馈策略去构造测量基,制备任务能够完美完成。在第三个方案中,结合前两个方案的特点,Alice能成功将二粒子未知态传送给Bob,Bob也完美地在Alice处制备单粒子已知态。上述三个方案离开监控者的允许是不能实现的。     

适用网络的W态双服务器盲量子计算协议设计

结合实际的网络环境，为提高盲量子计算协议的执行效率和减少客户端占用量子服务器的时间，利用Bell态与W态的纠缠交换原理，提出了一种适用网络的双服务器盲量子协议方案。方案中客户端将计算任务分为两部分，并分别与Bob1和Bob2按照单服务器盲量子计算步骤执行完成。因为制备分别用于构造两台量子服务器中砖墙态的量子比特，只由一台量子计算机、执行一次制备过程就可以完成，与单服务器BQC相比并没有增加额外的量子服务器资源投入。方案可以实现客户端完全经典，协议具有无条件安全性。     

Cluster态的量子签名方案

提出一种利用Cluster state纠缠态实现的量子签名方案。该方案中用Cluster态作为量子信道,每一组量子比特串分别分发给消息拥有和签名者Alice、公证人TA、验签名者Bob。加载消息的方法是Alice在TA规定量子比特串序列下,分别对拥有的量子比特对的第一个量子比特进行幺正变换操作而进行。对拥有的量子比特对进行的Bell测量结果是消息的签名。Bob对拥有的对应的两个量子比特对进行Bell测量来验证签名,但要得到公证人TA对其约束才能完成。Cluster state纠缠态在纠缠特性、局域操作保真性和安全性有较好的性能。     

可控量子远程通信方案的研究

针对一般可控量子远程通信方案能防止外部窃听,但无法有效防止冒充攻击这一安全缺陷,提出一种具备身份认证功能的可控量子远程通信方案。可信任第三方Charlie利用纠缠交换对接收者Bob进行身份认证,在确定Bob的合法身份并将消息反馈给发送者Alice后,Alice再传送量子信息。该方案利用身份认证能有效防止冒充攻击,并能够增强量子信息传送的正确性和安全性。     

任意二粒子纠缠态的受控量子通信

为了解决任意二量子通信问题,首先给出了五粒子和七粒子纠缠态的构造方法,并提供了它们的量子线路图。其次,以该五粒子纠缠态为量子信道,提出一个任意二粒子未知量子态的受控隐形传态协议。该协议在监察者Charlie的控制下,Alice进行四粒子投影测量和经典通信,Bob采用简单酉变换就能以100%的概率成功重构一个任意二粒子纠缠态。最后,利用七粒子纠缠态为量子信道,提出了任意二粒子纠缠态的联合受控远程制备方案。在此方案中,发送者Alice用自己掌握被制备态的部分信息构造测量基,发送者Bob采用前馈测量策略,接收者Diana在监控者Charlie的帮助下,通过简单幺正变换就能确定性地恢复原始态。     

一种基于量子纠缠态的群签名协议*

提出了一个基于打印机管理模型的量子群签名协议。利用量子纠缠特性,打印机群组成员Alice可以代表群组进行签名,打印机管理员Bob可以证实签名来自该群组,但是不能够确定是哪一位成员进行了签名。如果出现了争议,群管理员Trent可以追踪到非法打印者。不同于现存的经典群签名协议和量子签名协议,本协议在实现签名群属性的同时,具有无条件安全性,能够在电子选举和电子商务中得到广泛应用。     

基于量子Calderbank-Shor-Steane纠错码的量子安全直接通信

量子安全直接通信是继量子密钥分配之后提出的又一重要量子密码协议,它要求通信双方在预先不需要建立共享密钥的情况下就可以实现消息的保密传输.给出了一个新的量子安全直接通信方案,该方案利用量子Calderbank-Shor-Steane(CSS)纠错码和未知量子态不可克隆等性质,方案的安全性建立在求解一般的线性码的译码问题是一个NP完全问题、Goppa码有快速的译码算法和量子图灵机不能有效求解NP完全问题的基础上.在协议中,发送方Alice把要发送的秘密消息转化为一一对应的错误向量,把错误向量加到其接收到的、Bob编码过的量子态上,并发给接收方Bob.Bob利用其私钥,通过测量、解码可以得到错误向量,并可以用相应的算法恢复出秘密消息.控制量子信道的攻击者Eve不能恢复出秘密消息,因其不知道Bob的密钥.与已有的量子安全直接通信方案相比,该方案不需要交换任何额外的经典信息和建立量子纠缠信道.     

受控循环远程态制备

为了解决多方量子通信问题,首先提出一种构造十粒子纠缠态的方法,并籍此构造出一个3◢n◣+1粒子纠缠态。其次,以十粒子纠缠态为量子信道,提出一个三方受控循环远程制备协议。该协议在监察者David的控制下,Alice能为Bob远程制备一个任意单粒子态,Bob能够在Charlie处远程制备一个任意单粒子态,Charlie也能为Alice远程制备任意单粒子态。进一步,借助3◢n◣+1粒子纠缠态,将此循环协议推广到任意◢n◣方受控循环远程态制备情形。在远程态制备过程中,每个发送者充分利用各自掌握的信息和前馈策略来构造恰当的测量基,通过经典通信和局域操作,就能成功实现任意单粒子态的远程制备。     

利用最大真纠缠六方态共享经典秘密信息

纠缠是一种重要的量子信息资源,Bell态、GHZ态等纠缠态被广泛用于量子秘密共享中。Borras等人发现的最大真六方纠缠态在任意的双方割之间具有最大的纠缠值,已经被证明可用于量子隐形传态,并表现良好的性质。通过分析Borras态的结构,利用广义Schmidt分解工具,构造了一个具体的量子秘密共享协议:事先在Alice和4个代理之间共享一个Borras纠缠态,Alice拥有其中2个qubit,代理们分别拥有它的1个qubit,则Alice可在代理间共享2bit经典信息。     

Secure communication via quantum illumination

In the quantum illumination protocol for secure communication, Alice prepares entangled signal and idler beams via spontaneous parametric downconversion. She sends the signal beam to Bob, while retaining the idler. Bob imposes message modulation on the beam he receives from Alice, amplifies it, and sends it back to her. Alice then decodes Bob’s information by making a joint quantum measurement on the light she has retained and the light she has received from him. The basic performance analysis for this protocol—which demonstrates its immunity to passive eavesdropping, in which Eve can only listen to Alice and Bob’s transmissions—is reviewed, along with the results of its first proof-of-principle experiment. Further analysis is then presented, showing that secure data rates in excess of 1 Gbps may be possible over 20-km-long fiber links with technology that is available or under development. Finally, an initial scheme for thwarting active eavesdropping, in which Eve injects her own light into Bob’s terminal, is proposed and analyzed.     

Efficient quantum private comparison employing single photons and collective detection

Two efficient quantum private comparison (QPC) protocols are proposed, employing single photons and collective detection. In the proposed protocols, two distrustful parties (Alice and Bob) compare the equivalence of information with the help of a semi-honest third party (TP). Utilizing collective detection, the cost of practical realization is reduced greatly. In the first protocol, TP gains the result of the comparison. While in the second protocol, TP cannot get the comparison result. In both of our protocols, Alice and Bob only need be equipped with unitary operation machines, such as phase plates. So Alice and Bob need not to have the expensive quantum devices, such as qubit generating machine, quantum memory machine and quantum measuring machine. Security of the protocols is ensured by theorems on quantum operation discrimination.     

Three-party remote state preparation schemes based on entanglement

By exploiting the entanglement correlation in quantum mechanics, two three-party remote state preparation (RSP) schemes are proposed. One is three-party remote preparation of a single-particle quantum state, and the other is three-party remote preparation of a two-particle entangled state. In the proposed schemes, the sender Alice knows the quantum states to be prepared, while the receivers Bob and Charlie do not know the quantum states; Alice performs measurement and unitary operations on her own particles with two three-particle GHZ states as the quantum channel. According to Alice’s measurement results, Bob and Charlie measure their own particles on the corresponding quantum measurement bases and perform unitary operations on the corresponding particles to reconstruct the quantum states, respectively. Compared with multiparty joint remote preparation and two-party RSP of a quantum state, the proposed schemes realize quantum multicast communication successfully, which enables Bob and Charlie to obtain the prepared quantum states simultaneously in the case of just knowing Alice’s measurement results, while Bob and Charlie do not know each other’s prepared quantum states. It is shown that only three classical bits are required for the two proposed RSP schemes when Bob and Alice introduce an auxiliary particle, respectively, and the proposed schemes are secure after the quantum channel authentication.     

Transfer of spatial reference frame using singlet states and classical communication

A simple protocol is described for transferring spatial orientation from Alice to Bob (two spatially separated observers). The two observers are assumed to share quantum singlet states and classical communication. The protocol assumes that Alice and Bob have complete free will (measurement independence) and is based on maximizing the Shannon mutual information between Alice and Bob’s measurement outcomes. Repeated use of this protocol for each spatial axis of Alice allows transfer of a complete three-dimensional reference frame, up to inversion of each of the axes. The technological complexity of this protocol is similar to that needed for BB84 quantum key distribution and hence is much simpler to implement than recently proposed schemes for transmission of reference frames. A second protocol based on a Bayesian formalism is also discussed.     

辅助量子比特驱动型通用盲量子计算

应用量子隐形传态将Broadbent等人提出的通用盲量子计算(universal blind quantum computation)模型和辅助量子比特驱动型量子计算(ancilla-driven universal quantum computation)模型进行结合, 构造一个新的混合模型来进行计算。此外, 用计算寄存器对量子纠缠的操作来代替量子比特测量操作。因为后者仅限于两个量子比特, 所以代替后的计算优势十分明显。基于上述改进, 设计了实现辅助驱动型通用盲量子计算的协议。协议的实现, 能够使Anders等人的辅助驱动型量子计算增强计算能力, 并保证量子计算的正确性, 从而使得参与计算的任何一方都不能获得另一方的保密信息。