Quantum network deployment method and device, electronic equipment and computer storage medium

Abstract

The embodiment of the invention provides a quantum network deployment method and device, electronic equipment and a computer readable storage medium, and relates to the technical field of quantum communication. According to the method, the minimum number of target quantum communication nodes required for covering a target area and the position of each target quantum communication node are determined based on the coverage range of the quantum communication nodes, and then the target quantum link topology between the target quantum communication nodes is determined based on the cost of the quantum link by taking the minimum total cost as the target. According to the embodiment of the invention, the number of quantum communication nodes and quantum links is reduced under the condition that the target area is fully covered, the full-cycle cost of hardware equipment purchase, optical fiber laying, power supply, operation and maintenance management and the like is directly reduced, and the method is particularly suitable for deployment of a large-scale quantum key distribution network.

Description

Technical Field

[0001] The present invention relates to the field of quantum communication technology, and in particular to a quantum network deployment method, a quantum network deployment device, an electronic device, and a computer-readable storage medium. Background Art

[0002] With the rapid development of quantum communication technology, quantum networking has become a key infrastructure for achieving wide-area quantum secure communication, quantum computing services, and quantum sensor networks. Current research focuses on routing optimization, dynamic control, and resource management of established quantum networks.

[0003] Although quantum communication has been designated a key development area, current research has yet to develop a systematic solution for initial network deployment. Quantum network construction still relies on manual experience, which can lead to redundant construction or coverage gaps due to inappropriate site selection. This not only increases deployment costs but is also susceptible to subjective judgment, making it difficult to guarantee objective and optimal site selection. Summary of the Invention

[0004] In view of the above problems, embodiments of the present invention are proposed to provide a quantum network deployment method, a quantum network deployment device, an electronic device, and a computer-readable storage medium that overcome the above problems or at least partially solve the above problems.

[0005] In order to solve the above problems, an embodiment of the present invention discloses a method for deploying a quantum network, the method comprising: In response to an optimization instruction for the quantum link topology, determining a minimum number of target quantum communication nodes required to cover a target area based on the coverage of the quantum communication nodes, and a position of each target quantum communication node; The target quantum link topology between each target quantum communication node is determined based on the cost of the quantum link.

[0006] In one or more embodiments, determining the minimum number of target quantum communication nodes required to cover the target area based on the coverage range of the quantum communication nodes, and the position of each target quantum communication node, includes: Discretizing the target area to obtain a plurality of discrete grid points; wherein each discrete grid point has a corresponding first candidate quantum communication node; Determining at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes; wherein the coverage of each second candidate quantum communication node includes the target area; Iteratively optimize each second candidate quantum communication node to obtain the target quantum communication node.

[0007] In one or more embodiments, determining at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes includes: S1. Set the coverage state of each discrete grid point to uncovered and generate an initial empty set; S2. Sort the first candidate quantum communication nodes in order of the size of the covered and uncovered ranges to obtain a node sequence; S3. Determine, from the node sequence, a first candidate quantum communication node with the largest coverage and not selected as a second candidate quantum communication node; S4. Setting the coverage state of the discrete grid points covered by the second candidate quantum communication node to covered; S5. Adding the second candidate quantum communication node to the initial empty set; S6. Check whether the coverage status of all discrete grid points in the target area are covered. If so, obtain a target empty set including each second candidate quantum communication node; if not, execute S2.

[0008] In one or more embodiments, iteratively optimizing each second candidate quantum communication node to obtain a target quantum communication node includes: S1. Determine at least one quantum communication node to be added from other first candidate quantum communication nodes; wherein the other first candidate quantum communication nodes are quantum communication nodes other than the second candidate quantum communication node among all first candidate quantum communication nodes, and have not been removed from the target empty set within a preset time period; S2. Adding the at least one quantum communication node to be added to the target empty set; S3: Whether at least one quantum communication node to be removed can be removed from the target empty set. If so, execute S4; if not, obtain the final target empty set. S4. removing the quantum communication node to be removed from the target empty set; S5: Whether the iterative optimization termination condition is met, if so, obtain the final target empty set; if not, execute S1.

[0009] In one or more embodiments, determining a target quantum link topology between target quantum communication nodes based on the cost of the quantum link includes: For any two quantum communication nodes among the target quantum communication nodes, calculating the quantum link construction cost between the arbitrary two quantum communication nodes using the cost of the quantum link, and obtaining multiple quantum link segments and the quantum link construction cost corresponding to each quantum link segment; Sort each quantum link segment by the size of the quantum link construction cost to obtain a quantum link segment sequence; The quantum link segment sequence is traversed to obtain the target quantum link topology between each target quantum communication node.

