Quantum network networking method and quantum network system

Abstract

This invention discloses a quantum network networking method and a quantum network system. The method includes: obtaining the maximum entanglement generation capacity of a link and calculating the unit entanglement cost based on the actual operating cost factor using a preset cost model; constructing an undirected graph corresponding to the physical quantum network and labeling the maximum entanglement generation capacity and unit entanglement cost; receiving entanglement resource requirements from client pairs; constructing a minimum cost flow problem based on the undirected graph, with the goal of minimizing the total cost and the condition of satisfying the entanglement resource requirements; calling an optimization algorithm to solve the minimum cost flow problem and obtaining an entanglement generation allocation scheme for each link; and controlling the quantum devices of the corresponding links to perform entanglement generation and exchange operations according to the allocation scheme. This invention, by introducing a cost model, transforms minimum cost optimization from a theoretical concept into a calculable and executable operational strategy, directly reducing the actual operating expenses of the quantum network.

Description

Technical Field

[0001] This invention relates to the field of quantum communication technology, and in particular to a quantum network networking method and a quantum network system. Background Technology

[0002] Quantum networks, by distributing quantum entanglement among distant nodes, can support several core applications such as quantum key distribution, distributed quantum computing, and quantum precision measurement. Their core capability lies in achieving efficient and reliable end-to-end distribution of entangled resources. One proposed solution combines the minimum-cost flow algorithm from classical graph theory with recursive network cascading to establish a basic theoretical framework for entanglement distribution in arbitrary topological quantum networks.

[0003] However, the relevant technical solutions have the following technical defects:

[0004] 1. Vague cost definition, making it difficult to align with actual operational optimization: The edge cost in related technical solutions is an abstract concept, only mentioning that it may be related to the number of times the channel is used. It lacks a quantifiable cost calculation model that is directly linked to real operational metrics (such as equipment energy consumption, time latency, and link lease fees). This keeps "minimum cost" optimization at the theoretical level, unable to directly guide economic decisions in network construction and operation.

[0005] 2. The error control assumptions are idealized, and the engineering implementation path is unclear: The relevant technical solutions do not disclose how to ensure that the entanglement fidelity of each stage output can be stabilized at a preset fixed value under the conditions of non-ideal physical devices and limited resources. It assumes the existence of an available error correction / distillation protocol and that the error is below a threshold, but does not provide a specific method for dynamically adjusting the protocol parameters based on the input fidelity to maintain a constant output fidelity.

[0006] 3. Static optimization lacks dynamic adaptability: The minimum cost flow solution of related technical solutions is based on one-time, fixed network parameters. It does not consider real-time re-optimization mechanisms under conditions such as dynamic changes in network topology (e.g., node addition / exit, link failure), time-varying channel parameters, or fluctuations in service demand, making it difficult to apply to practical self-organizing quantum networks.

[0007] Therefore, there is an urgent need for a complete technical solution with a clear cost model, an engineerable error fixing mechanism, and dynamic adaptability to promote the quantum internet from theory to practical deployment and operation. Summary of the Invention

[0008] In one embodiment of the present invention, the present invention is proposed to solve at least one of the above-mentioned problems. According to a first aspect of the present invention, a quantum network networking method is provided, the method comprising:

[0009] Obtain the maximum entanglement generation capacity of each physical link in a quantum network. The unit entanglement cost is calculated based on actual operating cost factors and a preset cost model. ;

[0010] Constructing undirected graphs corresponding to physical quantum networks and in the undirected graph The maximum entanglement generation capacity is indicated in the text. Entanglement cost of the unit ;

[0011] Receive the client's entangled resource request;

[0012] Based on the undirected graph To minimize total cost The goal is to satisfy the entanglement resource requirements and Given the conditions, construct a minimum cost flow problem;

[0013] An optimization algorithm is invoked to solve the minimum cost flow problem, resulting in an entanglement generation allocation scheme for each link. ;

