CN109982410B - Quantum wireless mesh network routing method and framework based on entanglement exchange - Google Patents
Quantum wireless mesh network routing method and framework based on entanglement exchange Download PDFInfo
- Publication number
- CN109982410B CN109982410B CN201910311453.9A CN201910311453A CN109982410B CN 109982410 B CN109982410 B CN 109982410B CN 201910311453 A CN201910311453 A CN 201910311453A CN 109982410 B CN109982410 B CN 109982410B
- Authority
- CN
- China
- Prior art keywords
- node
- quantum
- particles
- router
- entangled
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of quantum communication, and discloses a quantum wireless mesh network routing method and a quantum wireless mesh network routing framework based on entanglement exchange, wherein node hop counts in a wireless quantum mesh network and comprehensive weight of round-trip time parameters are used as overhead values of the routing, and each node is enabled to be gradually networked by using a minimum spanning tree method to construct a classical channel in the network; then, preparing and distributing entangled particles by partial nodes in the network, and carrying out quantum entanglement exchange and measurement by the other partial nodes to construct quantum channels; and finally, quantum information is transmitted between the source node and the destination node by a quantum invisible state transmission method. The invention can logically regard the wireless quantum mesh network with a complex structure as a tree-shaped ring-free network topology, thereby avoiding the generation of network storm; a 'pairwise combination' scheme is proposed to establish a quantum channel between a source node and a destination node.
Description
Technical Field
The invention belongs to the technical field of quantum communication, and particularly relates to a quantum wireless mesh network routing method and framework based on entanglement switching.
Background
Currently, the current state of the art commonly used in the industry is such that:
quantum communication is an interdisciplinary subject combining classical information theory and quantum mechanics, is a brand-new communication mode utilizing quantum state carried information, breaks through the limit of classical communication technology in the aspects of communication safety, computing capacity, information transmission, channel capacity, measurement precision and the like, and becomes a new direction and mainstream for the development of communication and information fields in the 21 st century. One significant advantage of quantum communication over classical communication is that security under strict mathematical proofs can be achieved. The quantum communication breaks through the constraint of the traditional safety communication technology (the safety communication is realized by using quantum state information carried by the microscopic particles) by the unique characteristic of the quantum state, and has the advantages of no eavesdropping, no reproducibility and theoretical unconditional safety, thereby ensuring the safety of the communication and having great application value in the fields of network technology and information safety.
A Quantum entangled state (Quantum entangled state) is a non-localized, non-classical relationship between two or more Quantum systems, and is a mechanical property of the relationship between subsystems or respective degrees of freedom within a Quantum system. The quantum entanglement state is a unique phenomenon among substances in the micro world and is therefore a unique concept in quantum information theory. In 1993, Bennett et al first proposed Quantum invisible transport (Quantum Telep) based on Quantum entanglementortation,QT)[1]. At a later time,
based on Quantum invisible state as research, Quantum entanglement exchange (Quantum Swapping) is provided[2]The idea of (1).
After the research on quantum invisible state transfer and entanglement exchange has been proposed, the research has attracted much attention. For example, in 2000, Populus et al studied the problem of multi-particle generalization with quantum invisible transport states[3]Van Loock et al have studied stealth propagation of continuous variables[4]. Quantum pure state invisible state transfer scheme for realizing S energy level through 2 energy level entangled state in 2001[5]. First experiment of Zhao et al in 2003 proves that quantum non-locality is caused in entanglement of four-photon Greenberger-Horne-Zeilinger[6]And a quantum repeater model based on entanglement swapping is proposed. In 2012, the Panjianwei team internationally successfully realizes the invisible state and entanglement distribution of the free space quantum at hundred kilometers level for the first time, and lays a technical foundation for transmitting the first global quantum communication satellite[7]. In 2016, Fred ric gross et al proposed quantum cloning and stealth-transitive criteria for continuous quantum variables[8]。
At present, the study on entanglement exchange and quantum invisible states is relatively mature. Along with the continuous development of quantum communication technology, entanglement exchange and invisible transmission states are used as theoretical basis and important technical means, and the method has become a main idea for people to explore and construct a quantum communication network and an inter-node routing strategy. The above studies theoretically and experimentally verify the feasibility of constructing quantum communication networks, and people begin to research the topology and communication protocol of quantum communication networks based on the results of the studies. A quantum LAN scheme is proposed and its performance is analyzed[9]. Fred ric Dupuis et al studied the problem of quantum broadcast channel protocols and proposed solutions[10]Zhou nan et al designed an entanglement association-based quantum communication protocol at the data link layer[11]. Zhou Xiao Qing, etcThe interconnection and routing strategies of the quantum invisible transport network are explored by people through the idea of entanglement exchange, and the multicast and broadcast protocol in the quantum invisible transport network is provided by combining the classical network on the basis of the research[12,13]。
With the continuous and deep research on the topology, routing strategy and communication protocol of the quantum communication network, some more characteristic quantum communication network research schemes are provided. For example, Yu Xuan Tao et al proposed a wireless ad hoc quantum communication network routing protocol based on quantum stealth state of communication[14]. Liu Xiao Hui et al proposed the construction of wireless quantum wide area network and its routing strategy[15]Nie Min et al studied the quantum communication network transmission protocol based on packet switching and performed performance analysis[16]。
In summary, the problems of the prior art are as follows:
(1) since the wireless Mesh network is a wireless broadband access network technology which is rapidly developed in recent years, research on the wireless quantum Mesh network is less. In addition, the solution proposed in document [14], the route discovery procedure is based on a broadcast mechanism. If a route request is used once in a large network, most nodes in the entire network may join. When the message is transmitted, a large amount of request messages occupy channels, and the communication capacity of the network is reduced. Document [16], on the basis of document [14], applies the packet transmission concept in the classical communication network to the quantum communication network. The information to be sent is split into a number of messages sent by the source host and intermediate routing nodes. Respectively forwarding to the target host. However, this solution does not address how to avoid loops that may occur during route discovery.
(2) In the existing wireless quantum Mesh network technology, a proper communication path is not selected through the thought of a minimum spanning tree, and node routers are numbered and marked, so that the proper node routers prepare and distribute entangled quantum pairs to establish quantum channels and transmit quantum information. (3) In the existing wireless quantum network, the establishment of quantum channels is mostly a method of performing quantum entanglement switching operation from a source node to a destination node one by one until the destination node receives measurement information; or quantum entanglement exchange is carried out from the source node and the destination node to the intermediate node respectively, and one intermediate node receives measurement information from the two parties. However, these methods need to perform many measurements, and these measurement information will be transmitted through the classical channel, consuming many network resources, and increasing the load of the network.
The difficulty in solving the technical problems is as follows:
(1) how to convert a communication network into a tree-like loop-free network topology. There are many methods for minimum spanning tree in existence, and how to select a suitable method to logically transform the communication network into a tree-like ring-free network structure, thereby establishing a classical channel between nodes.
(2) After the classical channel is established, how to select a proper node router to prepare and distribute the entangled particle pairs, thereby establishing the quantum channel. The method for establishing the quantum channel needs numbering and grouping the node routers so as to carry out entanglement exchange. The key to construct the quantum channel is how to select the grouping method to entangle the particles held by different node routers.
The significance of solving the technical problems is as follows: the quantum communication technology is applied to the wireless Mesh network, so that the efficiency of establishing a quantum channel can be improved, the network load of a classical channel is reduced, and the utilization rate of the network is improved. In addition, the users in the network can be ensured to be capable of carrying out safe communication.
Reference documents:
[1]Bennett C H,Brassard G,Crépeau C,et al.Teleporting an unknownquantum state via dual classical and Einstein-Podolsky-Rosen channels.[J].Physical Review Letters,1993,70(13):1895.
[2]
M.Bell theorem involving all settings of measuringapparatus[J].Physics Letters A,1993,177(4–5):290-296.
[3]Chuiping Y,Guangcan G.Multiparticle Generalization ofTeleportation[J].Chinese Physics Letters,2000,17(3):162.
[4]Loock P V,Braunstein S L,Kimble H J.Broadband teleportation[J].Phys.rev.a,2000,62(2):117-134.
[5]Zhou J,Hou G,Zhang Y.Teleportation scheme of S-level quantum purestates by two-level Einstein-Podolsky-Rosen states[J].Physical Review A,2001,64 012301
[6]Zhao Z,Yang T,Chen Y A,et al.Experimental Test of QuantumNonlocality in Four-photon Greenberger-Horne-Zeilinger Entanglement[J].Physics,2003,91(18):11173-11186.
[7]Yin J,Ren J G,Lu H,et al.Quantum teleportation and entanglementdistribution over 100-kilometre free-space channels[J].Nature,2012,488(7410):185.
[8]Grosshans F,Grangier P.Quantum cloning and teleportation criteriafor continuous quantum variables[J].Physical ReviewA,2016,64(1):783-97.
[9]Zhu C H,Pei C X,Ma H X,Yu X F.A scheme of quantum local networksand performance analysis[J].Journal ofXidian University,2006,33(6).
[10]Dupuis F,Hayden P,Li K.AFather Protocol for Quantum BroadcastChannels[J].IEEE Transactions on Information Theory,2010,56(6):2946-2956.
[11]Nanrun Z,Zeng G H,Gong L H,et al.Quantum communication protocolfor data link layer based on entanglement[J].Acta Physica Sinica,2007,56(9):5066-5070.
[12]Zhou X Q,WuYW,Zhao H.Quantum teleportation internetworking androuting strategy[J].Acta Physica Sinica,2011,60(4):35-40.
[13]Zhou X Q,WuYW.Broadcast and multicast in quantum teleportationinternet[J].Acta Physica Sinica,2012,61(17).
[14]Xu X T,Xu J,Zhang Z C.Routing protocol for wireless ad hocquantum communication network based on quantum teleportation[J].Acta PhysSin,2012,61(22):514-518.
[15]Liu X H,Nie M,Pei C X.Quantum wireless wide-area networks androuting strategy[J].Acta Physica Sinica,2013,62(20):200304-200304.
[16]Min N,Wang L F,Yang G,et al.Transmission protocol and itsperformance analysis ofquantum communication network based on packetswitching[J].Acta Physica Sinica,2015.
[17]Yi Q,Zuo H J,Sun X L,et al.Research on tree topology-basedrouting protocol in wireless mesh network[J].Computer Engineering and Design,2010,31(9):1893-1897
[18]Yin J,Ren J G,Lu H,et al.Quantum teleportation and entanglementdistribution over 100-kilometre free-space channels.[J].Nature,2012,488(7410):185-188.
[19]Peng C,Pan J.Quantum Science Experimental Satellite“Micius”[J].Bulletin of ChineseAcademy ofSciences,2016.
disclosure of Invention
Aiming at the problems in the prior art, the invention provides a quantum wireless mesh network routing method and a quantum wireless mesh network routing framework based on entanglement swapping.
The invention is realized in such a way that a quantum wireless mesh network routing method based on entanglement swapping comprises the following steps:
taking node hop number in the wireless quantum mesh network and comprehensive weight of round trip time parameters as a routing overhead value, and utilizing a minimum spanning tree method to enable each node to gradually enter the network to construct a classical channel in the network;
then, preparing and distributing entangled particles by partial nodes in the network, and carrying out quantum entanglement exchange and measurement by the other partial nodes to construct quantum channels;
and finally, quantum information is transmitted between the source node and the destination node by a quantum invisible state transmission method.
Further, the classical channel establishing method comprises the following steps:
taking the comprehensive weight of link capacity and round trip time parameters as an overhead value of a routing criterion, selecting a Mesh router directly connected with a source host as a root node, receiving a Hello packet sent by a network-accessed node by a new node, constructing and maintaining a neighbor table, calculating the overhead values of different father nodes through the neighbor table, and finally selecting the node with the minimum routing overhead value as the father node for gradually accessing the network; logically converting the whole wireless Mesh network into a tree-shaped ring-free topological structure;
after a tree-shaped ring-free network topology is constructed, a source host node sends a route discovery message for searching a path from the source host node to a destination host node; the Ethernet data packet is encapsulated again and then sent out;
after receiving the message, the node in the path splits the message to obtain a packet header 1, a packet header 2 and a packet header 3; then comparing whether the receiving node is consistent with the destination node, if the inconsistency shows that the node is not the destination node, adding 1 to the current hop count and the number of hops in the packet header 3, setting the receiving node in the packet header 1 as a next-hop router, and finally encapsulating and forwarding; if the consistency indicates that the node is the destination node, stopping forwarding;
when the destination node receives the route discovery message, a response message is sent in a reverse direction to inform the source node that the path can be reached, and a quantum channel is established; finally, packaging and forwarding;
after receiving the response message, the nodes in the path are split, and then whether the receiving node is consistent with the destination node or not is compared, if not, the receiving node in the packet header 1 is set as a next hop router, and only the current hop number in the packet header 3 is reduced by 1, and then the packet is encapsulated and forwarded.
Further, in the quantum channel establishing method, after the source host receives the route determining message, the path is determined to be accessible, and the source host sends a message requesting to establish the entangled quantum channel along the determined path; when a node router in the path learns that the node is already used as a node in the selected path, quantum state transmission is carried out;
the method for establishing the quantum channel specifically comprises the following steps:
firstly, N is used for representing the number of node routers in a selected path;
and if N is an odd number, all the node routers with the odd numbers prepare entangled particles and distribute the entangled particles to the node routers with the even numbers, wherein the router nodes directly connected with the source host distribute the entangled particles to the next hop node router and the source host thereof, and the router nodes directly connected with the destination host distribute the entangled particles to the last hop node router and the destination host thereof. All nodes with even numbers of entangled particles can be regarded as a new node sequence, and the nodes perform measurement and quantum entanglement swapping, including:
(i) for the new sequence, starting from the node router with the largest number to the node router with the smallest number, every two routers are combined together; the number of the nodes in the new sequence is odd, and the node with the minimum number does not participate in grouping; if the number is even, the node with the minimum number participates in grouping;
(ii) after grouping, the router with the larger number in each group executes C-NOT gate and H gate operation on the owned particles, measures the operation, and transmits the measurement result to another router in the same group through a classical channel;
(iii) (iii) regrouping the routers that received the measurement in (ii), and repeating the operation in step (i) until the source node receives the measurement information from the router;
and if N is an even number, all the node routers with the even numbers prepare entangled particles and distribute the entangled particles to the node routers with the odd numbers, meanwhile, the next-hop node router directly connected with the source host also needs to prepare entangled particles, one part of the entangled particles is reserved, and the other part of the entangled particles is distributed to the source host. All nodes with entangled particles can be regarded as a new node sequence. The operation for the new node sequence is the same as if N were odd.
Further, the odd node router prepares entangled particles and distributes the entangled particles to adjacent nodes; nodes participating in entanglement exchange form a new sequence { A, C, E, G, I, K, M };
when the number of N is odd number K, possessed J2J owned by particle and Router I1ParticlesIn a quantum state
Having L1L owned by the particle and the destination node M2The particles are in a quantum state, then the total state of these four particles is:
the method specifically comprises the following steps:
first, node K will be J2Particles and L1After the particles are transformed by the CNOT gate and the H gate, four particles are represented as:
the above equation shows that after entanglement swapping, node K uses { |00>，|01>，|10>，|11>Performing measurement as a measurement basis when the measurement result is |00>Particle J1And L2Is in the state
Secondly, when the node I receives the measurement result from the node K, the node I and the node M share the entanglement state of the entangled particles; next, node I again performs entanglement swapping to make particle H1And particles L2Entangled, measured, and communicated to node E.
Thirdly, the node E receives the measurement result of the node I and determines the state of the entangled particles shared by the node E and the node M; then node E performs entanglement swapping again and sends the measurement result to node C;
when node C receives the result from node E, node C performs entanglement swapping again; if B is1Particles and B2The particles are in an entangled state
D1Particles and L2The particles are in an entangled state
Node C performs an entanglement swap with the result:
particle B owned by node A1And a particle L owned by node M2Forming entanglement; node C then pairs particle D1And particles B2Measuring and sending a measurement result to the node A; when the node A receives the measurement result, determining a winding state node M of the shared entangled particles; an entangled quantum channel is established between the source node and the destination node.
Further, the quantum information transmission is carried out between the source node and the destination node by a quantum invisible state method, which specifically comprises the following steps:
after quantum channels are established, source nodes transmit quantum state information through quantum invisible state transmission; the transferred quantum state is
Wherein α and β are both complex numbers, satisfy | | α | | non-volatile phosphor2+||β||21, particle B1Particles L2And the total state of the particles to be transported is:
when the source node A is paired with the particle
And particles B1Measured, particles L2Collapse to the corresponding quantum state and transmit the measurement result to the destination node M; according to the measurement result, the node M is paired with the particle L2Performing the corresponding unitary operation, the particle L2Become into|L2>＝α|0>+β|1>(ii) a After the route is determined by the routing protocol, quantum carrying information is processed by quantum entanglement exchange and invisible state transmission
And transmitting the quantum information from the source node to the destination node through a wireless quantum mesh network to complete the transmission of the quantum information.
Another object of the present invention is to provide a computer program for implementing the entanglement switching-based quantum wireless mesh network routing method.
Another object of the present invention is to provide an information data processing terminal for implementing the entanglement switching-based quantum wireless mesh network routing method.
Another object of the present invention is to provide a computer-readable storage medium, comprising instructions, which when run on a computer, cause the computer to execute the entanglement switching-based quantum wireless mesh network routing method.
The invention also aims to provide a network topology structure of the wireless quantum mesh network for realizing the entanglement switching-based quantum wireless mesh network routing method.
In summary, the advantages and positive effects of the invention are：
The invention analyzes the concept of the wireless quantum mesh network and designs a routing protocol for the network, and through the protocol, the wireless quantum mesh network with a complex structure can be logically regarded as a tree-shaped ring-free network topology, thereby avoiding the generation of network storms. In addition, the invention also improves the method of 'two-end approximation' proposed before, and proposes a 'pairwise combination' scheme to establish a quantum channel between a source node and a destination node.
In the routing protocol, comprehensive weights of parameters such as node hop number, round trip time and the like in a wireless quantum mesh network are used as overhead values of routing, and each node is enabled to gradually enter the network by using a minimum spanning tree method to construct a classical channel in the network. Then, part of nodes in the network are used for preparing and distributing entangled particles, and the other part of nodes are used for quantum entanglement exchange and measurement to construct quantum channels. And finally, quantum information is transmitted between the source node and the destination node by a quantum invisible state transmission method.
As can be seen from fig. 6, the method of reference [14] is used to create a quantum channel whose number of steps increases linearly with the number of nodes in the path. In the protocol of the present invention, the number of steps to establish a quantum channel increases logarithmically as the number of nodes increases. In fig. 6, when the total number of nodes in the path is greater than 8, our protocol grows slowly, while the protocol in reference [14] grows faster. As the number of nodes in the path increases, the number of steps required to establish a quantum channel by the protocol of the present invention will be significantly less than the protocol in [14 ]. For example, if there are 50 nodes in the path, the protocol of the present invention requires 6 steps. The protocol of reference [14] requires 24 steps.
Drawings
Fig. 1 is a flowchart of a quantum wireless mesh network routing method based on entanglement swapping according to an embodiment of the present invention.
Fig. 2 is a network topology structure diagram of a wireless quantum mesh network according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of particle preparation and distribution when N is an odd number, provided by an embodiment of the present invention.
Fig. 4 is a flow chart of a routing protocol provided by an embodiment of the present invention.
Fig. 5 is a selected path quantum circuit diagram provided by an embodiment of the present invention.
Fig. 6 is a diagram comparing two protocols provided by an embodiment of the invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
For a wireless quantum mesh network with a complex structure, the invention provides and analyzes a new routing protocol. First, to avoid network storms, a minimum spanning tree method is used when building classical channels between nodes. Secondly, a new method of establishing quantum channels is proposed. This new approach is more efficient than the commonly used "two-end approach" approach. Finally, quantum information transmission is accomplished through quantum invisible states.
As shown in fig. 1, the quantum wireless mesh network routing method based on entanglement switching according to the embodiment of the present invention includes:
s101: taking node hop number in the wireless quantum mesh network and comprehensive weight of round trip time parameters as a routing overhead value, and utilizing a minimum spanning tree method to enable each node to gradually enter the network to construct a classical channel in the network;
s102: then, preparing and distributing entangled particles by partial nodes in the network, and carrying out quantum entanglement exchange and measurement by the other partial nodes to construct quantum channels;
s103: and finally, quantum information is transmitted between the source node and the destination node by a quantum invisible state transmission method.
The invention is further described below with reference to specific assays.
1. Quantum wireless mesh network
In a conventional Wireless Local Area Network (WLAN), each client accesses a network through a Wireless link connected to an Access Point (AP) to form a local Basic Service Set (BSS). Users must first access a fixed access point if they want to communicate with each other, and this network architecture is called a single hop network.
In a wireless Mesh network, any wireless device node can simultaneously serve as an access point and a router, each node in the network can send and receive signals, and each node can directly communicate with one or more peer nodes.
The network topology of the wireless quantum mesh network is shown in fig. 2.
The solid and dashed lines in fig. 2 represent the classical wireless channel and the quantum channel, respectively, wherein the quantum channel is composed of shared pairs of entangled particles. Quantum information can be transmitted when both classical wireless channels and quantum channels coexist. If multiple user nodes are connected to the same router node and all have a wireless channel and a quantum channel, quantum information can be directly transmitted. However, when a user connects to different router nodes, it is necessary to select an appropriate path to implement long-distance quantum communication between two user nodes according to factors such as the number of hops, connection quality, and round-trip time.
2. Quantum wireless mesh network routing protocol
2.1 establishment of classical channel
Before a Source Host (Source Host) and a Destination Host (Destination Host) establish a quantum channel, a path needs to be determined by a classical channel, and at present, the establishment of the classical channel in most quantum wireless Mesh networks is through broadcasting, so that although the path between the Source Host and the Destination Host can be found, a large amount of request information can occupy the channel, and the load of the network is increased.
In the scheme, reference is made to a document [17] in the process, comprehensive weights of parameters such as link capacity and round trip time are used as overhead values of routing criteria, a Mesh router directly connected with a source host is selected as a root node, a new node receives a Hello packet sent by a network-accessed node, the Hello packet comprises the routing overhead values of the network-accessed node, a neighbor table is built and maintained, the overhead values of different father nodes are calculated through the neighbor table, and finally, the node with the minimum routing overhead value is selected as the father node and is accessed step by step, so that the whole wireless Mesh network is logically converted into a tree-shaped loop-free topological structure, and the phenomenon that a loop is formed in the process of building a classical channel, a network storm is generated, and network paralysis is caused is avoided.
After the tree-shaped ring-free network topology is constructed, the source host node needs to send a route discovery message for finding a path from the source host node to the destination host node. The ethernet packet is re-encapsulated herein with reference to the IEEE802.11 standard. The format after encapsulation is shown in table 1.
Table 1 message format
As shown in table 1, the source node sets the current hop count and the path hop count in the packet header 3 to 0, writes the destination node and the source node into the packet header 2, sets the receiving node in the packet header 1 as the next-hop router, uses an identifier to represent the route discovery process, and sends out the encapsulated route.
When a node in a path receives a message, the message is split to obtain a packet header 1, a packet header 2 and a packet header 3. Then comparing whether the receiving node is consistent with the destination node, if the inconsistency shows that the node is not the destination node, adding 1 to the current hop count and the number of hops in the packet header 3, setting the receiving node in the packet header 1 as a next-hop router, and finally encapsulating and forwarding; if the agreement indicates that the node is the destination node, then forwarding is stopped.
When the destination node receives the route discovery message, a response message is sent in a reverse direction to inform the source node that the path is accessible, and a quantum channel can be established. The format of the response packet is similar to table 1, except that an identifier is used to mark the response packet again in the packet header 1, the receiving node is the last-hop router in the discovery process, the source node and the destination node in the packet header 2 are the result of exchanging the packet header 2 in the discovery packet, the current hop count and the path hop count in the packet header 3 are the result of discovering the packet header 3, and finally the result is encapsulated and forwarded.
After receiving the response message, the nodes in the path split the response message, then compare whether the receiving node is consistent with the destination node, if not, set the receiving node in the packet header 1 as the next-hop router (i.e. the last-hop router in the discovery process), and only subtract 1 from the current hop count in the packet header 3, then encapsulate and forward; if the two nodes are consistent, the node is a destination node (namely, a source node of a discovery process), and the forwarding is stopped.
2.2 establishment of Quantum channels
When the source host receives the route determination message and determines that the path is accessible, the source host sends a message requesting to establish an entangled quantum channel along the determined path. And when the node router in the path learns that the node is already used as the node in the selected path, the quantum state transmission is carried out.
In this scheme, the present invention provides a new method to establish a quantum channel between a source node and a destination node. First, N is used to indicate the number of node routers in the selected path, and since the number may be odd or even, there are two cases in this new method.
Assuming N is odd, all routers in the selected path with odd labels generate entangled particles and distribute them to neighboring nodes[18,19]Thus, all nodes numbered even have entangled particles and these nodes perform measurements to achieve quantum entanglement swapping.
FIG. 3 can be used to show the preparation and distribution of entangled particles where N is an odd number. If N is an even number, then all routers with even numbers in the path generate entangled particles and distribute the entangled particles to adjacent nodes, and routers directly connected with the source node also prepare entangled particles, distribute one of the entangled particles to the source node, and reserve the other router. The quantum channels are established in the same way as in the case where the total number N is odd.
In fig. 3, the node routers are labeled with 1, 2, 3, 11 and so know that N is 11. All odd node routers then prepare the entangled quantum pairs and distribute them to the neighboring node routers.
Thus, the even node router can be logically regarded as a new node sequence, and the following operations are carried out: as shown in fig. 4.
(i) For a new sequence, every two routers are combined together, starting with the most numbered node router and starting with the least numbered node router. If the number of the nodes in the new sequence is odd, the node with the minimum number does not participate in grouping; if even, the least numbered node participates in the packet.
(ii) After grouping, the larger numbered router in each group performs C-NOT gate and H gate operations on its own particles and measures the results, which are then transmitted to another router in the same group over a classical channel.
(iii) For those routers that received the measurement in (ii), they are regrouped and the operations in (i) are repeated until the source node receives the measurement information from router number 2.
The invention is further described below in connection with protocol analysis.
1. Feasibility analysis
From the above, assuming that a path has been determined by the minimum spanning tree method, it can be represented as a → B → C → G → K → L → M, where a and M represent a source host node and a target host node, respectively. In accordance with the routing protocol of the present invention, odd node routers prepare and distribute entangled particles to neighboring nodes. Thus, the nodes participating in the entanglement exchange form a new sequence A, C, E, G, I, K, M, as shown in FIG. 5.
With reference to FIG. 5, taking router K as an example, J owned by it2J owned by particle and Router I1The particles being in a quantum state
L it possesses1L owned by the particle and the destination node M2The particles are in a quantum state, then the total state of these four particles is:
first, node K will be J2Particles and L1After the particles are transformed by the CNOT gate and the H gate, four particles can be represented as:
equation (2) shows that after the entanglement swap, node K uses { |00>，|01>，|10>，|11>Performing measurement as a measurement basis when the measurement result is |00>Then particle J1And L2Is in the state
Likewise, the other three cases can be measured with equal probability. For node G, it may perform the same operations as node K at the same time.
In the second step, when node I receives the measurement result from node K, it can grasp the entanglement state of node I sharing the entangled particle with node M. Thereafter, node I again performs entanglement swapping so that particle H1And particles L2Entangled, measured, and communicated to node E.
Through the above two steps, node E receives the measurement result of node I and can determine the state of the entangled particle that itself shares with node M. Node E then performs the entanglement switching again and sends the measurement results to node C.
When node C receives the result from node E, node C again performs entanglement switching. Suppose B1Particles and B2The particles are in an entangled state
D1Particles and L2The particles are in an entangled state
Node C performs entanglement switching. The results are as follows
Thus, particle B owned by node A1And a particle L owned by node M2Entanglement is formed. Node C then pairs particle D1And particles B2The measurement is made and the measurement result is sent to node a. When node a receives the measurement, it determines the entangled particles it shares with itNode M of the winding state. Thus, an entangled quantum channel is established between the source node and the destination node.
After the quantum channel is established, the source node can transmit quantum state information through quantum invisible state transmission. With the quantum-entangled particle pair shared therebetween in an entangled state
As an example, assume that the quantum state to be transferred is
Wherein α and β are both complex numbers, satisfy | | α | | non-volatile phosphor2+||β||21, then the total state of the three particles is
The above formula shows that when the source node A is coupled to the particle
And particles B1Measured, particles L2Will collapse to the corresponding quantum state and transmit the measurement to the destination node M. According to the measurement result, the node M is paired with the particle L2Performing the corresponding unitary operation, the particle L2Becomes | L2>＝α|0>+β|1>. So far, after the route is determined by the routing protocol, quantum carrying information through quantum entanglement exchange and invisible state transmission
The quantum information is transmitted from the source node to the destination node through the wireless quantum mesh network, so that the transmission of the quantum information is completed.
The invention is further described below in connection with an efficiency analysis.
The entanglement switching technology is used when a quantum channel is established, the Bell-based measurement result needs to be transmitted to a corresponding node through a wireless channel, and in the traditional method, entanglement switching is carried out from a source node hop by hop according to a routing path until entanglement switching is carried out with a destination node finally and quantum invisible transmission is completed.
The two-end approximation method proposed in reference [14] divides a router sequence into two subsequences, one before and one after, according to an intermediate node, and starts from a next-hop node directly connected to a source node and a previous-hop node directly connected to a destination node, and performs entanglement swapping on the intermediate node at the same time, and then transmits a measurement result to the next-hop node (or the previous-hop node), and after the next-hop node (or the previous-hop node) obtains the measurement result, performs entanglement swapping again and transmits the measurement result, and repeats the operation until the intermediate node obtains results transmitted from two directions, so that two operations can be performed in one entanglement swapping time, the number of nodes in a selected path is recorded as n, and the number of steps for establishing a quantum channel is recorded as c. Then there are:
for the protocol of the present invention, multiple pairs of particles in each group can be simultaneously entangled for exchange and measurement. Then there are:
the above equation can be shown using fig. 6.
As can be seen from fig. 6, the method of reference [14] is used to create a quantum channel whose number of steps increases linearly with the number of nodes in the path. In the protocol of the present invention, the number of steps to establish a quantum channel increases logarithmically as the number of nodes increases. In fig. 6, when the total number of nodes in the path is greater than 8, our protocol grows slowly, while the protocol in reference [14] grows faster. As the number of nodes in the path increases, the number of steps required to establish a quantum channel by the protocol of the present invention will be significantly less than the protocol in [14 ]. For example, if there are 50 nodes in the path, the protocol of the present invention requires 6 steps. The protocol of reference [14] requires 24 steps.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When used in whole or in part, can be implemented in a computer program product that includes one or more computer instructions. When loaded or executed on a computer, cause the flow or functions according to embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website site, computer, server, or data center to another website site, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL), or wireless (e.g., infrared, wireless, microwave, etc.)). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that includes one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (4)
1. A quantum wireless mesh network routing method based on entanglement swapping is characterized by comprising the following steps:
taking node hop number in the wireless quantum mesh network and comprehensive weight of round trip time parameters as a routing overhead value, and utilizing a minimum spanning tree method to enable each node to gradually enter the network to construct a classical channel in the network;
then, preparing and distributing entangled particles by partial nodes in the network, and carrying out quantum entanglement exchange and measurement by the other partial nodes to construct quantum channels;
finally, quantum information is transmitted between the source node and the destination node by a quantum invisible state transmission method;
in the quantum channel establishing method, after a source host receives a route determining message, a path is determined to be accessible, and the source host sends a message requesting for establishing an entangled quantum channel along the determined path; when a node router in the path learns that the node is already used as a node in the selected path, quantum state transmission is carried out;
the method for establishing the quantum channel specifically comprises the following steps:
firstly, N is used for representing the number of node routers in a selected path;
if N is an odd number, all node routers with odd numbers prepare entangled particles and distribute the entangled particles to node routers with even numbers, wherein a router node directly connected with a source host distributes the entangled particles to a next hop node router and the source host thereof, and a router node directly connected with a destination host distributes the entangled particles to a previous hop node router and the destination host thereof; all nodes with even numbers of entangled particles can be regarded as a new node sequence, and the nodes perform measurement and quantum entanglement swapping, including:
(i) for the new sequence, starting from the node router with the largest number to the node router with the smallest number, every two routers are combined together; the number of the nodes in the new sequence is odd, and the node with the minimum number does not participate in grouping; if the number is even, the node with the minimum number participates in grouping;
(ii) after grouping, the router with the larger number in each group executes C-NOT gate and H gate operation on the owned particles, measures the operation, and transmits the measurement result to another router in the same group through a classical channel;
(iii) (iii) regrouping the routers that received the measurement in (ii), and repeating the operation in step (i) until the source node receives the measurement information from the router;
if N is an even number, all node devices with even numbers prepare entangled particles and distribute the entangled particles to node routers with odd numbers, meanwhile, a next hop node router directly connected with a source host also needs to prepare entangled particles, one part of the entangled particles is reserved by the next hop node router, and the other part of the entangled particles is distributed to the source host; all nodes with entangled particles can be regarded as a new node sequence; the operation for the new node sequence is the same as if N is odd;
preparing entangled particles by the odd node router and distributing the entangled particles to adjacent nodes; nodes participating in entanglement exchange form a new sequence { A, C, E, G, I, K, M };
j owned by the node K when the number of N is odd2J owned by particle and Router I1The particles being in a quantum state
Having L1L owned by the particle and the destination node M2The particles are in a quantum state, then the total state of these four particles is:
the method specifically comprises the following steps:
first, node K will be J2Particles and L1After the particles are transformed by the CNOT gate and the H gate, four particles are represented as:
the above equation shows that after entanglement swapping, node K uses { |00>,|01>,|10>,|11>Performing measurement as a measurement basis when the measurement result is |00>Particle J1And L2Is in the state
Secondly, when the node I receives the measurement result from the node K, the node I and the node M share the entanglement state of the entangled particles; next, node I again performs entanglement swapping to make particle H1And particles L2Intertwined together, measured and transmitted to node E;
thirdly, the node E receives the measurement result of the node I and determines the state of the entangled particles shared by the node E and the node M; then node E performs entanglement swapping again and sends the measurement result to node C;
when node C receives the result from node E, node C performs entanglement swapping again; if B is1Particles and B2The particles are in an entangled state
D1Particles and L2The particles are in an entangled state
Node C performs an entanglement swap with the result:
particle B owned by node A1And a particle L owned by node M2Forming entanglement; node C then pairs particle D1And particles B2Measuring and sending a measurement result to the node A; when the node A receives the measurement result, determining a winding state node M of the shared entangled particles; an entangled quantum channel is established between the source node and the destination node.
2. The entanglement switching-based quantum wireless mesh network routing method according to claim 1,
the classical channel establishing method comprises the following steps:
taking the comprehensive weight of link capacity and round trip time parameters as an overhead value of a routing criterion, selecting a Mesh router directly connected with a source host as a root node, receiving a Hello packet sent by a network-accessed node by a new node, constructing and maintaining a neighbor table, calculating the overhead values of different father nodes through the neighbor table, and finally selecting the node with the minimum routing overhead value as the father node for gradually accessing the network; logically converting the whole wireless mesh network into a tree-shaped ring-free topological structure;
after a tree-shaped ring-free network topology is constructed, a source host node sends a route discovery message for searching a path from the source host node to a destination host node; the Ethernet data packet is encapsulated again and then sent out;
after receiving the message, the node in the path splits the message to obtain a packet header 1, a packet header 2 and a packet header 3; then comparing whether the receiving node is consistent with the destination node, if the inconsistency shows that the node is not the destination node, adding 1 to the current hop count and the number of hops in the packet header 3, setting the receiving node in the packet header 1 as a next-hop router, and finally encapsulating and forwarding; if the consistency indicates that the node is the destination node, stopping forwarding;
when the destination node receives the route discovery message, a response message is sent in a reverse direction to inform the source node that the path can be reached, and a quantum channel is established; finally, packaging and forwarding;
after receiving the response message, the nodes in the path are split, and then whether the receiving node is consistent with the destination node or not is compared, if not, the receiving node in the packet header 1 is set as a next hop router, and only the current hop number in the packet header 3 is reduced by 1, and then the packet is encapsulated and forwarded.
3. The entanglement switching-based quantum wireless mesh network routing method according to claim 1, wherein quantum information is transmitted between a source node and a destination node by a quantum invisible state transfer method, and specifically comprises:
after quantum channels are established, source nodes transmit quantum state information through quantum invisible state transmission; the transferred quantum state is
Wherein α and β are both complex numbers, satisfy | | α | | non-volatile phosphor2+||β||21, particle B1Particles L2And the total state of the particles to be transported is
When the source node A is paired with the particle
And particles B1Measured, particles L2Collapse to the corresponding quantum state and transmit the measurement result to the destination node M; according to the measurement result, the node M is paired with the particle L2Performing the corresponding unitary operation, the particle L2Becomes | L2>＝α|0>+β|1>(ii) a After the route is determined by the routing protocol, quantum carrying information is processed by quantum entanglement exchange and invisible state transmission
And transmitting the quantum information from the source node to the destination node through a wireless quantum mesh network to complete the transmission of the quantum information.
4. A computer-readable storage medium storing instructions which, when executed on a computer, cause the computer to perform the entanglement switching-based quantum wireless mesh network routing method according to any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910311453.9A CN109982410B (en) | 2019-04-18 | 2019-04-18 | Quantum wireless mesh network routing method and framework based on entanglement exchange |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910311453.9A CN109982410B (en) | 2019-04-18 | 2019-04-18 | Quantum wireless mesh network routing method and framework based on entanglement exchange |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109982410A CN109982410A (en) | 2019-07-05 |
| CN109982410B true CN109982410B (en) | 2020-04-07 |
Family
ID=67085214
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910311453.9A Active CN109982410B (en) | 2019-04-18 | 2019-04-18 | Quantum wireless mesh network routing method and framework based on entanglement exchange |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109982410B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112787729B (en) * | 2021-01-07 | 2022-03-25 | 清华大学 | Method and device for constructing quantum network and quantum network |
| CN113792882B (en) * | 2020-12-23 | 2022-05-06 | 北京百度网讯科技有限公司 | Quantum entanglement state processing method, device, equipment, storage medium and product |
| CN113190719B (en) * | 2021-05-08 | 2022-02-01 | 北京百度网讯科技有限公司 | Node grouping method and device and electronic equipment |
| CN115333642B (en) * | 2022-10-14 | 2023-03-21 | 成都信息工程大学 | Remote quantum computer network application method and system based on quantum satellite |
| CN115865333B (en) * | 2022-11-24 | 2023-09-26 | 北京百度网讯科技有限公司 | Quantum entanglement establishment method and device and electronic equipment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8958291B2 (en) * | 2009-10-09 | 2015-02-17 | At&T Intellectual Property I, L.P. | Data routing in hybrid wireless communication networks |
| CN106357345B (en) * | 2016-10-08 | 2019-03-19 | 东南大学 | A kind of method for routing of the quantum communication network based on Mesh structure |
-
2019
- 2019-04-18 CN CN201910311453.9A patent/CN109982410B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109982410A (en) | 2019-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109982410B (en) | Quantum wireless mesh network routing method and framework based on entanglement exchange | |
| Gyongyosi et al. | Decentralized base-graph routing for the quantum internet | |
| Yu et al. | Distributed wireless quantum communication networks with partially entangled pairs | |
| WO2021008508A1 (en) | D-dimensional chain-type teleportation method based on random sending of measurement result of relay node | |
| CN105681028B (en) | Multi-user network system with football structure and quantum key distribution method thereof | |
| Li et al. | Building a large-scale and wide-area quantum internet based on an OSI-alike model | |
| CN107612689A (en) | A kind of quantum state teleportation method transmitted based on bypass flow in quantum network | |
| Yu et al. | Distributed wireless quantum communication networks | |
| Xiong et al. | Routing protocol for wireless quantum multi-hop mesh backbone network based on partially entangled GHZ state | |
| Zhang et al. | Fragmentation-aware entanglement routing for quantum networks | |
| Yang et al. | Quantum wireless network communication based on cluster states | |
| CN115276976B (en) | Quantum key distribution method and device and electronic equipment | |
| Gao et al. | Multi-hop teleportation in a quantum network based on mesh topology | |
| Yang et al. | Efficient quantum multi-hop communication based on Greenberger–Horne–Zeilinger states and Bell states | |
| Zhang et al. | Multi-hop cyclic joint remote state preparation | |
| Kumar et al. | A novel minimum delay maximum flow multicast algorithm to construct a multicast tree in wireless mesh networks | |
| Chen et al. | Measurement-based quantum repeater network coding | |
| Woolsey et al. | Coded caching in wireless device-to-device networks using a hypercube approach | |
| CN114629562A (en) | Quantum communication invisible state transfer optimization method based on non-maximum entangled state | |
| Nguyen et al. | Maximizing entanglement routing rate in quantum networks: Approximation algorithms | |
| Yao et al. | Optimal deployment design of repeaters and memories in quantum networks | |
| Huang et al. | Symmetric Cyclic Controlled Quantum Teleportation of Three-Qubit State by a nineteen-Qubit Entangled State | |
| Yi et al. | A node-disjoin multipath routing in mobile ad hoc networks | |
| Huang et al. | Concurrent efficient entanglement routing for quantum wireless networks | |
| Zeng et al. | Entanglement Routing over Quantum Networks Using Greenberger-Horne-Zeilinger Measurements |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230602 Address after: 230000 Anhui Hefei high tech Zone Innovation Industrial Park two phase J2 District C block 18 floor. Patentee after: HEFEI LONGTUTEM INFORMATION TECHNOLOGY Co.,Ltd. Address before: 610225, No. 24, Section 1, Xuefu Road, Southwest Economic Development Zone, Chengdu, Sichuan Patentee before: CHENGDU University OF INFORMATION TECHNOLOGY Effective date of registration: 20230602 Address after: Room 002, 1801E, Building C2, Nanshan Zhiyuan, No. 1001 Xueyuan Avenue, Changyuan Community, Taoyuan Street, Nanshan District, Shenzhen City, Guangdong Province, 518000 Patentee after: Shenzhen dingzhida meter information technology Co.,Ltd. Address before: 230000 Anhui Hefei high tech Zone Innovation Industrial Park two phase J2 District C block 18 floor. Patentee before: HEFEI LONGTUTEM INFORMATION TECHNOLOGY Co.,Ltd. |