[0010] In one or more embodiments, traversing the quantum link segment sequence to obtain a target quantum link topology between target quantum communication nodes includes: S1. Initialize each of the target quantum communication nodes to obtain a node set corresponding to each of the target quantum communication nodes; S2. Determine, from the quantum link segment sequence, a target quantum link segment with the lowest quantum link construction cost and which has not been processed; S3: Whether the two target quantum communication nodes of the target quantum link segment with the minimum quantum link construction cost belong to different node sets. If so, execute S4; if not, execute S2; S4. Merge the node sets corresponding to the two target quantum communication nodes; S5. Adding the target quantum link segment with the minimum quantum link construction cost to the minimum spanning tree; S6. Does the minimum spanning tree include N-1 edges? If so, obtain the target quantum link topology; if not, execute S2; wherein N is the number of the target quantum communication nodes.

[0011] Accordingly, an embodiment of the present invention discloses a quantum network deployment device, comprising: A first determination module is configured to determine, in response to an optimization instruction for a quantum link topology, a minimum number of target quantum communication nodes required to cover a target area based on the coverage of the quantum communication nodes, and a position of each target quantum communication node; The second determining module is used to determine the target quantum link topology between each target quantum communication node based on the cost of the quantum link.

[0012] In one or more embodiments, the first determining module includes: a discretization submodule, configured to discretize the target area to obtain a plurality of discrete grid points; wherein each discrete grid point has a corresponding first candidate quantum communication node; a selection submodule, configured to determine at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes; wherein the coverage of each second candidate quantum communication node includes the target area; The optimization submodule is used to iteratively optimize each second candidate quantum communication node to obtain the target quantum communication node.

[0013] In one or more embodiments, the selection submodule is specifically configured to: S1. Set the coverage state of each discrete grid point to uncovered and generate an initial empty set; S2. Sort the first candidate quantum communication nodes in order of the size of the covered and uncovered ranges to obtain a node sequence; S3. Determine, from the node sequence, a first candidate quantum communication node with the largest coverage and not selected as a second candidate quantum communication node; S4. Setting the coverage state of the discrete grid points covered by the second candidate quantum communication node to covered; S5. Adding the second candidate quantum communication node to the initial empty set; S6. Check whether the coverage status of all discrete grid points in the target area are covered. If so, obtain a target empty set including each second candidate quantum communication node; if not, execute S2.

[0014] In one or more embodiments, the optimization submodule is specifically configured to: S1. Determine at least one quantum communication node to be added from other first candidate quantum communication nodes; wherein the other first candidate quantum communication nodes are quantum communication nodes other than the second candidate quantum communication node among all first candidate quantum communication nodes, and have not been removed from the target empty set within a preset time period; S2. Adding the at least one quantum communication node to be added to the target empty set; S3: Whether at least one quantum communication node to be removed can be removed from the target empty set. If so, execute S4; if not, obtain the final target empty set. S4. removing the quantum communication node to be removed from the target empty set; S5: Whether the iterative optimization termination condition is met, if so, obtain the final target empty set; if not, execute S1.

[0015] In one or more embodiments, the second determining module includes: a calculation submodule, configured to calculate, for any two quantum communication nodes among the target quantum communication nodes, a quantum link construction cost between the arbitrary two quantum communication nodes using the cost of the quantum link, to obtain a plurality of quantum link segments, and a quantum link construction cost corresponding to each quantum link segment; The sorting submodule is used to sort the quantum link segments according to the quantum link construction cost to obtain a quantum link segment sequence; The generation submodule is used to traverse the quantum link segment sequence to obtain the target quantum link topology between each target quantum communication node.

[0016] In one or more embodiments, the generating submodule is specifically configured to: S1. Initialize each of the target quantum communication nodes to obtain a node set corresponding to each of the target quantum communication nodes; S2. Determine, from the quantum link segment sequence, a target quantum link segment with the lowest quantum link construction cost and which has not been processed; S3: Whether the two target quantum communication nodes of the target quantum link segment with the minimum quantum link construction cost belong to different node sets; if so, execute S4; if not, execute S2; S4. Merge the node sets corresponding to the two target quantum communication nodes; S5. Adding the target quantum link segment with the minimum quantum link construction cost to the minimum spanning tree; S6. Does the minimum spanning tree include N-1 edges? If so, obtain the target quantum link topology; if not, execute S2; wherein N is the number of the target quantum communication nodes.

[0017] Accordingly, an embodiment of the present invention discloses an electronic device, comprising: a processor, a memory, and a computer program stored in the memory and capable of running on the processor. When the computer program is executed by the processor, the various steps of the above-mentioned quantum network deployment method embodiment are implemented.

[0018] Accordingly, an embodiment of the present invention discloses a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the various steps of the above-mentioned quantum network deployment method embodiment are implemented.

[0019] The embodiments of the present invention include the following advantages: In response to an optimization instruction for the quantum link topology, the minimum number of target quantum communication nodes required to cover the target area, as well as the location of each target quantum communication node, are determined based on the coverage of the quantum communication nodes. Then, with the goal of minimizing total cost, the target quantum link topology between the target quantum communication nodes is determined based on the cost of the quantum links. This approach utilizes a two-layer optimization approach when generating the quantum link topology: one layer optimizes the quantum communication nodes, and the other layer optimizes the quantum links. This not only reduces the number of quantum communication nodes and quantum links while ensuring full coverage of the target area, but also directly reduces the full-cycle costs of hardware procurement, fiber optic deployment, power supply, and operations and maintenance. This approach is particularly suitable for the deployment of large-scale quantum key distribution networks.