[0014] According to the allocation scheme The quantum devices controlling the corresponding links perform entanglement generation and swapping operations;

[0015] in, This represents the set of vertices mapped to quantum nodes in the network. Represents the edge set of the quantum channel mapping in the network. This indicates a capacity constraint.

[0016] In one embodiment of the present invention, the preset cost model is: ;

[0017] in, Indicates the first The unit entanglement cost value of each cost factor. Indicates the first The preset weighting coefficients corresponding to each cost factor.

[0018] In one embodiment of the present invention, the cost factor includes at least two of energy consumption, time delay, and economic cost.

[0019] In one embodiment of the present invention, the maximum entanglement generation capacity of each physical link is continuously monitored. The algorithm also includes real-time values ​​of each actual operating cost factor; when the change in any parameter exceeds a preset threshold, the optimization algorithm is invoked again to solve the minimum cost flow problem and update the allocation scheme. .

[0020] In one embodiment of the present invention, the maximum entanglement generation capacity of each physical link in the quantum network is obtained. Previously, the method also included: a recursive cascading step;

[0021] The recursive cascading steps specifically include:

[0022] The output of at least one underlying quantum network is abstracted as a virtual link of an upper-layer network;

[0023] At the interface of the virtual link, the fidelity of the entanglement output by the underlying network is evaluated, and a quantum error correction or entanglement distillation scheme is adaptively selected for processing based on the evaluation result, and entangled resources with a preset fixed fidelity are output.

[0024] Based on the equivalent capacity and cost of the virtual link, the process of obtaining the maximum entanglement generation capacity of each physical link in the quantum network is recursively executed in the upper-layer network. .

[0025] In one embodiment of the present invention, the adaptive selection specifically involves selecting, based on the difference between the measured fidelity of the input entanglement and the target fixed fidelity, the quantum error correction code or distillation protocol and its parameters with optimal resource efficiency from a preset strategy library.

[0026] In one embodiment of the present invention, the allocation scheme is... The steps for controlling the quantum devices of the corresponding links to perform entanglement generation and swapping operations are as follows:

[0027] The allocation scheme The instructions are encoded into a sequence of commands executable by the quantum device and distributed through a classical channel;

[0028] The quantum devices on each side execute a point-to-point entanglement generation protocol, according to the aforementioned allocation scheme. Generate primary entanglement;

[0029] After receiving the entanglement generation success information for the link under its jurisdiction, each relay node performs entanglement exchange operation according to the predetermined path.

[0030] In one embodiment of the present invention, the optimization algorithm is the network simplex method.

[0031] According to a second aspect of the present invention, a quantum network system is provided, the system comprising: a plurality of quantum nodes and at least one classical control node;

[0032] The classical control node is connected to the quantum node to implement the above-described quantum network networking method.

[0033] In one embodiment of the present invention, the system further includes: at least one entanglement processing module;

[0034] The entanglement processing module is connected to the classical control node and is used to implement the above-mentioned recursive cascading steps.

[0035] The quantum network topology method and quantum network system provided by embodiments of the present invention, by introducing a specific cost model that integrates multi-dimensional operational indicators, transform minimum cost optimization from a theoretical concept into a calculable and executable operational strategy, directly reducing the actual operating expenses of the quantum network. Simultaneously, the standardized modeling method based on undirected graphs possesses good topology adaptability and can be directly applied to quantum networks of arbitrary structures, providing a feasible technical path for the engineering deployment and refined operation of quantum networks. Attached Figure Description

[0036] To more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0037] Figure 1 This is a flowchart illustrating a quantum network networking method according to an embodiment of the present invention.

[0038] Figure 2 This is a schematic diagram of the structure of a quantum network system provided in an embodiment of the present invention. Detailed Implementation

