Quantum entanglement distribution method and device, electronic equipment and storage medium

Abstract

The application provides a quantum entanglement distribution method and device, electronic equipment and storage medium. The method comprises the following steps: determining a shortest path between a source node and a destination node of current service from a quantum network topology; acquiring each target quantum node constituting the shortest path; wherein each target quantum node comprises a plurality of storage units, the storage units comprise an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time; determining a target storage unit for each target quantum node, and distributing quantum bits based on each target storage unit to form a point-to-point entanglement connection, so that each storage unit corresponds to a single entangled photon pair by finely dividing the storage modules of each quantum node, the distribution of quantum bits to the target storage units in the idle state is more accurate, and the efficiency of quantum entanglement distribution is further improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of quantum entanglement, and in particular to a quantum entanglement distribution method and device, an electronic device, and a storage medium. BACKGROUND

[0002] The quantum entanglement distribution network is a technology that uses quantum entanglement as a basic resource to achieve long-distance quantum communication and quantum network. It can guarantee the security and efficiency of information and is an important direction of future information technology. The entanglement distribution network is the focus of current research and application exploration of quantum information networks, but the entanglement distribution network is still in its infancy and needs to be researched and explored in terms of enabling components, network architecture, protocol interface, routing strategy, etc. There is still a long way to go to achieve long-distance, large-scale, and multi-system interconnection of quantum information networks. Therefore, constructing a quantum entanglement distribution networking architecture and how to achieve efficient quantum entanglement distribution have become urgent challenges in the development of current quantum information networks. SUMMARY

[0003] Therefore, the purpose of the present application is to provide a quantum entanglement distribution method, device, electronic device, and storage medium.

[0004] To achieve the above purpose, the present application provides a quantum entanglement distribution method, which comprises:

[0005] determining a shortest path between a source node and a destination node of a current service from a quantum network topology; wherein the quantum network topology comprises a plurality of quantum nodes, and the plurality of quantum nodes at least comprises the source node and the destination node;

[0006] obtaining each target quantum node constituting the shortest path; wherein each target quantum node comprises a plurality of storage units, the storage units comprise an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time;

[0007] determining a target storage unit for each target quantum node, and distributing quantum bits based on each target storage unit to form a point-to-point entanglement connection; wherein the target storage unit is in an idle state.

[0008] Based on the same inventive concept, the present application also provides a quantum entanglement distribution device, which comprises:

[0009] a determining module configured to determine a shortest path between a source node and a destination node of a current service from a quantum network topology; wherein the quantum network topology comprises a plurality of quantum nodes, and the plurality of quantum nodes at least comprises the source node and the destination node;

[0010] The acquisition module acquires each target quantum node constituting the shortest path; each target quantum node includes a plurality of storage units, the storage units include an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time;

[0011] The distribution module determines a target storage unit for each target quantum node, and distributes quantum bits based on each target storage unit to form a point-to-point entanglement connection; the target storage unit is in an idle state.

[0012] Based on the same inventive concept, the embodiments of the present application also provide an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable by the processor, and the processor implements the quantum entanglement distribution method as described above when executing the program.

[0013] Based on the same inventive concept, the embodiments of the present application also provide a non-transitory computer readable storage medium, which stores computer instructions for causing a computer to execute the quantum entanglement distribution method as described above.

[0014] As can be seen from the above, the quantum entanglement distribution method, device, electronic device, and storage medium provided by the present application determine the shortest path between the source node and the sink node of the current service from the quantum network topology; the quantum network topology includes a plurality of quantum nodes, and the plurality of quantum nodes at least include the source node and the sink node; each target quantum node constituting the shortest path is acquired; each target quantum node includes a plurality of storage units, the storage units include an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time; a target storage unit is determined for each target quantum node, and quantum bits are distributed based on each target storage unit to form a point-to-point entanglement connection; the target storage unit is in an idle state, so that each storage unit corresponds to a single entangled photon pair by finely dividing the storage module of each quantum node, the target storage unit in an idle state can be more accurately distributed with quantum bit distribution, and the efficiency of quantum entanglement distribution is further improved. BRIEF DESCRIPTION OF DRAWINGS

[0015] In order to more clearly illustrate the technical solutions in the present application or related art, the drawings needed to be used in the embodiments or related art description will be briefly introduced. Obviously, the drawings in the following description are only embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0016] Figure 1 A flowchart of a quantum entanglement distribution method according to an embodiment of the present application;

[0017] Figure 2 A schematic diagram of a quantum network topology according to an embodiment of the present application;

[0018] Figure 3 A flowchart of another quantum entanglement distribution method according to an embodiment of the present application;