[0020] Furthermore, the use of automated algorithms to replace manual experience solves the problem that traditional site selection methods rely on expert experience and are easily affected by subjective judgment, improves the reliability of deployment, and ensures the objectivity and optimality of site selection. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 This is a flowchart of a quantum network deployment method embodiment of the present invention; Figure 2 It is a structural block diagram of an embodiment of a quantum network deployment device of the present invention. DETAILED DESCRIPTION

[0022] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the present invention is further described in detail below with reference to the accompanying drawings and specific embodiments.

[0023] One of the core concepts of the embodiments of the present invention is to perform two-layer optimization when generating the quantum link topology. One layer optimizes the quantum communication nodes, and the other layer optimizes the quantum links. This not only reduces the number of quantum communication nodes and quantum links while ensuring full coverage of the target area, but also directly reduces the full-cycle costs such as hardware equipment procurement, fiber optic laying, power supply, and operation and maintenance management. It is particularly suitable for the deployment of large-scale quantum key distribution networks.

[0024] Furthermore, the use of automated algorithms to replace manual experience solves the problem that traditional site selection methods rely on expert experience and are easily affected by subjective judgment, improves the reliability of deployment, and ensures the objectivity and optimality of site selection.

[0025] Reference Figure 1 , showing a step flow chart of an embodiment of a quantum network deployment method of the present invention, which can be applied to a quantum key distribution network, wherein the quantum key distribution network is a communication network that uses quantum mechanics principles (such as quantum entanglement, or the quantum no-cloning theorem) to achieve secure key distribution.

[0026] Furthermore, the embodiments of the present invention may be executed on a terminal device, which may have the following features: (1) In terms of hardware system, the device has a central processing unit, memory, input components and output components. In other words, the device is often a microcomputer device with communication functions. In addition, it can also have multiple input methods, such as keyboard, mouse, touch screen, microphone and camera, and the input can be adjusted as needed. At the same time, the device often has multiple output methods, such as receiver, display screen, etc., which can also be adjusted as needed; (2) In terms of software system, the device must have an operating system, such as Windows Mobile, Symbian, Palm, Android, iOS, etc. At the same time, these operating systems are becoming more and more open, and personalized applications developed based on these open operating system platforms are endless, such as address books, calendars, notepads, calculators, and various games, which greatly meet the needs of personalized users; (3) In terms of communication capabilities, the device has flexible access methods and high-bandwidth communication performance, and can automatically adjust the selected communication method according to the selected business and the environment, so as to facilitate user use. The device can support 3GPP (3rd Generation Partnership Project), 4GPP (4th Generation Partnership Project), 5GPP (5th Generation Partnership Project), LTE (Long Term Evolution), WIMAX (World Interoperability for Microwave Access) mobile communications, computer network communications based on TCP / IP (Transmission Control Protocol / Internet Protocol), UDP (User Datagram Protocol) protocols, and short-range wireless transmission methods based on Bluetooth and infrared transmission standards. It supports not only voice services, but also a variety of wireless data services; (4) In terms of functional use, devices are becoming more user-friendly, personalized, and multifunctional. With the development of computer technology, devices have evolved from a "device-centric" model to a "people-centric" model, integrating embedded computing, control technology, artificial intelligence technology, and biometric authentication technology, fully embodying the people-oriented principle. Thanks to the development of software technology, devices can be adjusted according to individual needs, making them more personalized. At the same time, the devices themselves integrate a wide range of software and hardware, making their functions increasingly powerful.

[0027] The method may specifically include the following steps: Step 101: In response to an optimization instruction for a quantum link topology, the minimum number of target quantum communication nodes required to cover a target area and the position of each target quantum communication node are determined based on the coverage of the quantum communication nodes.

[0028] The user can initiate an optimization instruction for the quantum link topology on the terminal device. In response to the instruction, the terminal device can determine the minimum number of quantum communication nodes required to cover the target area (for ease of description, recorded as the "minimum number of target quantum communication nodes"), as well as the location of each target quantum communication node.

[0029] Among them, the quantum link topology can be the network topology corresponding to the quantum key distribution network; the quantum communication node can be a network node in the quantum key distribution network, such as a site, or of course, other network nodes. In practical applications, the specific form of the quantum communication node can be set according to actual needs, and the embodiments of the present invention do not limit this.

[0030] Furthermore, since each quantum communication node has a corresponding coverage range, and typically different quantum communication nodes have different coverage ranges (for example, quantum communication node A has a coverage range of 20 kilometers, while quantum communication node B has a coverage range of 15 kilometers), the minimum number of target quantum communication nodes required to cover the target area, as well as the location of each target quantum communication node, can be determined based on the coverage range of each quantum communication node.