[0039] To make the objectives, technical solutions, and advantages of the present invention more apparent, exemplary embodiments according to the present invention will be described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are merely a part of the embodiments of the present invention, and not all of the embodiments of the present invention. It should be understood that the present invention is not limited to the exemplary embodiments described herein. Based on the embodiments of the present invention described herein, all other embodiments obtained by those skilled in the art without inventive effort should fall within the protection scope of the present invention.

[0040] In the following description, numerous specific details are set forth in order to provide a more thorough understanding of the invention. However, it will be apparent to those skilled in the art that the invention can be practiced without one or more of these details. In other instances, certain technical features well-known in the art have not been described in order to avoid obscuring the invention.

[0041] It should be understood that the invention can be embodied in various forms and should not be construed as being limited to the embodiments set forth herein. Rather, providing these embodiments will make the disclosure thorough and complete, and will fully convey the scope of the invention to those skilled in the art.

[0042] To fully understand this invention, a detailed structure will be presented in the following description to illustrate the technical solution proposed by this invention. Optional embodiments of the invention are described in detail below; however, in addition to these detailed descriptions, the invention may have other embodiments.

[0043] The following detailed description of some embodiments of the present invention is provided in conjunction with the accompanying drawings. Unless otherwise specified, the following embodiments and features can be combined with each other.

[0044] The first aspect of this invention provides a quantum network networking method, such as... Figure 1 As shown, quantum network topology methods include:

[0045] S1, Obtain the maximum entanglement generation capacity of each physical link in the quantum network. The unit entanglement cost is calculated based on actual operating cost factors and a preset cost model. .

[0046] As an example, the maximum entanglement generation capacity of all physical links in the entire network can be collected through a classic control node. And multidimensional cost raw data.

[0047] It should be noted that the maximum entanglement generation capacity It is physically measurable.

[0048] S2, Constructing the undirected graph corresponding to the physical quantum network. and in undirected graphs Maximum entanglement generation capacity (indicated by the Chinese character) getting entangled with the company about costs .

[0049] in, This represents the set of vertices mapped to quantum nodes in the network. This represents the edge set of the quantum channel mapping in the network.

[0050] S3 receives the client's entanglement resource request.

[0051] S4, based on undirected graphs To minimize total cost With the goal of satisfying the needs of entangled resources and Given the condition, construct the minimum cost flow problem.

[0052] in, This indicates a capacity constraint.

[0053] For example, client node pairs (s,t) can be labeled as the start and end points of traffic. The entanglement resource requirement of a client pair is the total number of end-to-end entangled bits that need to be delivered between the st node pairs.

[0054] S5, invoke the optimization algorithm to solve the minimum cost flow problem, and obtain the entanglement generation allocation scheme for each link. .

[0055] Specifically, the optimization algorithm is the network simplex method. The network simplex method is an efficient combinatorial optimization algorithm specifically designed for solving minimum cost flow problems; it is a specialized version of the general linear programming simplex method applied to network structures.

[0056] S6, according to the allocation scheme The quantum devices controlling the corresponding links perform entanglement generation and swapping operations.

[0057] The quantum network topology method provided in this invention introduces a specific cost model that integrates multi-dimensional operational indicators, transforming minimum cost optimization from a theoretical concept into a calculable and executable operational strategy, thereby directly reducing the actual operating expenses of quantum networks. Simultaneously, the standardized modeling method based on undirected graphs possesses excellent topology adaptability and can be directly applied to quantum networks of arbitrary structures, providing a feasible technical path for the engineering deployment and refined operation of quantum networks.

[0058] In some embodiments, the preset cost model is: .

[0059] in, Indicates the first The unit entanglement cost value of each cost factor. Indicates the first The preset weighting coefficients corresponding to each cost factor.

[0060] Specifically, cost factors include at least two of the following: energy consumption, time delay, and economic cost.

[0061] As an example, unit entanglement cost It can be calculated using the following formula:

[0062]