[0019] Figure 4 A flowchart of a quantum entanglement exchange according to an embodiment of the present application;

[0020] Figure 5 A schematic diagram of a quantum entanglement distribution apparatus according to an embodiment of the present application;

[0021] Figure 6 A schematic diagram of a specific electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0022] In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to specific embodiments and drawings.

[0023] It should be noted that, unless otherwise defined, technical or scientific terms used in the embodiments of the present application should be understood as their common meanings to those of ordinary skill in the art to which the present application belongs. The terms "first", "second" and similar terms used in the embodiments of the present application do not denote any order, quantity or importance, but are only used to distinguish different components. The terms "include" or "contain" and similar terms mean that the elements or objects before the terms encompass the elements or objects listed after the terms and their equivalents, and do not exclude other elements or objects. The terms "connect" or "connected" and similar terms do not mean physical or mechanical connection, but can include electrical connection, whether direct or indirect. The terms "upper", "lower", "left", "right" and the like only represent relative positional relationships, and when the absolute positions of the described objects change, the relative positional relationships can also change accordingly.

[0024] It can be understood that, before using the technical solutions of the various embodiments of the present application, the user will be informed of the type of personal information involved, the scope of use, the use scenario, etc. by appropriate means, and the user's authorization will be obtained.

[0025] For example, in response to receiving an active request of a user, a prompt information is sent to the user to explicitly prompt the user that the operation requested to be performed will require obtaining and using personal information of the user. Thus, the user can autonomously select whether to provide personal information to the software or hardware, such as an electronic device, an application program, a server or a storage medium, performing the operation of the technical solution of the application according to the prompt information.

[0026] As an optional but non-limiting implementation, in response to receiving an active request of a user, the prompt information can be sent to the user in the form of a pop-up window, and the prompt information can be presented in the form of text in the pop-up window. In addition, the pop-up window can also carry selection controls for the user to select "agree" or "disagree" to provide personal information to the electronic device.

[0027] It can be understood that the above notification and obtaining user authorization process is only illustrative and does not limit the implementation of the application, and other ways that meet the relevant laws and regulations can also be applied to the implementation of the application.

[0028] As described in the background, the entanglement distribution network is still in its infancy, and there is still a long way to go in enabling components, network architecture, protocol interface, routing strategy, and other aspects. Therefore, building a quantum entanglement distribution networking architecture and how to achieve efficient quantum entanglement distribution have become urgent challenges faced by the current quantum information network development.

[0029] To sum up, in order to solve the above problems, the application provides a quantum entanglement distribution method, which determines the shortest path between the source node and the destination node of the current service in the quantum network topology; wherein the quantum network topology includes a plurality of quantum nodes, and the plurality of quantum nodes at least includes the source node and the destination node; each target quantum node comprising the shortest path is obtained; wherein each target quantum node includes a plurality of storage units, the storage unit includes an idle state and an occupied state, and each storage unit can only correspond to a unique entangled photon pair at the same time; each target quantum node is determined, and quantum bit distribution is performed based on each target storage unit to form a point-to-point entanglement connection; wherein the target storage unit is in an idle state, so that the storage module of each quantum node is finely divided, i.e. each quantum node corresponds to a plurality of storage units, and each storage unit corresponds to a single entangled photon pair, which can more accurately distribute quantum bits to the target storage unit in an idle state, further improving the efficiency of quantum entanglement distribution.

[0030] In some specific application scenarios, the quantum entanglement distribution method of the present application can be applied to a quantum key distribution network system. As an example, the embodiment of the present application can be executed by a manager or a server of the quantum key distribution network domain. The server can be a stand-alone physical server, a server cluster or a distributed system composed of multiple physical servers, a cloud server providing basic cloud computing services such as cloud service, cloud database, cloud computing, cloud function, cloud storage, network service, cloud communication, middleware service, domain name service, security service, CDN (content distribution network), and big data and artificial intelligence platform, etc. The server and the terminal can communicate through a network to realize data transmission. The network can be a wired network or a wireless network, which is not limited in the present application.

[0031] The server can be a server providing various services. Optionally, the server can be hardware or software. When the server is hardware, it can be implemented as a distributed server cluster composed of multiple servers, or as a single server. When the server is software, it can be implemented as multiple software or software modules (for example, software or software modules for providing distributed services), or as a single software or software module. The embodiments of the present application do not make specific limitations.