[0031] In an embodiment of the present invention, determining the minimum number of target quantum communication nodes required to cover the target area based on the coverage range of the quantum communication nodes, and the position of each target quantum communication node, includes: Discretizing the target area to obtain a plurality of discrete grid points; wherein each discrete grid point has a corresponding first candidate quantum communication node; Determining at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes; wherein the coverage of each second candidate quantum communication node includes the target area; Iteratively optimize each second candidate quantum communication node to obtain the target quantum communication node.

[0032] Specifically, the user can input relevant parameters of the target area into the terminal device in advance. The terminal device responds to the optimization instruction, discretizes the target area, obtains multiple discrete grids, and determines the center point of the discrete grid as the discrete grid point, thereby obtaining multiple discrete grid points.

[0033] For example, the target area can be discretized into discrete grids of 1 km × 1 km, and the center of each discrete grid is determined as a discrete grid point. Then, the distance between each discrete grid point is 1 km.

[0034] It should be noted that the size of the discrete grid can be 1 kilometer or other sizes. In practical applications, the specific size of the discrete grid can be set according to actual needs, and the embodiment of the present invention does not limit this.

[0035] Furthermore, to facilitate quantum communication node optimization, each discrete grid point can be mapped to a quantum communication node (denoted as a "first candidate quantum communication node"). Based on the coverage of each first candidate quantum communication node, at least one second candidate quantum communication node can be determined from all first candidate quantum communication nodes. The coverage of all second candidate quantum communication nodes can include the target area; in other words, all second candidate quantum communication nodes can cover the entire target area.

[0036] Since the current second candidate quantum communication node may not be the optimal solution, for example, a discrete grid point is overlapped by multiple second candidate quantum communication nodes, the current second candidate quantum communication node can be iteratively optimized to determine the optimal solution, thereby determining the minimum number of target quantum communication nodes required to cover the target area, as well as the position of each target quantum communication node.

[0037] It should be noted that when determining the optimal solution, a greedy algorithm, a heuristic method (such as a genetic algorithm, an ant colony algorithm, etc.), or other methods can be used. In practical applications, the specific method for determining the optimal solution can be set according to actual needs, and the embodiments of the present invention do not limit this.

[0038] Furthermore, to avoid falling into an infinite loop when determining the optimal solution, a taboo strategy can be pre-set. In this way, when determining the optimal solution, iteration can be performed according to the taboo strategy, thereby avoiding falling into an infinite loop. In actual applications, the specific strategies included in the taboo strategy can also be set according to actual needs, and the embodiments of the present invention are not limited to this.

[0039] In this embodiment of the present invention, determining at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes includes: S1. Set the coverage state of each discrete grid point to uncovered and generate an initial empty set; S2. Sort the first candidate quantum communication nodes in order of the size of the covered and uncovered ranges to obtain a node sequence; S3. Determine, from the node sequence, a first candidate quantum communication node with the largest coverage and not selected as a second candidate quantum communication node; S4. Setting the coverage state of the discrete grid points covered by the second candidate quantum communication node to covered; S5. Adding the second candidate quantum communication node to the initial empty set; S6. Check whether the coverage status of all discrete grid points in the target area are covered. If so, obtain a target empty set including each second candidate quantum communication node; if not, execute S2.

[0040] Specifically, after obtaining each discrete grid point, the coverage state of each discrete grid point can be set to uncovered. At the same time, an empty set (referred to as the "initial empty set") is generated for subsequent recording of the second candidate quantum communication node.

[0041] Then, all first candidate quantum communication nodes are sorted in order of the size of their coverage and uncovered areas to obtain a node sequence. From the node sequence, the first candidate quantum communication node with the largest coverage area that has not been selected is selected as the second candidate quantum communication node. For example, for uncovered discrete grid points in the target area, if the coverage area of ​​first candidate quantum communication node A is 20 kilometers in radius, the coverage area of ​​first candidate quantum communication node B is 18 kilometers in radius, and the coverage area of ​​first candidate quantum communication node C is 15 kilometers in radius, then first candidate quantum communication node A is selected as the second candidate quantum communication node.

[0042] The coverage state of the discrete grid points covered by the second candidate quantum communication node is changed to covered, and the second candidate quantum communication node is added to the initial empty set. For example, continuing with the above example, after the first candidate quantum communication node A is determined as the second candidate quantum communication node, the first candidate quantum communication node A can be added to the initial empty set, and at the same time, the coverage state of the discrete grid points covered by the first candidate quantum communication node A is changed to covered.

[0043] At this time, it is detected whether the coverage status of all discrete grid points in the target area are covered. If so, an empty set set including each second candidate quantum communication node is obtained (referred to as the "target empty set set").

[0044] If not, then continue to sort the first candidate quantum communication nodes in the order of the size of the covered and uncovered ranges to obtain a node sequence and proceed to the next round of the process.

[0045] In an embodiment of the present invention, the iterative optimization of each second candidate quantum communication node to obtain a target quantum communication node includes: S1. Determine at least one quantum communication node to be added from other first candidate quantum communication nodes; wherein the other first candidate quantum communication nodes are quantum communication nodes other than the second candidate quantum communication node among all first candidate quantum communication nodes, and have not been removed from the target empty set within a preset time period; S2. Adding the at least one quantum communication node to be added to the target empty set; S3: Whether at least one quantum communication node to be removed can be removed from the target empty set. If so, execute S4; if not, obtain the final target empty set. S4. removing the quantum communication node to be removed from the target empty set; S5: Whether the iterative optimization termination condition is met, if so, obtain the final target empty set; if not, execute S1.

