虚拟化与数字仿真融合的网络仿真任务划分

为提升网络仿真性能,面向虚拟化与数字仿真融合的网络仿真体系架构,研究相应的网络仿真任务划分方法。综合考虑虚拟化与数字仿真各自优势,将网络拓扑分为虚拟化拓扑区域与数字仿真拓扑区域,结合给定物理资源,以负载均衡与远程通信量最小化为目标,对两种区域进行融合划分。实验表明,通过该方法进行网络仿真任务划分相对于随机算法与均衡负载平衡算法,远程通信量平均降低了33. 7%、25. 1%,负载均衡度平均提升了56. 3%、38. 0%。该方法可有效降低远程通信量与提升负载均衡度。

Classical Communication Cost and Probabilistic Remote Preparation of Four-Particle Entangled W State

We present a scheme for probabilistic remote preparation of the four-particle entangled W state by using four partial entangled two-particle states as the quantum channel. In this scheme, if Alice （sender） performs four-particle projective measurements and Bob （receiver） adopts some appropriate unitary operation, the remote state preparation can be successfully realized with certain probability. The classical communication cost is also calculated. However, the success probability of preparation can be increased to 1 for four kinds of special states.

Quantum Steganography via Greenberger-Horne-Zeilinger GHZ_4 State

A quantum steganography communication scheme via Greenberger-Horne-Zeilinger GHZ 4 state is constructed to investigate the possibility of remotely transferred hidden information.Moreover,the multipartite entangled states are become a hectic topic due to its important applications and deep effects on aspects of quantum information.Then,the scheme consists of sharing the correlation of four particle GHZ4 states between the legitimate users.After insuring the security of the quantum channel,they begin to hide the secret information in the cover of message.Comparing the scheme with the previous quantum steganographies,capacity and imperceptibility of hidden message are good.The security of the present scheme against many attacks is also discussed.

Probabilistic Remote Preparation of a Four-Particle Entangled W State for the General Case and for All Kinds of the Special Cases

We present a protocol for probabilistic remote preparation of a four-particle entangled W state. The quantum channel is composed of two partial entangled four-particle cluster states. We caiculate the total successful probability and total classical communication cost required for the general case and for all kinds of the special cases, respectively. It is shown that for two maximally entangled four-particle cluster states, such a scheme for the general case has the total successful probability of 25% and only consumes the total classical communication of I bit, while this scheme for the special cases under certain conditions can possess successful probability of 50% or 100%, the required classical communication will only be 2 bits or 4 bits. Meantime, we give in detail all unitary transformations for the general case and for all kinds of the special cases, respectively.

Quantum Teleportation via Completely Anisotropic Heisenberg Chain in Inhomogeneous Magnetic Field

The quantum teleportation with the entangled thermai state is investigated based on the completely anisotropie Heisenberg chain in the presence of the externally inhomogeneous magnetic field. The effects of the anisotropy and magnetic field for the quantum fidelity are studied in detail The zero temperature limit and the features of the nonzero temperature for this nonclassical fdelity are obtained. We find that the quantum teleportation demands more stringent conditions than the therma/ entanglement of the resource by investigating the threshold temperature of the thermal concurrence and the criticai temperature of the maximai teleportation fidelity. The useful quantum teleportation should avoid the point of the phase transition of the system and the anisotropy of the chain and the external magnetic field can control the applicability of the resource in the quantum teleportation.