[0032] Optionally, the wireless network or wired network uses standard communication technology and / or protocol. The network is usually the Internet, but can also be any network, including but not limited to local area network (LAN), metropolitan area network (MAN), wide area network (WAN), mobile, wired or wireless network, private network or any combination of virtual private network. In some embodiments, technologies and / or formats including hyper text mark-up language (HTML), extensible markup language (XML), etc. are used to represent the data exchanged through the network. In addition, all or some links can be encrypted using conventional encryption technologies such as secure socket layer (SSL), transport layer security (TLS), virtual private network (VPN), internet protocol security (IPsec), etc. In other embodiments, custom and / or dedicated data communication technologies can be used instead of or in addition to the above data communication technologies.

[0033] The quantum entanglement distribution method according to the example embodiments of the present application will be described below in connection with specific application scenarios. It should be noted that the above-mentioned application scenarios are only shown for the purpose of facilitating the understanding of the spirit and principles of the present application, and the example embodiments of the present application are not limited in this respect. On the contrary, the example embodiments of the present application can be applied to any applicable scenario.

[0034] It should be understood that, although Figure 1 , 3 , the steps in the flowchart of FIG. 4 are displayed in sequence according to the direction of the arrows, these steps are not necessarily executed in sequence according to the direction of the arrows. Unless explicitly stated herein, the execution of these steps is not strictly limited in sequence, and these steps can be executed in other sequences. Moreover, Figure 1 , 3 , at least part of the steps in FIG. 4 can include multiple sub-steps or multiple stages, which are not necessarily executed at the same time, but can be executed at different times, and the execution sequence of these sub-steps or stages is not necessarily sequential, but can be alternately executed with at least part of other steps or sub-steps or stages of other steps.

[0035] Referring to Figure 1 , a flowchart of a quantum entanglement distribution method according to an example embodiment of the present application, the method includes the following steps:

[0036] S101, determining the shortest path between the source node and the destination node of the current service from the quantum network topology; wherein the quantum network topology includes a plurality of quantum nodes, and the plurality of quantum nodes at least includes the source node and the destination node.

[0037] In a specific implementation, the quantum network topology includes a plurality of quantum nodes, and the connection relationship of each quantum node. The current service is a service of communication between two quantum nodes in the quantum network topology. The two nodes in communication are referred to as the source node and the destination node. Optionally, in some embodiments, the quantum network topology can only include the source node and the destination node, or can include other quantum nodes in addition to the source node and the destination node, and the number of quantum nodes included in the quantum network topology is not limited. The shortest path between the source node and the destination node, i.e., the shortest path from the source node to the destination node in the quantum network topology, can be determined by the number of hops required from the source node to the destination node, wherein each quantum node on the path represents 1 hop. Referring to Figure 2 , for a certain quantum network topology graph, if the source node of the current service is 1 and the destination node is 21, then Figure 2 , the shortest path from the source node to the destination node is 1-11-21, and the number of hops of the shortest path is 3.

[0038] In some embodiments, determining the shortest path between the source node and the destination node from the quantum network topology specifically comprises:

[0039] determining candidate quantum nodes including storage units in the idle state from the plurality of quantum nodes;

[0040] redetermining the quantum network topology based on the candidate quantum nodes;

[0041] determining the shortest path from the redetermined quantum network topology.

[0042] In practice, considering that in the embodiments of the present application, when establishing a point-to-point entanglement connection between quantum nodes, it is necessary to ensure that the quantum nodes establishing the entanglement connection have storage units in the idle state, and when a certain quantum node does not have storage units in the idle state, it is impossible to establish a point-to-point entanglement. Therefore, if the shortest path between the source node and the destination node of the current service is directly determined from the quantum network topology, it is possible that a certain quantum node in the shortest path does not have storage units in the idle state, thereby failing to establish an entanglement connection, at which time it is necessary to redetermine the shortest path. In order to avoid this situation, when determining the shortest path, candidate quantum nodes including storage units in the idle state can be first determined from the plurality of quantum nodes, and then the quantum network topology is redetermined according to these candidate quantum nodes, that is, nodes not belonging to the candidate quantum nodes are removed from the network topology, and then the shortest path is determined from the remaining part of the quantum network topology. In this way, it can be ensured that the shortest path determined can establish an entanglement connection between each quantum node. Referring to Figure 2 , if it is necessary to find the shortest path between node 1 and 21, the shortest path of 1-11-21 under normal circumstances, but if quantum node 11 does not include storage units in the idle state, 1-11-21 cannot be used as the shortest path, and other shortest paths excluding quantum node 11 need to be found.

[0043] In some embodiments, determining the shortest path between the source node and the destination node from the quantum network topology specifically comprises:

[0044] traversing each link in the quantum network topology, and in response to the existence of storage units in the idle state at both ends of the link, retaining the link;

[0045] determining the shortest path between the source node and the destination node from all retained links.