[0046] Specifically, after selecting a part of all first candidate quantum communication nodes as second candidate quantum communication nodes, at least one quantum communication node (denoted as "quantum communication node to be added") can be selected from the unselected first candidate quantum communication nodes (denoted as "other first candidate quantum communication nodes") and added to the target empty set.

[0047] If removing at least one quantum communication node (denoted as "quantum communication node to be removed") from the target empty set makes the number of quantum communication nodes in the target empty set smaller and still able to cover the target area, then at least one quantum communication node to be removed can be removed from the target empty set.

[0048] For example, the target empty set includes the second candidate quantum communication node A, the second candidate quantum communication node B, and the second candidate quantum communication node C. At this time, the first candidate quantum communication node D and the first candidate quantum communication node E are selected from the other first candidate quantum communication nodes, and D and E are added to the target empty set. At this time, the detection finds that if A, B, and C are removed from the target empty set, the target area can still be covered. In this case, A, B, and C can be removed from the target empty set, and the final target empty set includes the second candidate quantum communication node D and the second candidate quantum communication node E.

[0049] Of course, in addition to the method of adding first and then removing, you can also use the method of removing first and then adding, or you can use the method of replacing. In practical applications, the update method of the quantum communication nodes in the target empty set can be adjusted according to actual needs, and the embodiment of the present invention does not limit this.

[0050] Then, it is detected whether the termination condition of the iterative optimization is met. If so, the iterative optimization can be stopped, thereby obtaining the final target empty set; if not, the step of determining at least one quantum communication node to be added from other first candidate quantum communication nodes can be continued.

[0051] It should be noted that when determining the quantum communication nodes to be added, the selected quantum communication nodes must meet the taboo policy, for example, they must not have been removed from the target empty set within a preset time period. Otherwise, after the target empty set adds the quantum communication node back, it will be removed from the target empty set again, resulting in an infinite loop.

[0052] Furthermore, when determining the quantum communication node to be added, a random selection can be made from other first candidate quantum communication nodes, or a selection can be made according to a preset rule. In practical applications, the specific selection method can be set according to actual needs, and the embodiment of the present invention does not limit this.

[0053] Furthermore, the termination condition of iterative optimization can be that the optimal solution has been reached, or that the upper limit of the number of iterations has been reached, or other conditions. In practical applications, the specific termination condition can also be set according to actual needs, and the embodiments of the present invention do not limit this.

[0054] Step 102: Determine a target quantum link topology between target quantum communication nodes based on the cost of the quantum link.

[0055] After determining the minimum number and location of target quantum communication nodes in the target area, the quantum link topology between each target quantum communication node (denoted as "target quantum link topology") can be determined.

[0056] Since the target area in this embodiment of the present invention is an undeveloped area, the target quantum communication node does not currently exist, so a new quantum communication node needs to be built. Similarly, if the target quantum communication node is newly added, the quantum link passing through the target quantum communication node also needs to be re-laid.

[0057] After the construction of a new quantum communication node is complete, the associated hardware equipment will need to be added. Therefore, when determining the target quantum link topology, it is necessary to consider the cost of the quantum link, including the costs associated with the quantum communication node and the quantum link. Thus, by minimizing the total cost and the cost of the quantum link, the target quantum link topology for the target area can be determined.

[0058] In an embodiment of the present invention, determining a target quantum link topology between target quantum communication nodes based on the cost of the quantum link includes: For any two quantum communication nodes among the target quantum communication nodes, calculating the quantum link construction cost between the arbitrary two quantum communication nodes using the cost of the quantum link, and obtaining multiple quantum link segments and the quantum link construction cost corresponding to each quantum link segment; Sort each quantum link segment by the size of the quantum link construction cost to obtain a quantum link segment sequence; The quantum link segment sequence is traversed to obtain the target quantum link topology between each target quantum communication node.

[0059] Specifically, for any two quantum communication nodes in the target quantum communication nodes, the cost of building a quantum link between the two can be calculated using the cost of the quantum link, including the cost of building quantum communication nodes, the cost of laying quantum links, and the cost of adding related hardware equipment.

[0060] When all target quantum communication nodes are calculated, multiple quantum link segments can be obtained, as well as the quantum link construction cost corresponding to each quantum link segment.

[0061] For example, by connecting the target quantum communication nodes A, B, and C in pairs, we can obtain quantum link segments AB, AC, and BC. At the same time, the cost of the quantum link can be used to calculate the quantum link construction cost of AB, the quantum link construction cost of AC, and the quantum link construction cost of BC respectively.

[0062] Then, the quantum link segments are sorted by their construction costs to obtain a quantum link segment sequence. This quantum link segment sequence is traversed to determine the target quantum link topology between the target quantum communication nodes with the goal of minimizing the total cost.

