Research On Quantum Wireless Cellular Communication Network Based On W States

Due to the rapid development of quantum information technology,quantum communica-tion research limited to two points has not meet the needs of future quantum communication network.How to build high-performance and efficient multiple-hops quantum communication network gradually become a research hotspot.Quantum wireless cellular communication network model is proposed in this paper.The network consists of two kinds of nodes and three kinds of links:nodes include communication nodes and key nodes,links include links sending entangled particles,quantum links and wire-less links.Key nodes have the function of distributing entangled particles.Quantum channels between nodes are built by sharing entangled particles.In this paper,W states and EPR pairs are selected as quantum channel and multiple-hops transmission characteristics of this channel are also analyzed.Improved quantum search algorithm is also introduced for picking up those key nodes in the network model.Firstly,basic knowledge and calculations of quantum mechanics related to quantum com-munication are introduced,such as quantum bit,quantum system and tensor product calcula-tion.These theories are the fundamental basis for deeply understanding and deducing the new teleportation schemes.Some quantum gates are also particularly introduced,which are basic composing of quantum circuit.At last,quantum parallelism is introduced,which is the key to quantum search algorithm.Secondly,a new teleportation scheme is proposed based on the quantum channels built by W states and EPR pairs.The feasibility of multi-hop teleportation is verified by mathemati-cal induction and the successful transmission probability is calculated which is better than the teleportation scheme based on double W states.Finally,quantum wireless cellular communication network model is presented and im-proved quantum search algorithm is introduced.The improved quantum search algorithm is suitable for the optimization problem and used for picking up key nodes in network model.In this paper,the network is abstracted as a knapsack problem and the key nodes are selected using improved quantum search algorithm.In the handling of the optimization problem,the improved quantum search algorithm is simpler and more efficient compared with the traditional Grover algorithm.