[0046] In implementation, in order to exclude the part of the quantum network topology in which the point-to-point entanglement cannot be established more quickly, each link in the quantum network topology is traversed first. When it is determined that there are storage units in idle state at both ends of a link, the link is reserved, otherwise the link is removed. In this way, the remaining links can all be used as the shortest path.

[0047] In some embodiments, in order to make the number of hops of the shortest path of each service match as small as possible, when there are multiple paths that meet the condition when the shortest path is determined, i.e., the number of hops of multiple paths are the same, those paths that include more storage units in idle state are preferred. For example, there are two paths, path A and path B, both of which belong to the shortest path, wherein path A includes 4 intermediate quantum nodes with storage units in idle state, and path B includes 1 intermediate quantum node with storage units in idle state. At this time, path A is selected as the shortest path of the current service, so that path B and path A can both be selected as the object when the next service needs to select path B or path A. If the current service selects path B, the intermediate quantum nodes in path B no longer have storage units in idle state, and therefore cannot be used as the shortest path by other services.

[0048] S102, obtaining each target quantum node constituting the shortest path; wherein each target quantum node includes a plurality of storage units, the storage units include idle state and occupied state, and each storage unit can correspond to only one entangled photon pair at the same time.

[0049] In implementation, after the shortest path is determined, each quantum node constituting the shortest path is referred to as a target quantum node. Optionally, the multiple target quantum nodes include at least the source node and the sink node of the current service.

[0050] It should be noted that, unlike the prior art, the storage module of the quantum node is further divided in the present application. In the related art, when performing point-to-point entanglement connection, quantum bits are generally directly distributed to two quantum nodes to be connected, that is, entangled photon pairs are distributed to the two quantum nodes. However, the inventor found in the implementation that the number of entangled photons that each quantum node can receive at the same time has an upper limit. In the related art, whether the quantum node can continue to receive entangled photon pairs is also represented by the concept of quantum node resources, but this rough statistical method cannot achieve fine control of the distribution of entangled photon pairs. On this basis, the inventors of the present application propose a more accurate division of the storage module of each quantum node, that is, each quantum node includes a plurality of storage units, and each storage unit can only correspond to a unique entangled photon pair at the same time, that is, a storage unit has been distributed with an entangled photon, and cannot receive other entangled photons until the entangled photon is released, so that each storage unit corresponds to only one service, which is more conducive to the accurate allocation of services. At the same time, in order to better represent the state of each storage unit, each storage unit includes an idle state and an occupied state, the idle state indicating that the current storage unit has not received an entangled photon and can receive a new entangled photon. The occupied state indicates that the current storage unit has received an entangled photon and cannot receive a new entangled photon.

[0051] Through the further division of the storage module described above, when a new service is received, it can be determined whether the quantum node is available by judging whether the quantum node includes a quantum node in an idle state, and the maximum number of services that each quantum node can simultaneously carry can be obtained by the number of storage units included in each quantum node. In addition, when multiple services are received at the same time, the storage units can also be pre-controlled to avoid conflicts between different services.

[0052] S103, determining a target storage unit for each target quantum node, and distributing quantum bits based on each target storage unit to form a point-to-point entanglement connection; wherein the target storage unit is in an idle state.

[0053] In specific implementation, after determining each target quantum node, a target storage unit for receiving entangled photons of each target quantum node needs to be further determined. Optionally, in some embodiments, any storage unit in an idle state can be randomly determined as a target storage unit. After the target storage unit is determined, quantum bits can be distributed according to each target storage unit, that is, entangled photon pairs are distributed to the target storage units of the two target quantum nodes to be connected to form a point-to-point entanglement connection.

[0054] In some embodiments, when the point-to-point entanglement connection is formed, the resource state of each quantum node in the quantum network topology is updated, and the resource state includes the state of each storage unit in the quantum node.

[0055] Table 1

[0056]

[0057] Referring to Table 1, for the storage unit state on each quantum node in the path P 1-11-21 1-11-21, the set of target storage units for which the quantum bits are finally distributed can be:

[0058] In some embodiments, the target storage unit is determined for each target quantum node, and specifically includes:

[0059] For each target quantum node, the arrangement numbers of all idle storage units corresponding to the target quantum node are obtained, and the smallest arrangement number is determined from the arrangement numbers of all idle storage units, and the storage unit corresponding to the smallest arrangement number is determined as the target storage unit.

[0060] In specific implementation, in order to accurately determine the target storage unit, the arrangement numbers of all idle storage units corresponding to each target quantum node are obtained, the smallest arrangement number is determined from the arrangement numbers of all idle storage units, and finally the storage unit corresponding to the smallest arrangement number is determined as the target storage unit.

