基于最少中继节点约束的量子VoIP路由优化策略

量子信息的传输过程中,由于拥塞、链路故障等原因,导致数据分组在路由器排队,产生时延、丢包.为了保证量子Vo IP系统的性能,本文提出了基于最少中继节点约束的路由优化策略.采用基于纠缠交换的中继技术,通过优先选择最少中继节点的量子信道,实现多用户量子Vo IP通信.理论分析和仿真结果表明,当链路出现故障和拥塞时,基于M/M/m型排队系统,采用本策略,当设定量子比特的误码率为0.2,共用信道数目从4增加到8时,量子网络的呼损率由0.25下降到0.024,量子网络的最大吞吐量由64 kbps增加到132 kbps.当设定共用信道数目为4,控制量子比特的误码率从0.3到0.1时,可使量子网络最大吞吐量从41 kbps增加到140 kbps.由此可见,本策略能够极大地提高量子Vo IP网络的性能.     

基于纠缠交换和团簇态实现二粒子任意态的可控隐形传态

提出一个对二粒子任意态的可控隐形传态方案,利用四粒子团簇态作为量子信道,用EPR态实现控制.首先,发送者向控制者提出申请,控制者再对其拥有的2个粒子做Bell基测量,并把结果通知发送者,实现纠缠交换.然后,发送者对自己手中的四个粒子做适当的幺正变换,接着进行纽曼测量,并把结果通知接受者.接受者根据发送者的测量结果,对自己拥有的粒子做适当的幺正变换,就可以重建发送者的二粒子任意态.方案成功的概率为100%.     

Quantum Secure Direct Intercommunication with Superdense Coding and Entanglement Swapping

A quantum secure direct intercommunication scheme is proposed to exchange directly the communicators＇ secret messages by making ase of swapping entanglement of Bell states. It has great capacity to distribute the secret messages since these messages have been imposed on high-dimensional Bell states via the local unitary operations with superdense coding. The security is ensured by the secure transmission of the travel sequences and the application of entanglement swapping.     

Kerr介质中纠缠原子与非简并双光子相互作用的动力学

考虑了在位于充满Kerr介质的腔中,一对纠缠的二能级原子之一与非简并双光子的相互作用,当该原子离开腔被作选测性测量时,分析测量后光场的量子性质,研究结果表明,在纠缠度一定时,Kerr效应使光场平均光子数的崩塌回复周期减小,光场的二阶相干度减弱,使Cauchy-Schwartz不等式关联程度减弱.     

Generation of Entangled State and Entanglement Swapping

A scheme is proposed for the generation of entangled atomic states and a method is presented to produce entangled photon states. It is shown that entanglement can be swapped from atoms to cavities via atom-cavity interaction.     

Matlab code for sorting real Schur forms

In Matlab 6, there exists a command to generate a real Schur form, wheras another transforms a real Schur form into a complex one. There do not exist commands to prescribe the order in which the eigenvalues appear on the diagonal of the upper (quasi‐) triangular factor T. For the complex case, a routine is sketched in Golub and Van Loan (Matrix Computations (3rd edn). The John Hopkins University Press: Baltimore and London, 1996), that orders the diagonal of T according to their distance to a target value τ. In this technical note, we give a Matlab routine to sort real Schur forms in Matlab. It is based on a block‐swapping procedure by Bai and Demmel (Linear Algebra and Its Applications 1993; 186 : 73) We also describe how to compute a partial real Schur form (see Saad (Numerical methods for large eigenvalue problems. Manchester University Press: Manchester, 1992.)) in case the matrix A is very large. Sorting real Schur forms, both partially and completely, has important applications in the computation of real invariant subspaces. Copyright © 2002 by John Wiley & Sons, Ltd.     

Mixing times for the Swapping Algorithm on the Blume‐Emery‐Griffiths model

We analyze the so called Swapping Algorithm, a parallel version of the well‐known Metropolis‐Hastings algorithm, on the mean‐field version of the Blume‐Emery‐Griffiths model in statistical mechanics. This model has two parameters and depending on their choice, the model exhibits either a first, or a second order phase transition. In agreement with a conjecture by Bhatnagar and Randall we find that the Swapping Algorithm mixes rapidly in presence of a second order phase transition, while becoming slow when the phase transition is first order. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 38–77, 2014     

Cryptanalysis and Improvement of Quantum Private Comparison Protocol Based on Bell Entangled States

Recently, Liu et al. [Commun. Theor. Phys. 57 (2012) 583] proposed a quantum private comparison protocol based on entanglement swapping of Bell states, which aims to securely compare the equality of two participants' information with the help of a semi-honest third party (TP). However, the present study points out there is a fatal loophole in Liu et al.'s protocol, and TP can make Bell-basis measurement to know all the participants' secret inputs without being detected. To fix the problem, a simple solution, which uses one-time eavesdropper checking with decoy photons instead of twice eavesdropper checking with Bell states, is demonstrated. Compared with the original protocol, it not only reduces the Bell states consumption but also simplifies the protocol steps.