[0063] Furthermore, the cost of building a quantum communication node is recorded as The cost of laying quantum links and adding related hardware equipment is recorded as a function of distance: , the target quantum link topology can be determined using the following formula:

[0064] in, N is the number of target quantum communication nodes, Target quantum communication node i and j The constraints include: each discrete grid point in the target area is covered by at least one quantum communication node; any two target quantum communication nodes can communicate through the path.

[0065] In an embodiment of the present invention, traversing the quantum link segment sequence to obtain a target quantum link topology between target quantum communication nodes includes: S1. Initialize each of the target quantum communication nodes to obtain a node set corresponding to each of the target quantum communication nodes; S2. Determine, from the quantum link segment sequence, a target quantum link segment with the lowest quantum link construction cost and which has not been processed; S3: Whether the two target quantum communication nodes of the target quantum link segment with the minimum quantum link construction cost belong to different node sets; if so, execute S4; if not, execute S2; S4. Merge the node sets corresponding to the two target quantum communication nodes; S5. Adding the target quantum link segment with the minimum quantum link construction cost to the minimum spanning tree; S6. Does the minimum spanning tree include N-1 edges? If so, obtain the target quantum link topology; if not, execute S2; wherein N is the number of the target quantum communication nodes.

[0066] Specifically, for any target quantum communication node, it is initialized as an independent node set, so that each target quantum communication node has a one-to-one corresponding node set.

[0067] A quantum link segment with the lowest quantum link construction cost and that has not been processed (denoted as the "target quantum link segment") is selected from the quantum link segment sequence. It is then detected whether the node sets corresponding to the two endpoints of the target quantum link segment (i.e., the target quantum communication nodes) belong to different sets.

[0068] If they belong to different sets, the node sets corresponding to the two target quantum communication nodes can be merged, and then the target quantum link segment with the lowest quantum link construction cost can be added to the minimum spanning tree.

[0069] If they belong to the same set, then the step of determining the target quantum link segment with the lowest quantum link construction cost and not being processed from the quantum link segment sequence is continued. In this way, loops and redundant connections in the quantum link can be avoided, ensuring a balance between coverage and connectivity.

[0070] Next, the system checks whether the minimum spanning tree includes N-1 edges, where N is the number of target quantum communication nodes. If so, the quantum link topology corresponding to the minimum spanning tree is used as the target quantum link topology. If not, the system continues with the step of determining the target quantum link segment with the lowest quantum link construction cost and an unprocessed target quantum link segment from the quantum link segment sequence. This prevents loops and redundant connections in the quantum link, ensuring a balance between coverage and connectivity.

[0071] It should be noted that, when generating the target quantum link topology, in addition to the above-mentioned minimum spanning tree algorithm, the Prim algorithm, Kruskal algorithm, Boruvka algorithm, Reverse-Delete algorithm, etc. can also be used. In practical applications, the specific algorithm used to generate the target quantum link topology can be set according to actual needs, and the embodiment of the present invention does not limit this.

[0072] In an embodiment of the present invention, in response to an optimization instruction for a quantum link topology, the minimum number of target quantum communication nodes required to cover a target area, as well as the location of each target quantum communication node, is determined based on the coverage of the quantum communication nodes. Then, with the goal of minimizing total cost, the target quantum link topology between the target quantum communication nodes is determined based on the cost of the quantum links. This approach enables a two-layer optimization process when generating the quantum link topology: one layer optimizes the quantum communication nodes, and the other layer optimizes the quantum links. This not only reduces the number of quantum communication nodes and quantum links while ensuring full coverage of the target area, but also directly reduces the full-cycle costs of hardware procurement, fiber optic deployment, power supply, and operations and maintenance. This approach is particularly suitable for the deployment of large-scale quantum key distribution networks.

[0073] Furthermore, the use of automated algorithms to replace manual experience solves the problem that traditional site selection methods rely on expert experience and are easily affected by subjective judgment, improves the reliability of deployment, and ensures the objectivity and optimality of site selection.

[0074] It should be noted that for the sake of simplicity, the method embodiments are described as a series of actions. However, those skilled in the art should be aware that the embodiments of the present invention are not limited by the order of the actions described, because according to the embodiments of the present invention, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in this specification are all preferred embodiments, and the actions involved are not necessarily required by the embodiments of the present invention.

[0075] Reference Figure 2 , shows a structural block diagram of an embodiment of a quantum network deployment device of the present invention, which may specifically include the following modules: A first determination module 201 is configured to determine, in response to an optimization instruction for a quantum link topology, a minimum number of target quantum communication nodes required to cover a target area based on the coverage of the quantum communication nodes, and a position of each target quantum communication node; The second determining module 202 is configured to determine a target quantum link topology between target quantum communication nodes based on the cost of the quantum link.

[0076] In this embodiment of the present invention, the first determining module includes: a discretization submodule, configured to discretize the target area to obtain a plurality of discrete grid points; wherein each discrete grid point has a corresponding first candidate quantum communication node; a selection submodule, configured to determine at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes; wherein the coverage of each second candidate quantum communication node includes the target area; The optimization submodule is used to iteratively optimize each second candidate quantum communication node to obtain the target quantum communication node.