[0061] In some embodiments, the target storage unit is determined for each target quantum node, and specifically includes:

[0062] For each target quantum node, all idle storage units corresponding to the target quantum node are obtained, the pending storage unit which is not determined as the target storage unit by other services except the current service is determined from all idle storage units, and the target storage unit corresponding to the current service is determined from the pending storage unit.

[0063] In actual implementation, in order to avoid conflicts in quantum bit distribution among different services when multiple service requests are received at the same time, when determining the target storage unit, a standby storage unit that is not determined as a target storage unit by services other than the current service is determined from all idle storage units, and then the target storage unit corresponding to the current service is determined from the standby storage unit. Optionally, the target storage unit corresponding to the current service can be directly determined from the standby storage unit in a random manner, or the target storage unit corresponding to the current service can be determined according to the arrangement serial number of the standby storage unit, which is not limited.

[0064] In some embodiments, after quantum bit distribution is performed based on the target storage units, the method further includes:

[0065] determining intermediate quantum nodes in the shortest path from the target quantum nodes;

[0066] performing entanglement swapping in the intermediate quantum nodes;

[0067] in response to determining that each of the intermediate quantum nodes successfully performs the entanglement swapping, establishing end-to-end entanglement between the source node and the sink node according to the entanglement connection and the entanglement swapping.

[0068] In actual implementation, after point-to-point entanglement connection, in order to achieve entanglement connection between the source node and the sink node, entanglement swapping needs to be established for the two target storage units in the intermediate quantum node, so that service communication can be transmitted between the two target storage units in the same quantum node. Finally, end-to-end entanglement between the source node and the sink node can be established according to the previously established entanglement connection between the target quantum nodes and the entanglement swapping in the intermediate quantum node.

[0069] In some embodiments, after the entanglement swapping is performed in the intermediate quantum node, the method further includes:

[0070] in response to determining that any one of the intermediate quantum nodes fails to perform the entanglement swapping, re-performing quantum bit distribution for the intermediate quantum node that fails to perform the entanglement swapping.

[0071] In the implementation, when the entanglement exchange is performed at the intermediate quantum nodes, it is necessary to determine whether each of the intermediate quantum nodes successfully performs the entanglement exchange. If all the intermediate quantum nodes successfully perform the entanglement exchange, it indicates that the entanglement exchange is successfully established, and at this time, the end-to-end entanglement between the source node and the destination node can be directly established. If it is determined that any one of the intermediate quantum nodes fails to perform the entanglement exchange, the quantum bit distribution needs to be performed again for the intermediate quantum node that fails in the entanglement exchange. It should be noted that the intermediate quantum node refers to a target quantum node other than the source node and the destination node in the shortest path.

[0072] Reference Figure 3 FIG. 2 is a flowchart of another quantum entanglement distribution method according to an embodiment of the present application. The method is applied to the quantum storage unit model constructed in the implementation of the present application, that is, the quantum network topology includes a plurality of quantum nodes, each quantum node includes a plurality of storage units, the storage units include an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time. The method includes the following steps:

[0073] Step 2.1: The service request arrives, the service request arrives dynamically, and the service attributes are parsed, such as the source node, the destination node, the service start time, the service duration, and the required quantum bit storage time.

[0074] Step 2.2: The quantum storage units of each quantum node in the quantum network topology are traversed to obtain the resources and states of the current quantum storage units in each quantum storage unit, such as the quantum bit resource quantity of the quantum storage unit, the quantum bit storage time of the quantum storage unit, and the like. The quantum storage units in each quantum storage unit with an idle state are recorded, and the links with the storage units of the quantum nodes at both ends being in an idle state are abstractly connected.

[0075] Step 2.3: The shortest path under the physical topology (quantum network topology) of the service is calculated, the number of hops of the shortest path is recorded, and the virtual topology is constructed according to the links, intermediate nodes, and entangled photon pairs under the physical topology.

[0076] Step 2.4: The shortest path under the virtual topology of the service is calculated, and the number of hops of the shortest path is recorded.

[0077] Step 2.5: It is determined whether the entangled photon pair cutoff storage time is greater than the quantum operation time. Along the selected path, it is determined whether the quantum bit resources in each quantum storage unit on the link can provide the quantum bit quantity satisfying the service requirement within the service duration, and according to the determination result, the method is divided into two cases.

[0078] If the entangled photon pair cutoff storage time is greater than the quantum operation time, the following steps are skipped, and step 2.7 is performed.

[0079] If the entangled photon pair cutoff storage time is less than the quantum operation time, step 2.6 is executed;