[0063] in, The average energy cost to generate one entangled bit, This is a cost factor calculated by offsetting the inherent transmission and processing delays of the link. The economic cost of channel usage or equipment depreciation. These basic data are provided by the network monitoring system to set weighting coefficients based on the network operation strategy.

[0064] In this embodiment, the pre-defined cost model quantifies and links the unit entanglement cost with actual operational factors such as energy consumption, latency, and economic costs, transforming minimum cost optimization from an abstract theory into a calculable indicator that can guide network operation. This refined pre-defined cost model provides direct technical basis and support for the precise pricing, billing, and resource trading of quantum communication services, contributing to the innovation of quantum internet business models.

[0065] In some embodiments, the maximum entanglement generation capacity of each physical link is continuously monitored. In addition to the real-time values ​​of each actual operating cost factor; when the change in any parameter exceeds the preset threshold, the optimization algorithm is called again to solve the minimum cost flow problem and update the allocation scheme. .

[0066] As an example, the control node continuously monitors (e.g., channel attenuation changes) and cost factors (e.g., energy price fluctuations). When any parameter changes beyond a preset threshold, the minimum cost flow problem is automatically resolved, and a new allocation scheme is generated and distributed. This enables dynamic scheduling of network resources.

[0067] In this embodiment, the dynamic adaptation mechanism can respond in real time to network time-varying conditions such as channel capacity fluctuations and changes in operating costs. By triggering thresholds to automatically update the resource allocation scheme, the network can always maintain the optimal state with the lowest operating cost, effectively improving the robustness and practicality of the quantum network.

[0068] In some embodiments, the maximum entanglement generation capacity of each physical link in a quantum network is obtained. Previously, quantum network building methods also included: recursive cascading steps;

[0069] The recursive cascading steps specifically include:

[0070] S71 abstracts the output of at least one underlying quantum network as a virtual link of an upper-layer network.

[0071] S72 performs fidelity evaluation on the entanglement output from the underlying network at the interface of the virtual link, and adaptively selects either quantum error correction or entanglement distillation schemes for processing based on the evaluation results, outputting entangled resources with a preset fixed fidelity.

[0072] Specifically, the adaptive selection involves selecting the most resource-efficient quantum error-correcting code or distillation protocol and its parameters from a pre-set strategy library based on the difference between the measured fidelity of the input entanglement and the target fixed fidelity.

[0073] As an example, different quantum error-correcting codes (such as surface codes, Bacon-Shor codes) or distillation protocols (such as the DEJMPS protocol) can be selected.

[0074] S73, based on the equivalent capacity and cost of virtual links, recursively executes the process in the upper-layer network to obtain the maximum entanglement generation capacity of each physical link in the quantum network. .

[0075] In this embodiment, the proposed recursive cascading steps and strategy selection mechanism clarify the specific technical path to achieve fixed output fidelity under limited resources and non-ideal devices, solving the key problem of implementing cascading theory.

[0076] Accordingly, the recursive cascading steps can be executed by the Entanglement Processing Module (EPM), and the adaptive error reset process of this invention is as follows:

[0077] Reception and Evaluation: EPM receives signals from the underlying network. For entangled bits, quickly estimate their average fidelity. .

[0078] Strategy selection: The classic control unit within the EPM is based on... and target fixed fidelity The most economical quantum error correction code (such as the [[7,1,3]] code or the [[5,1,3]] code) or entanglement distillation protocol (such as the DEJMPS protocol) and its iteration parameters are dynamically selected from a pre-set strategy library.

[0079] Execution and Output: Quantum hardware performs selected error correction or distillation operations, consuming... Entangled input, output For fidelity The "standardized" entangled pairs are provided for use by the upper-layer network.

[0080] Recursive aggregation: In the upper-level graph, virtual edges are... The capacity is defined as ,cost Integrating the underlying network costs and EPM processing costs, the dynamic cost aggregation process described in steps S1-S6 is run again. This process can be performed recursively, ensuring that the final output error at each level depends only on the settings of that level. It is independent of the size, distance, and initial error of the underlying network.