[0077] In this embodiment of the present invention, the selection submodule is specifically configured to: S1. Set the coverage state of each discrete grid point to uncovered and generate an initial empty set; S2. Sort the first candidate quantum communication nodes in order of the size of the covered and uncovered ranges to obtain a node sequence; S3. Determine, from the node sequence, a first candidate quantum communication node with the largest coverage and not selected as a second candidate quantum communication node; S4. Setting the coverage state of the discrete grid points covered by the second candidate quantum communication node to covered; S5. Adding the second candidate quantum communication node to the initial empty set; S6. Check whether the coverage status of all discrete grid points in the target area are covered. If so, obtain a target empty set including each second candidate quantum communication node; if not, execute S2.

[0078] In the embodiment of the present invention, the optimization submodule is specifically used to: S1. Determine at least one quantum communication node to be added from other first candidate quantum communication nodes; wherein the other first candidate quantum communication nodes are quantum communication nodes other than the second candidate quantum communication node among all first candidate quantum communication nodes, and have not been removed from the target empty set within a preset time period; S2. Adding the at least one quantum communication node to be added to the target empty set; S3: Whether at least one quantum communication node to be removed can be removed from the target empty set. If so, execute S4; if not, obtain the final target empty set. S4. removing the quantum communication node to be removed from the target empty set; S5: Whether the iterative optimization termination condition is met, if so, obtain the final target empty set; if not, execute S1.

[0079] In this embodiment of the present invention, the second determining module includes: a calculation submodule, configured to calculate, for any two quantum communication nodes among the target quantum communication nodes, a quantum link construction cost between the arbitrary two quantum communication nodes using the cost of the quantum link, to obtain a plurality of quantum link segments, and a quantum link construction cost corresponding to each quantum link segment; The sorting submodule is used to sort the quantum link segments according to the quantum link construction cost to obtain a quantum link segment sequence; The generation submodule is used to traverse the quantum link segment sequence to obtain the target quantum link topology between each target quantum communication node.

[0080] In an embodiment of the present invention, the generating submodule is specifically configured to: S1. Initialize each of the target quantum communication nodes to obtain a node set corresponding to each of the target quantum communication nodes; S2. Determine, from the quantum link segment sequence, a target quantum link segment with the lowest quantum link construction cost and which has not been processed; S3: Whether the two target quantum communication nodes of the target quantum link segment with the minimum quantum link construction cost belong to different node sets. If so, execute S4; if not, execute S2; S4. Merge the node sets corresponding to the two target quantum communication nodes; S5. Adding the target quantum link segment with the minimum quantum link construction cost to the minimum spanning tree; S6. Does the minimum spanning tree include N-1 edges? If so, obtain the target quantum link topology; if not, execute S2; wherein N is the number of the target quantum communication nodes.

[0081] As for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0082] An embodiment of the present invention further provides an electronic device, including: The system includes a processor, a memory, and a computer program stored in the memory and capable of running on the processor. When the computer program is executed by the processor, the various processes of the above-mentioned quantum network deployment method embodiment are implemented, and the same technical effects can be achieved. To avoid repetition, they are not described here.

[0083] An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the various processes of the above-mentioned quantum network deployment method embodiment are implemented, and the same technical effects can be achieved. To avoid repetition, they will not be described here.

[0084] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

[0085] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, apparatuses, or computer program products. Thus, embodiments of the present invention may take the form of entirely hardware embodiments, entirely software embodiments, or embodiments combining software and hardware aspects. Furthermore, embodiments of the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROMs, optical storage, etc.) containing computer-usable program code.

[0086] The embodiments of the present invention are described with reference to flowcharts and / or block diagrams of methods, terminal devices (systems), and computer program products according to the embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing terminal device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing terminal device generate instructions for implementing the processes in the flowcharts and / or block diagrams. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0087] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing terminal device to operate in a specific manner, so that the instructions stored in the computer readable memory produce a manufactured product including an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0088] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal device so that a series of operating steps are executed on the computer or other programmable terminal device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable terminal device to implement the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0089] Although the preferred embodiments of the present invention have been described, those skilled in the art may make additional changes and modifications to these embodiments once they are aware of the basic creative concepts. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the embodiments of the present invention.

[0090] Finally, it should be noted that, in this document, relational terms such as first and second, etc., are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "comprises," "comprising," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or terminal device that includes a series of elements includes not only those elements, but also other elements not explicitly listed, or elements inherent to such process, method, article, or terminal device. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of additional identical elements in the process, method, article, or terminal device that includes the element.

[0091] The above is a detailed introduction to a quantum network deployment method and a quantum network deployment device provided by the present invention. Specific examples are used herein to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core ideas. At the same time, for those skilled in the art, according to the ideas of the present invention, there may be changes in the specific implementation methods and application scopes. In summary, the content of this specification should not be understood as limiting the present invention.

Claims