[0080] Step 2.6: Service request blocking, quantum service request is blocked due to failure of point-to-point entangled photon pair construction.

[0081] Step 2.7: Quantum bit distribution is performed on each quantum storage unit on the selected path to form a point-to-point entangled connection.

[0082] Reference Figure 4 , a flowchart of a quantum entanglement exchange of an embodiment of the present application, the entanglement exchange is performed after quantum entanglement distribution, Figure 4 , the routing selection is the step of quantum entanglement distribution. The entanglement exchange includes:

[0083] Step 3.1: According to the quantum bit resource requirement of the quantum service request and the calculated quantum storage unit set, point-to-point entanglement resources are allocated for the service.

[0084] Step 3.2: Each intermediate quantum node on the selected path is traversed, and the point-to-point entanglement resources allocated by each intermediate quantum node are recorded.

[0085] Step 3.3: Entanglement exchange is performed in each intermediate quantum node on the selected path.

[0086] Step 3.4: Whether the entanglement exchange performed by each intermediate quantum node is successful is judged, and two cases are divided according to the judgment result.

[0087] If the entanglement exchange performed by each intermediate quantum node on the selected path is successful, the following steps are skipped, and step 3.6 is executed;

[0088] If the entanglement exchange performed by one or more intermediate quantum nodes on the selected path fails, step 3.5 is executed.

[0089] Step 3.5: Quantum bit resources are re-allocated for the quantum node whose entanglement exchange fails according to the set list where it is located.

[0090] Step 3.6: According to the established point-to-point entanglement and long-distance entanglement (entanglement exchange), end-to-end entanglement establishment between the original node pairs is completed.

[0091] Step 3.7: Network resource state is updated.

[0092] The quantum entanglement distribution method provided in the application determines a shortest path between a source node and a destination node of a current service from a quantum network topology; wherein the quantum network topology comprises a plurality of quantum nodes, and the plurality of quantum nodes at least comprises the source node and the destination node; each target quantum node comprising the shortest path is acquired; wherein each target quantum node comprises a plurality of storage units, the storage units comprise an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time; a target storage unit is determined for each target quantum node, and quantum bit distribution is performed based on each target storage unit to form a point-to-point entanglement connection; wherein the target storage unit is in an idle state, so that the storage modules of each quantum node are finely divided, i.e., each quantum node corresponds to a plurality of storage units, and each storage unit corresponds to a single entangled photon pair, the target storage unit in an idle state can be more accurately distributed with quantum bits, the efficiency of quantum entanglement distribution is further improved, and the purpose of greatly improving the resource utilization rate of quantum entanglement distribution is ultimately achieved.

[0093] It should be noted that the method of the embodiments of the application can be executed by a single device, such as a computer or a server. The method of the embodiments can also be applied to a distributed scenario, and completed by multiple devices cooperating with each other. In the case of such a distributed scenario, one of the multiple devices can only execute one or more steps in the method of the embodiments of the application, and the multiple devices can interact with each other to complete the method.

[0094] It should be noted that some embodiments of the application have been described above. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims can be performed in a different order than the order described above and still achieve the desired result. In addition, the processes depicted in the figures do not necessarily require the particular order shown, or sequential order, to achieve the desired results. In certain implementations, multitasking and parallel processing can be advantageous.

[0095] Based on the same inventive concept, the application also provides a quantum entanglement distribution device corresponding to any of the above-mentioned embodiment methods.

[0096] Reference Figure 5 The quantum entanglement distribution device comprises:

[0097] The determining module 201 determines a shortest path between a source node and a destination node of a current service from a quantum network topology; wherein the quantum network topology comprises a plurality of quantum nodes, and the plurality of quantum nodes at least comprises the source node and the destination node;

[0098] The acquisition module 202 acquires each target quantum node constituting the shortest path; wherein each target quantum node comprises a plurality of storage units, the storage units comprise an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time;

[0099] The distribution module 203 determines a target storage unit for each target quantum node, and distributes quantum bits based on each target storage unit to form a point-to-point entanglement connection; wherein the target storage unit is in an idle state.

[0100] In some embodiments, the determination module is specifically configured to:

[0101] Determine an alternative quantum node comprising a storage unit in an idle state from the plurality of quantum nodes;

[0102] Redetermine the quantum network topology based on the alternative quantum node;

[0103] Determine the shortest path from the redetermined quantum network topology.

[0104] In some embodiments, the determination module is specifically configured to:

[0105] Iterate through each link in the quantum network topology, and in response to the existence of a storage unit in an idle state at both ends of the link, reserve the link;