[0081] In some embodiments, according to the allocation scheme The steps for controlling the quantum devices of the corresponding links to perform entanglement generation and swapping operations are as follows:

[0082] S61, the allocation scheme The instructions are encoded as a sequence of commands executable by the quantum device and distributed through a classical channel.

[0083] S62, the quantum devices on each side execute the point-to-point entanglement generation protocol, according to the allocation scheme. Generate primary entanglement.

[0084] As an example, a point-to-point entanglement generation protocol could be a parametric downconversion-based entangled photon generation scheme.

[0085] It should be noted that point-to-point entanglement generation can be achieved using different physical systems (superconducting circuits, ion traps, photonic integrated chips).

[0086] S63, after each relay node receives the entanglement generation success information of the link under its jurisdiction, it performs entanglement exchange operation according to the predetermined path.

[0087] As an example, Bell state measurements can be performed along the optimal flow path to complete the entanglement swap operation.

[0088] In this embodiment, the operation timing is clear and controllable, which not only ensures the consistency of network resource scheduling, but also avoids invalid relay operations through the success confirmation mechanism, thereby improving the generation efficiency and execution reliability of end-to-end entanglement.

[0089] Next, this invention will be explained by verifying the effectiveness of minimum cost aggregation:

[0090] Experimental setup: Simulate a quantum network with 8 nodes and 12 edges. The capacity of each edge is... Randomly generated in the interval [5,15], unit cost Randomly generated in the interval [10, 30]. The goal is to establish 10 ebits between node 1 and node 8.

[0091] Comparison of options:

[0092] Option A (existing technical benchmark): Force each edge to operate at maximum capacity. Generate entanglement (equivalent to ignoring cost optimization).

[0093] Option B (this invention): Run the minimum cost flow algorithm, according to... distribute.

[0094] The experimental results are shown in Table 1:

[0095] Table 1: Comparison of Experimental Results

[0096] Performance indicators Existing technical solutions Invention Solution Improvement effect Total cost 300 (hypothetical value) 215 Costs reduced by 28.3% Achieve number of ebits 10 10 Goal achieved Unit cost 30 21.5 Efficiency increased by 28.3%

[0097] Conclusion: This embodiment fully demonstrates that the present invention significantly reduces resource consumption and operating costs without sacrificing performance.

[0098] Next, this invention will be described using the verification of adaptive cascade error fixing capability:

[0099] Experimental setup: A two-level network was constructed. The bottom layer consisted of three independent linear subnets (each with four nodes), with point-to-point entanglement generating fidelity simulations using random values ​​in the range of 0.92 to 0.96. The upper layer was a three-node triangular network. A target fidelity was set. .

[0100] Experimental procedure:

[0101] 1. Run the method of this invention on each underlying subnet (cost optimization omitted), and output entanglement. Uneven (e.g., 0.93, 0.95, 0.96).

[0102] 2. Each subnet outputs to the EPM. The EPM policy library contains [[5,1,3]] codes (lower overhead, for weak error correction) and [[7,1,3]] codes (for strong error correction).

[0103] 3. EPM automatically selects based on F_in: for Select the [[5,1,3]] code; for Select code [[7,1,3]].

[0104] 4. After EPM processing, the output fidelity of the three virtual edges all reached 0.989±0.002.

[0105] 5. Run aggregation again on the upper triangular network.

[0106] Experimental results:

[0107] The final entanglement fidelity between clients is 0.985 ± 0.003.

[0108] Control experiment: If EPM adaptive selection is not used and the [[7,1,3]] code is forced for all inputs, similar fidelity can be achieved, but the total resource consumption increases by about 25%.

[0109] Conclusion: This embodiment verifies that through adaptive cascading processing, the present invention can economically and efficiently generate end-to-end entanglement with fixed fidelity and meeting requirements from an underlying network with uneven fidelity, effectively controlling error accumulation.