1. A method for deploying a quantum network, characterized in that: The method comprises: In response to an optimization instruction for the quantum link topology, determining a minimum number of target quantum communication nodes required to cover a target area based on the coverage of the quantum communication nodes, and a position of each target quantum communication node; The target quantum link topology between each target quantum communication node is determined based on the cost of the quantum link.

2. The method for deploying a quantum network according to claim 1, characterized in that: The determining of the minimum number of target quantum communication nodes required to cover the target area based on the coverage range of the quantum communication nodes, and the position of each target quantum communication node, includes: Discretizing the target area to obtain a plurality of discrete grid points; wherein each discrete grid point has a corresponding first candidate quantum communication node; Determining at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes; wherein the coverage of each second candidate quantum communication node includes the target area; Iteratively optimize each second candidate quantum communication node to obtain the target quantum communication node.

3. The method for deploying a quantum network according to claim 2, characterized in that: The determining at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes includes: S1. Set the coverage state of each discrete grid point to uncovered and generate an initial empty set; S2. Sort the first candidate quantum communication nodes in order of the size of the covered and uncovered ranges to obtain a node sequence; S3. Determine, from the node sequence, a first candidate quantum communication node with the largest coverage and not selected as a second candidate quantum communication node; S4. Setting the coverage state of the discrete grid points covered by the second candidate quantum communication node to covered; S5. Adding the second candidate quantum communication node to the initial empty set; S6. Check whether the coverage status of all discrete grid points in the target area are covered. If so, obtain a target empty set including each second candidate quantum communication node; if not, execute S2.

4. The method for deploying a quantum network according to claim 2, wherein: The iterative optimization of each second candidate quantum communication node to obtain a target quantum communication node includes: S1. Determine at least one quantum communication node to be added from other first candidate quantum communication nodes; wherein the other first candidate quantum communication nodes are quantum communication nodes other than the second candidate quantum communication node among all first candidate quantum communication nodes, and have not been removed from the target empty set within a preset time period; S2. Adding the at least one quantum communication node to be added to the target empty set; S3: Whether at least one quantum communication node to be removed can be removed from the target empty set, if so, executing S4; if not, obtaining the final target empty set; S4. removing the quantum communication node to be removed from the target empty set; S5: Check whether the iterative optimization termination condition is met. If so, obtain the final target empty set; if not, execute S1.

5. The method for deploying a quantum network according to claim 1, wherein: The step of determining a target quantum link topology between target quantum communication nodes based on the cost of the quantum link includes: For any two quantum communication nodes among the target quantum communication nodes, calculating the quantum link construction cost between the arbitrary two quantum communication nodes using the cost of the quantum link, and obtaining multiple quantum link segments and the quantum link construction cost corresponding to each quantum link segment; Sort each quantum link segment by the size of the quantum link construction cost to obtain a quantum link segment sequence; The quantum link segment sequence is traversed to obtain the target quantum link topology between each target quantum communication node.

6. The method for deploying a quantum network according to claim 5, characterized in that: The traversing of the quantum link segment sequence to obtain the target quantum link topology between each target quantum communication node includes: S1. Initialize each of the target quantum communication nodes to obtain a node set corresponding to each of the target quantum communication nodes; S2. Determine, from the quantum link segment sequence, a target quantum link segment with the lowest quantum link construction cost and which has not been processed; S3: Whether the two target quantum communication nodes of the target quantum link segment with the minimum quantum link construction cost belong to different node sets; if so, execute S4; if not, execute S2; S4. Merge the node sets corresponding to the two target quantum communication nodes; S5. Adding the target quantum link segment with the minimum quantum link construction cost to the minimum spanning tree; S6. Does the minimum spanning tree include N-1 edges? If so, obtain the target quantum link topology; if not, execute S2; wherein N is the number of the target quantum communication nodes.

7. A quantum network deployment device, characterized in that: The device comprises: A first determination module is configured to determine, in response to an optimization instruction for a quantum link topology, a minimum number of target quantum communication nodes required to cover a target area based on the coverage of the quantum communication nodes, and a position of each target quantum communication node; The second determining module is used to determine the target quantum link topology between each target quantum communication node based on the cost of the quantum link.

8. The quantum network deployment device according to claim 7, characterized in that: The first determining module includes: a discretization submodule, configured to discretize the target area to obtain a plurality of discrete grid points; wherein each discrete grid point has a corresponding first candidate quantum communication node; a selection submodule, configured to determine at least one second candidate quantum communication node from each of the first candidate quantum communication nodes based on the coverage of each of the first candidate quantum communication nodes; wherein the coverage of each second candidate quantum communication node includes the target area; The optimization submodule is used to iteratively optimize each second candidate quantum communication node to obtain the target quantum communication node.

9. An electronic device, characterized in that: include: A processor, a memory, and a computer program stored in the memory and capable of running on the processor, wherein when the computer program is executed by the processor, the steps of the method for deploying a quantum network according to any one of claims 1 to 6 are implemented.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by the processor, the steps of the quantum network deployment method according to any one of claims 1 to 6 are implemented.

Images