[0106] Determine the shortest path between the source node and the sink node from all reserved links.

[0107] In some embodiments, the distribution module is specifically configured to:

[0108] For each target quantum node, obtain the arrangement serial numbers of all storage units in an idle state corresponding to the target quantum node, and determine the smallest arrangement serial number from all arrangement serial numbers of the storage units in an idle state, and determine the storage unit corresponding to the smallest arrangement serial number as the target storage unit.

[0109] In some embodiments, the distribution module is specifically configured to:

[0110] For each target quantum node, obtain all storage units in an idle state corresponding to the target quantum node, determine a pending storage unit from all storage units in an idle state which is not determined as a target storage unit by other services except the current service, and determine the target storage unit corresponding to the current service from the pending storage unit.

[0111] In some embodiments, the apparatus further comprises an exchange module configured to:

[0112] determining intermediate quantum nodes in the shortest path from the respective target quantum nodes;

[0113] performing entanglement swapping in the intermediate quantum nodes;

[0114] in response to determining that each of the intermediate quantum nodes successfully performs the entanglement swapping, establishing an end-to-end entanglement between the source node and the destination node according to the entanglement connection and the entanglement swapping.

[0115] In some embodiments, the exchange module is further configured to:

[0116] in response to determining that any one of the intermediate quantum nodes fails to perform the entanglement swapping, re-distributing quantum bits to the intermediate quantum node that fails to perform the entanglement swapping.

[0117] For the convenience of description, the above apparatus is described in various modules in terms of functions. Of course, in the implementation of the present application, the functions of the modules can be implemented in one or more software and / or hardware.

[0118] The apparatus of the above embodiments is used to implement the corresponding quantum entanglement distribution method in any of the above embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described here again.

[0119] Based on the same inventive concept, corresponding to any of the above method embodiments, the present application also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the quantum entanglement distribution method of any of the above embodiments.

[0120] Figure 6 A more specific hardware structure of an electronic device is shown in the embodiment, which can include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040 are connected to each other through the bus 1050 for communication within the device.

[0121] The processor 1010 can be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an ASIC (Application Specific Integrated Circuit), or one or more integrated circuits, etc., for executing related programs to implement the technical solutions provided by the embodiments of the present application.

[0122] The memory 1020 can be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, etc. The memory 1020 can store an operating system and other application programs, and when the technical solutions provided by the embodiments of the present specification are implemented by software or firmware, the related program codes are stored in the memory 1020 and are called and executed by the processor 1010.

[0123] The input / output interface 1030 is configured to connect an input / output module to realize information input and output. The input / output module can be configured as a component in the device (not shown in the figure) or can be externally connected to the device to provide corresponding functions. The input device can include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output device can include a display, a speaker, a vibrator, an indicator light, etc.

[0124] The communication interface 1040 is configured to connect a communication module (not shown in the figure) to realize communication interaction between the device and other devices. The communication module can realize communication through a wired manner (such as a USB, a network cable, etc.) or through a wireless manner (such as a mobile network, WIFI, Bluetooth, etc.).

[0125] The bus 1050 includes a channel for transmitting information between various components (such as the processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040) of the device.

[0126] It should be noted that although the above device only shows the processor 1010, the memory 1020, the input / output interface 1030, the communication interface 1040, and the bus 1050, in the specific implementation process, the device can also include other components necessary for normal operation. In addition, those skilled in the art can understand that the above device can also only contain components necessary for implementing the embodiments of the present specification, and does not necessarily contain all the components shown in the figure.

[0127] The electronic device of the above embodiment is used to implement the corresponding quantum entanglement distribution method in any of the preceding embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described here.

[0128] Based on the same inventive concept, corresponding to the method of any of the above embodiments, the present application also provides a non-transitory computer readable storage medium storing computer instructions for causing the computer to execute the quantum entanglement distribution method of any of the above embodiments.

[0129] The computer readable media of the embodiments can include permanent and non-permanent, removable and non-removable media, which can be implemented by any method or technology to store information. The information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage device, or any other non-transmission medium that can be used to store information accessible to a computing device.

[0130] The storage medium of the above embodiments stores computer instructions for causing the computer to execute the quantum entanglement distribution method as described in any of the above embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described here.

[0131] Those skilled in the art should understand that the discussion of any of the above embodiments is only exemplary and is not intended to imply that the scope of the present application (including claims) is limited to these examples; the above embodiments or technical features between different embodiments can also be combined, the steps can be implemented in any order, and there are many other changes of the different aspects of the embodiments of the present application as described above. In order to be brief, they are not provided in detail.