[0110] In addition, the present invention also provides a quantum network system, such as Figure 2 As shown, the quantum network system includes: multiple quantum nodes 101 and at least one classical control node 102.

[0111] It should be noted that, Figure 2 The example given is of two quantum nodes 101 and one classical control node 102. This is just an example, and the actual number of quantum nodes 101 and classical control nodes 102 can be determined according to the actual application.

[0112] The classical control node 102 is connected to the quantum node 101 to implement the above-described quantum network networking method.

[0113] The quantum network system provided in this invention, by introducing a specific cost model that integrates multi-dimensional operational indicators, transforms minimum cost optimization from a theoretical concept into a calculable and executable operational strategy, directly reducing the actual operating expenses of the quantum network. Simultaneously, the standardized modeling method based on undirected graphs possesses excellent topological adaptability and can be directly applied to quantum networks of arbitrary structures, providing a feasible technical path for the engineering deployment and refined operation of quantum networks.

[0114] In some embodiments, the quantum network system further includes at least one entanglement processing module.

[0115] The entanglement processing module is connected to the classic control node 102 to implement the recursive cascading steps as described in claim 5.

[0116] Although exemplary embodiments have been described herein with reference to the accompanying drawings, it should be understood that the above exemplary embodiments are merely illustrative and are not intended to limit the scope of this application. Various changes and modifications can be made therein by those skilled in the art without departing from the scope and spirit of this application. All such changes and modifications are intended to be included within the scope of this application as claimed in the appended claims.

[0117] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0118] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed.

[0119] Numerous specific details are set forth in the specification provided herein. However, it will be understood that embodiments of this application may be practiced without these specific details. In some instances, well-known methods, structures, and techniques have not been shown in detail so as not to obscure the understanding of this specification.

[0120] Similarly, it should be understood that, in order to streamline this application and aid in understanding one or more of the various inventive aspects, features of this application may sometimes be grouped together in a single embodiment, figure, or description thereof in the description of exemplary embodiments of this application. However, this approach should not be construed as reflecting an intention that the claimed application requires more features than are expressly recited in each claim. Rather, as reflected in the corresponding claims, its inventive point lies in solving the corresponding technical problem with features fewer than all features of a single disclosed embodiment. Therefore, the claims following the detailed description are hereby expressly incorporated into that detailed description, wherein each claim itself is a separate embodiment of this application.

[0121] Those skilled in the art will understand that, apart from the mutual exclusion of features, all features disclosed in this specification (including the accompanying claims, abstract, and drawings) and all processes or elements of any method or apparatus so disclosed may be combined in any combination. Unless otherwise expressly stated, each feature disclosed in this specification (including the accompanying claims, abstract, and drawings) may be replaced by an alternative feature that serves the same, equivalent, or similar purpose.

[0122] Furthermore, those skilled in the art will understand that although some embodiments described herein include certain features included in other embodiments but not others, combinations of features from different embodiments are intended to be within the scope of this application and form different embodiments. For example, in the claims, any one of the claimed embodiments can be used in any combination.

[0123] The various component embodiments of this application can be implemented in hardware, or as software modules running on one or more processors, or a combination thereof. Those skilled in the art will understand that microprocessors or digital signal processors (DSPs) can be used in practice to implement some or all of the functions of some modules according to the embodiments of this application. This application can also be implemented as an apparatus program (e.g., a computer program and computer program product) for performing part or all of the methods described herein. Such an implementation of this application can be stored on a computer-readable medium, or can be in the form of one or more signals. Such signals can be downloaded from an Internet website, provided on a carrier signal, or provided in any other form.

[0124] It should be noted that the above embodiments are illustrative of this application and not restrictive, and that those skilled in the art can devise alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses should not be construed as limiting the claims. The word "comprising" does not exclude the presence of elements or steps not listed in the claims. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. This application can be implemented by means of hardware comprising several different elements and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by the same item of hardware. The use of the words first, second, and third, etc., does not indicate any order. These words can be interpreted as names.

[0125] The above description is merely a specific embodiment or illustration of the embodiments of this application. The scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. The scope of protection of this application shall be determined by the scope of the claims.

Claims

1. A quantum network networking method, characterized in that, The method includes: Obtain the maximum entanglement generation capacity of each physical link in a quantum network. The unit entanglement cost is calculated based on actual operating cost factors and a preset cost model. ; Constructing undirected graphs corresponding to physical quantum networks and in the undirected graph The maximum entanglement generation capacity is indicated in the text. Entanglement cost of the unit ; Receive the client's entangled resource request; Based on the undirected graph To minimize total cost The goal is to satisfy the entanglement resource requirements and Given the conditions, construct a minimum cost flow problem; An optimization algorithm is invoked to solve the minimum cost flow problem, resulting in an entanglement generation allocation scheme for each link. ; According to the allocation scheme The quantum devices controlling the corresponding links perform entanglement generation and swapping operations; in, This represents the set of vertices mapped to quantum nodes in the network. Represents the edge set of the quantum channel mapping in the network. This indicates a capacity constraint.

2. The quantum network networking method according to claim 1, characterized in that, The preset cost model is as follows: ; in, Indicates the first The unit entanglement cost value of each cost factor. Indicates the first The preset weighting coefficients corresponding to each cost factor.

3. The quantum network networking method according to claim 2, characterized in that, The cost factors include at least two of the following: energy consumption, time delay, and economic cost.

4. The quantum network networking method according to claim 1, characterized in that, Continuously monitor the maximum entanglement generation capacity of each physical link. The algorithm also includes real-time values ​​of each actual operating cost factor; when the change in any parameter exceeds a preset threshold, the optimization algorithm is invoked again to solve the minimum cost flow problem and update the allocation scheme. .

5. The quantum network networking method according to claim 1, characterized in that, The maximum entanglement generation capacity of each physical link in the quantum network is obtained. Previously, the method also included: a recursive cascading step; The recursive cascading steps specifically include: The output of at least one underlying quantum network is abstracted as a virtual link of an upper-layer network; At the interface of the virtual link, the fidelity of the entanglement output by the underlying network is evaluated, and a quantum error correction or entanglement distillation scheme is adaptively selected for processing based on the evaluation result, and entangled resources with a preset fixed fidelity are output. Based on the equivalent capacity and cost of the virtual link, the process of obtaining the maximum entanglement generation capacity of each physical link in the quantum network is recursively executed in the upper-layer network. .

6. The quantum network networking method according to claim 5, characterized in that, The adaptive selection specifically involves selecting the most resource-efficient quantum error-correcting code or distillation protocol and its parameters from a pre-set strategy library based on the difference between the measured fidelity of the input entanglement and the target fixed fidelity.

7. The quantum network networking method according to claim 1, characterized in that, According to the allocation scheme The steps for controlling the quantum devices of the corresponding links to perform entanglement generation and swapping operations are as follows: The allocation scheme The instructions are encoded into a sequence of commands executable by the quantum device and distributed through a classical channel; The quantum devices on each side execute a point-to-point entanglement generation protocol, according to the aforementioned allocation scheme. Generate primary entanglement; After receiving the entanglement generation success information for the link under its jurisdiction, each relay node performs entanglement exchange operation according to the predetermined path.

8. The quantum network networking method according to claim 1, characterized in that, The optimization algorithm is the network simplex method.

9. A quantum network system, characterized in that, The system includes: multiple quantum nodes and at least one classical control node; The classical control node is connected to the quantum node to implement the quantum network networking method as described in any one of claims 1-7.

10. The quantum network system according to claim 9, characterized in that, The system further includes: at least one entanglement processing module; The entanglement processing module is connected to the classical control node and is used to implement the recursive cascading steps as described in claim 5.

Images