[0132] In addition, in order to simplify the description and discussion, and so as not to make the embodiments of the present application difficult to understand, the well-known power / ground connections of integrated circuit (IC) chips and other components can or can not be shown in the provided drawings. In addition, the devices can be shown in the form of block diagrams in order to avoid making the embodiments of the present application difficult to understand, and this also takes into account the fact that the details of the implementation of these block diagram devices are highly dependent on the platform to be implemented the embodiments of the present application (i.e. these details should be fully within the understanding of those skilled in the art). Where specific details (e.g. circuits) are set forth in order to describe the exemplary embodiments of the present application, it will be apparent to those skilled in the art that the embodiments of the present application can be implemented without these specific details or with variations of these specific details. Therefore, these descriptions should be considered illustrative rather than limiting.

[0133] While the present application has been described in connection with certain embodiments thereof, many modifications, substitutions, changes, and of forms will be apparent to those of ordinary skill in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) can use the embodiments discussed.

[0134] Embodiments of the present application are intended to cover all such alterations, modifications, and variations as they can come within the scope of the appended claims. Accordingly, although specific embodiments have been furthered in connection with the present application, any omission, substitution, change, improvement, etc. made by one of ordinary skill in the art to the disclosed embodiments should be considered to be within the scope of the present application.

Claims

1. A method of quantum entanglement distribution, characterized by, The method comprises: determining a source node and a destination node of a current service from a quantum network topology; wherein the quantum network topology comprises a plurality of quantum nodes, and the plurality of quantum nodes at least comprises the source node and the destination node; determining an alternative quantum node comprising a storage unit in an idle state from the plurality of quantum nodes; re-determining the quantum network topology based on the alternative quantum node; and determining a shortest path from the re-determined quantum network topology; obtaining each target quantum node constituting the shortest path; wherein each target quantum node comprises a plurality of storage units, the storage units comprise an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time; determining a target storage unit for each target quantum node, and performing quantum bit distribution based on each target storage unit to form a point-to-point entanglement connection; wherein the target storage unit is in an idle state.

2. The method of claim 1, wherein, The method for determining a target storage unit for each target quantum node comprises: for each target quantum node, obtaining arrangement serial numbers of all storage units in an idle state corresponding to the target quantum node, and determining a smallest arrangement serial number from the arrangement serial numbers of all storage units in an idle state; and determining a storage unit corresponding to the smallest arrangement serial number as the target storage unit.

3. The method of claim 1, wherein, The method for determining a target storage unit for each target quantum node comprises: for each target quantum node, obtaining all storage units in an idle state corresponding to the target quantum node, determining a pending storage unit which is not determined as a target storage unit by other services except the current service from all storage units in an idle state, and determining a target storage unit corresponding to the current service from the pending storage unit.

4. The method of claim 1, wherein, After performing quantum bit distribution based on each target storage unit, the method further comprises: determining an intermediate quantum node in the shortest path from each target quantum node; performing entanglement exchange in the intermediate quantum node; in response to determining that each intermediate quantum node successfully performs the entanglement exchange, establishing an end-to-end entanglement of the source node and the destination node according to the entanglement connection and the entanglement exchange.

5. The method of claim 4, wherein, After performing entanglement exchange in the intermediate quantum node, the method further comprises: in response to determining that any one of the intermediate quantum nodes fails to perform the entanglement exchange, re-performing quantum bit distribution for the intermediate quantum node failing to perform the entanglement exchange.

6. A quantum entanglement distribution apparatus characterized by comprising: The device comprises: a determination module configured to determine a source node and a destination node of a current service from a quantum network topology; wherein the quantum network topology comprises a plurality of quantum nodes, and the plurality of quantum nodes at least comprises the source node and the destination node; determine an alternative quantum node comprising a storage unit in an idle state from the plurality of quantum nodes; re-determine the quantum network topology based on the alternative quantum node; and determine a shortest path from the re-determined quantum network topology; An acquisition module acquires each target quantum node constituting the shortest path; wherein each target quantum node comprises a plurality of storage units, the storage units comprise an idle state and an occupied state, and each storage unit can correspond to only one entangled photon pair at the same time; A distribution module determines a target storage unit for each target quantum node, and performs quantum bit distribution based on each target storage unit to form a point-to-point entanglement connection; wherein the target storage unit is in an idle state.

7. An electronic device, comprising: A computer program product comprising a memory, a processor, and a computer program stored on the memory and executable by the processor, wherein the processor implements the method of any one of claims 1 to 5 when executing the program.

8. A non-transitory computer-readable storage medium, comprising: The non-transitory computer readable storage medium stores computer instructions for causing a computer to perform the method of any one of claims 1 to 5.

Images