CN116405196A - Quantum entanglement distribution method based on pre-constructed resources and related equipment - Google Patents
Quantum entanglement distribution method based on pre-constructed resources and related equipment Download PDFInfo
- Publication number
- CN116405196A CN116405196A CN202310081625.4A CN202310081625A CN116405196A CN 116405196 A CN116405196 A CN 116405196A CN 202310081625 A CN202310081625 A CN 202310081625A CN 116405196 A CN116405196 A CN 116405196A
- Authority
- CN
- China
- Prior art keywords
- entanglement
- service
- constructed
- resources
- storage units
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000015654 memory Effects 0.000 claims abstract description 37
- 230000004044 response Effects 0.000 claims abstract description 34
- 230000006854 communication Effects 0.000 claims description 41
- 238000004891 communication Methods 0.000 claims description 40
- 230000000903 blocking effect Effects 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 4
- 230000011218 segmentation Effects 0.000 abstract description 4
- 239000004698 Polyethylene Substances 0.000 description 25
- 238000010586 diagram Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- -1 polyethylene Polymers 0.000 description 2
- 229920000573 polyethylene Polymers 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000005610 quantum mechanics Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a quantum entanglement distribution method based on pre-constructed resources and related equipment, comprising the following steps: receiving a service request and analyzing to obtain service attributes; determining the shortest path of the service request in the network topology according to the service attribute; judging whether the service duration is smaller than the sustainable time of a storage unit in the network; in response to the service duration being less than the sustainable time, traversing all storage units included on the shortest path to obtain the number of pre-constructed entanglement resources stored in each storage unit and the remaining duration of the pre-constructed entanglement resources in a unit period; and performing entanglement exchange according to the number and the remaining duration, and establishing end-to-end entanglement. The method and the device realize dynamic segmentation of the storage units in the quantum memory by utilizing the pre-constructed entanglement resources, ensure that the network can realize high-efficiency pre-constructed entanglement resource distribution, and finally finish end-to-end entanglement channel establishment among any nodes.
Description
Technical Field
The disclosure relates to the technical field of quantum networks, in particular to a quantum entanglement distribution method based on pre-constructed resources and related equipment.
Background
Quantum entanglement is a fundamental property unique to quantum mechanics and is also a very important cornerstone in quantum cryptography, and early discussions of quantum entanglement were qualitative, such as using entanglement to achieve quantum key distribution. However, with the rapid development of quantum technology, the qualitative discussion is not satisfied, and how to quantitatively use the special properties of the quantum systems becomes a new pursuit goal. Under the research background of a quantum network, how to operate and control an entanglement resource serving as one of resources of the scene so as to finish quantum communication among any nodes becomes a focus of attention.
In the quantum communication process, a quantum state is used as a carrier of information, and a classical channel is needed, and meanwhile, the quantum channel established by quantum entanglement between two communication parties is needed to communicate. Likewise, during quantum communication, the completed quantum entanglement is pre-distributed and established, namely: the pre-built quantum entanglement can also be used as a quantum channel for quantum communication. Because of the decoherence characteristic of the quantum, the core of the pre-built quantum entanglement is to realize efficient pre-built entanglement resource distribution so as to complete the establishment of an end-to-end entanglement channel.
In view of this, how to utilize the pre-constructed entanglement resources to realize the dynamic segmentation of the storage units in the quantum memory, ensure that the network can realize the efficient distribution of the pre-constructed entanglement resources, and finally complete the establishment of the end-to-end entanglement channels among any nodes becomes an important research problem.
Disclosure of Invention
Accordingly, an object of the present disclosure is to provide a quantum entanglement distribution method based on pre-constructed resources and related devices, which are used for solving or partially solving the above-mentioned problems.
Based on the above object, a first aspect of the present disclosure provides a quantum entanglement distribution method based on pre-constructed resources, the method comprising:
receiving a service request in a network, and analyzing the service request to obtain a service attribute of the service request, wherein the service attribute comprises service duration;
determining the shortest path of the service request in a network topology according to the service attribute, wherein the network topology is the topology structure of the network;
judging whether the service duration is smaller than the sustainable time of a storage unit in the network;
traversing all storage units contained in the shortest path in response to the service duration being less than the sustainable time of the storage units in the network, and obtaining the number of the pre-built entanglement resources stored in each storage unit in the shortest path and the remaining duration of the pre-built entanglement resources in a unit period;
And performing entanglement exchange according to the number of the pre-constructed entanglement resources and the residual duration of the pre-constructed entanglement resources in a unit period, and establishing end-to-end entanglement of the service.
Based on the same inventive concept, a second aspect of the present disclosure proposes a quantum entanglement distribution device based on pre-built resources, comprising:
the service analysis module is configured to receive a service request in a network, analyze the service request and obtain a service attribute of the service request, wherein the service attribute comprises service duration;
a path determining module configured to determine a shortest path of the service request in a network topology according to the service attribute, wherein the network topology is a topology structure of the network;
a time determination module configured to determine whether the service duration is less than a sustainable time of a storage unit in the network;
a storage unit traversing module configured to traverse all storage units included in the shortest path in response to the service duration being less than a sustainable time of the storage units in the network, to obtain a number of pre-built entanglement resources stored in each storage unit on the shortest path and a remaining duration of the pre-built entanglement resources within a unit period;
The entanglement building module is configured to perform entanglement exchange according to the quantity of the pre-constructed entanglement resources and the remaining duration of the pre-constructed entanglement resources in a unit period, and build end-to-end entanglement of the service.
Based on the same inventive concept, a third aspect of the present disclosure proposes an electronic device comprising a memory, a processor and a computer program stored on the memory and executable by the processor, the processor implementing a quantum entanglement distribution method based on pre-built resources as described above when executing the computer program.
Based on the same inventive concept, a fourth aspect of the present disclosure proposes a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the quantum entanglement distribution method based on pre-built resources as described above.
From the above, the disclosure provides a quantum entanglement distribution method based on a pre-constructed resource and related equipment, by receiving a service request in a network, resolving the service request to obtain a service attribute of the service request, where the service attribute includes a service duration, resolving the received service request to obtain a service attribute, determining a shortest path of the service request in a network topology according to the service attribute, where the network topology is a topology structure of the network, determining a shortest path of the service in the network topology according to the resolved service attribute, and determining a path determination is more accurate; judging whether the service duration is smaller than the sustainable time of a storage unit in the network; traversing all storage units contained in the shortest path in response to the service duration being less than the sustainable time of the storage units in the network, and obtaining the number of the pre-built entanglement resources stored in each storage unit in the shortest path and the remaining duration of the pre-built entanglement resources in a unit period; by judging the service duration, the problem that the duration of a storage unit in a network is short and insufficient to support the task is solved; and establishing end-to-end entanglement of the service by carrying out entanglement exchange according to the number of the pre-constructed entanglement resources and the residual duration of the pre-constructed entanglement resources in a unit period, and realizing dynamic segmentation of a storage unit in a quantum memory by utilizing the pre-constructed entanglement resources, thereby ensuring that a network can realize high-efficiency pre-constructed entanglement resource distribution and realizing establishment of a communication double-side end-to-end entanglement channel in a quantum communication network.
Drawings
In order to more clearly illustrate the technical solutions of the present disclosure or related art, the drawings required for the embodiments or related art description will be briefly described below, and it is apparent that the drawings in the following description are only embodiments of the present disclosure, and other drawings may be obtained according to these drawings without inventive effort to those of ordinary skill in the art.
FIG. 1 is a flow chart of a pre-built resource-based quantum entanglement distribution method according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of entanglement exchange of an embodiment of the disclosure;
FIG. 3 is a schematic diagram of an established end-to-end connection channel according to an embodiment of the present disclosure;
FIG. 4 is a time slicing schematic of an embodiment of the present disclosure;
FIG. 5 is a flow chart of an embodiment in another application scenario of the present disclosure;
fig. 6 is a network topology diagram of an embodiment in another application scenario of the present disclosure;
FIG. 7 is a block diagram of a quantum entanglement distribution device based on pre-built resources according to an embodiment of the disclosure;
fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure.
Detailed Description
For the purposes of promoting an understanding of the principles and advantages of the disclosure, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe the same.
It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present disclosure should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present disclosure pertains. The terms "first," "second," and the like, as used in embodiments of the present disclosure, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", etc. are used merely to indicate relative positional relationships, which may also be changed when the absolute position of the object to be described is changed.
Based on the above description, the present embodiment proposes a quantum entanglement distribution method based on pre-constructed resources, as shown in fig. 1, where the method includes:
When a service request in a network arrives, the service request is received, and the service request is analyzed to obtain a service attribute. Wherein the business attributes include at least one of: source node, sink node, service start time, service duration, etc. Through the scheme, the received service request is analyzed to obtain the service attribute, so that the subsequent step can judge according to the service attribute to determine whether the service is normally performed.
In the implementation, the network topology structure of the network is obtained, the shortest path of the service request in the network topology is determined by utilizing a shortest path algorithm according to the service attribute obtained in the steps, the hop count of the shortest path is recorded, the determined shortest path is more accurate, meanwhile, the end-to-end entanglement is built based on the shortest path, and the unnecessary time loss is reduced.
In implementation, the duration of the service included in the service attribute is compared with the duration of the storage unit in the network, and it is determined that the storable unit in the network can maintain normal operation of the whole service.
And step 104, traversing all the storage units contained in the shortest path to obtain the quantity of the pre-built entanglement resources stored in each storage unit in the shortest path and the residual duration of the pre-built entanglement resources in a unit period in response to the service duration being smaller than the sustainable duration of the storage units in the network.
And when the duration of the storage unit in the network is more than or equal to the service duration, determining that the storage unit in the network can maintain the whole service to be normally performed. Traversing the storage units on the shortest path determined in the steps to obtain the quantity of the pre-constructed resources stored in each storage unit on the shortest path and the residual duration of the pre-constructed entanglement resources in a unit period. Through the scheme, after the storage units in the network are determined to be capable of maintaining normal operation, only the storage units on the shortest path are traversed, the traversed storage units are more targeted, all the storage units in the network are prevented from being traversed, traversing time is greatly shortened, and traversing efficiency is improved.
For example, according to the shortest path determined by the service attribute being a-B-D, traversing the storage units on the shortest path, that is, traversing the storage units in node a, node B and node D respectively, to obtain the number PE (P A ) And the remaining duration T (P) of the pre-constructed entanglement resources within a unit period A ) Number of pre-constructed resources PE (P) stored in a storage unit of a node B B ) And the remaining duration T (P) of the pre-constructed entanglement resources within a unit period B ) And the number of pre-constructed resources PE (P) stored in the storage unit of node D D ) And the remaining duration T (P) of the pre-constructed entanglement resources within a unit period D )。
And 105, performing entanglement exchange according to the number of the pre-constructed entanglement resources and the residual duration of the pre-constructed entanglement resources in a unit period, and establishing end-to-end entanglement of the service.
In specific implementation, entanglement exchange is carried out according to the number of the pre-constructed entanglement resources obtained in the steps and the remaining duration of the pre-constructed entanglement resources in a unit period, and end-to-end entanglement of the service is established.
According to the scheme, the service request is analyzed by receiving the service request in the network to obtain the service attribute of the service request, wherein the service attribute comprises service duration, the service attribute is obtained by analyzing the received service request, the shortest path of the service request in the network topology is determined according to the service attribute, the network topology is the topology structure of the network, the shortest path of the service in the network topology is determined according to the analyzed service attribute, and the path determination is more accurate; judging whether the service duration is smaller than the sustainable time of a storage unit in the network; traversing all storage units contained in the shortest path in response to the service duration being less than the sustainable time of the storage units in the network, and obtaining the number of the pre-built entanglement resources stored in each storage unit in the shortest path and the remaining duration of the pre-built entanglement resources in a unit period; by judging the service duration, the problem that the duration of a storage unit in a network is short and insufficient to support the task is solved; and establishing end-to-end entanglement of the service by carrying out entanglement exchange according to the number of the pre-constructed entanglement resources and the residual duration of the pre-constructed entanglement resources in a unit period, and realizing dynamic segmentation of a storage unit in a quantum memory by utilizing the pre-constructed entanglement resources, thereby ensuring that a network can realize high-efficiency pre-constructed entanglement resource distribution and realizing establishment of a communication double-side end-to-end entanglement channel in a quantum communication network.
In some embodiments, after step 103, further comprising:
and step 103A, determining that the service request is blocked and sending blocking prompt information in response to the service duration being greater than or equal to the sustainable time of the storage unit in the network.
And when the duration of the storage unit in the network is smaller than the service duration, determining that the storage unit in the network cannot maintain the whole service to normally run, requesting for blocking the service, and sending a service blocking prompt message.
In some embodiments, the service attribute further includes a source node and a destination node, and step 105 specifically includes:
step 1051, determining an intermediate node according to the source node, the destination node and the shortest path in the service attribute.
In the specific implementation, the service attribute obtained by analyzing the service request further comprises information of a source node and a destination node, and the shortest path determined in the steps is combined to determine an intermediate node included in the shortest path. For example, if the source node is determined to be a, the sink node is determined to be E, and the shortest path is determined to be a-B-D-E, the intermediate node is determined to be node B and node D.
Step 1052, determining the number of pre-constructed entangled resources in the storage units in the source node, the sink node and the intermediate node.
In the implementation, the number information of the pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node is acquired, and whether the number of the pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node meets preset conditions is respectively judged.
And step 1053, performing entanglement distribution on all storage units included on the shortest path in response to the number of the pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node meeting a first condition, wherein the first condition is that the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is not null and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is greater than a preset threshold.
In the implementation, when the preset condition is a first condition, that is, the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is not null and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is greater than a preset threshold, where the preset threshold is preferentially 2, entanglement distribution is performed on all the storage units included in the shortest path.
And 1054, performing entanglement exchange on the storage unit with the entanglement distribution completed, and establishing end-to-end entanglement of the service.
And in the specific implementation, carrying out entanglement exchange on the storage units which are subjected to entanglement distribution in the steps, and establishing end-to-end connection of the service.
For example, the entanglement exchange, as shown in fig. 2, is to establish entanglement of long distances of the quantum memories (Quantum Memory QM) a to Z in fig. 2, first independently generating entanglement such as a and B, C and D in a short elementary link. Entanglement is exchanged between adjacent links, and short-distance entanglement is extended until entanglement is distributed between a and Z.
Referring to fig. 3, a schematic diagram of an established end-to-end connection channel is shown showing a quantum transmitter, a quantum receiver and an entanglement distribution source communicating with three types of channels, namely a quantum channel for distribution of entangled photons, a classical channel for transmitting bell state measurements, and an entanglement channel established from entangled photon pairs, after which the establishment of the end-to-end channel is completed.
In some embodiments, after step 1052, further comprising:
in step 1052A, in response to the number of pre-constructed entangled resources in the storage units in the source node, the sink node, and the intermediate node not satisfying the first condition, it is determined whether the traffic duration is greater than a remaining duration of the pre-constructed entangled resources within a unit period.
When the number of the pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node does not meet the first condition, judging the residual duration of the pre-constructed entanglement resources in the unit period and the service duration contained in the service attribute obtained in the steps.
And step 1052B1, in response to the service duration being greater than the remaining duration of the pre-constructed entanglement resource in the unit period, performing entanglement distribution on all storage units contained in the shortest path, performing entanglement exchange on the storage units with entanglement distribution completed, and establishing end-to-end entanglement of the service.
When the service duration is longer than the remaining duration of the pre-constructed entanglement resources in the unit period, entanglement distribution is carried out on all storage units contained in the shortest path, entanglement exchange is carried out on the storage units with the entanglement distribution completed, and end-to-end entanglement of the service is established.
And step 1052B2, performing entanglement exchange on the storage unit in response to the service duration being less than or equal to the remaining duration of the pre-constructed entanglement resource in the unit period, and establishing end-to-end entanglement of the service.
When the service duration is smaller than or equal to the remaining duration of the pre-constructed entanglement resource in the unit period, the entanglement exchange is directly carried out on the storage unit, and the end-to-end entanglement of the service is established.
In some embodiments, step 1052A specifically includes:
the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is empty, and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is larger than a preset threshold; or,
the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is empty, and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is smaller than a preset threshold; or,
the number of pre-constructed entangled resources in storage units in the source node and the sink node is not null and the number of pre-constructed entangled resources in storage units in the intermediate node is less than a preset threshold.
In some embodiments, prior to step 101, further comprising:
step 100, traversing all communication nodes in the network topology to obtain the number of pre-constructed entanglement resources and sustainable time in a storage unit of each communication node in the network topology.
In the implementation, each communication node in the network topology of the network is traversed to obtain the number of pre-constructed entanglement resources and the sustainable time in a storage unit of each communication node in the network topology. Referring to fig. 4, a storage unit for constructing an entanglement channel is sliced in a fixed-size slot, and generation of entangled photon pairs, distribution of entangled resources, establishment of the entanglement channel, and the like are performed in the fixed-size slot.
For example, service 1 shown in fig. 4 arrives, and the duration of service 1 is T 4 -T 1 Querying the entanglement channels meeting the requirements, i.e. the pre-constructed entanglement channels of the storage unit 1, saidThe refresh period of the memory cell 1 is T 5 -T 1 When traffic 1 leaves, memory unit 1 is in period T 5 -T 4 The method is free, waste of entanglement resources in a network is reduced, utilization efficiency of each storage unit in the quantum memory is improved, meanwhile, fixed time slot resources are allocated for each pre-entanglement channel, and end-to-end entanglement establishment between two communication parties based on pre-entanglement is guaranteed to be completed in time slots with fixed sizes.
In some embodiments, after step 105, further comprising:
and 106, releasing the storage unit occupied by the service in response to the service leaving, and redistributing entangled photon pairs for the storage unit occupied by the service.
When the service request leaves, the method releases all the storage units occupied by the service, redistributes entangled photon pairs for the storage units, and realizes the updating of the storage units.
Based on the same inventive concept, another embodiment of the present disclosure in an application scenario is shown in fig. 5, including:
In specific implementation, the network topology is shown in fig. 6, and a topology of 25 nodes and 56 links is adopted, wherein the topology comprises 21 quantum communication nodes (i.e. 1 to 21 in fig. 6), 4 Entanglement Preparation Sources (EPS), 32 classical channels and 24 quantum channels. It is assumed that there is one quantum memory in each communication node and there are N memory cells in each quantum memory. Traversing each communication node in the network topology of the network to obtain the number of pre-constructed entanglement resources and the sustainable time in a storage unit of each communication node in the network topology.
When a service request in a network arrives, the service request is received, and the service request is analyzed to obtain a service attribute. Wherein the business attributes include at least one of: source node, sink node, service start time, service duration, etc. The service request is r, and the service request is analyzed to obtain 1 as the source node, 21 as the destination node, 10s as the service start time, and t as the service duration r 30s and the service end time 40s.
And in the specific implementation, determining the shortest path of the service request in the network topology by utilizing a shortest path algorithm according to the service attribute obtained in the steps. Based on the above example, the shortest path of the computing service r in the physical topology is P 1-11-21 And recording the shortest path hop count as 2 hops.
Step 504 determines whether the traffic duration is less than a sustainable time of a storage unit in the network.
In implementation, the duration of the service included in the service attribute is compared with the duration of the storage unit in the network, and it is determined that the storable unit in the network can maintain normal operation of the whole service. Based on the above example, the duration of the storage unit in the network is 1min, which is greater than the traffic duration for 30s.
And step 5051, in response to the service duration being less than the sustainable time of the storage units in the network, traversing all the storage units included in the shortest path to obtain the number of pre-built entanglement resources stored in each storage unit in the shortest path and the remaining duration of the pre-built entanglement resources in a unit period.
In specific implementation, traversing the storage units on the shortest path determined in the steps to obtain the number of the pre-constructed resources stored in each storage unit on the shortest path and the units of the pre-constructed entanglement resourcesThe remaining duration of the cycle. Based on the above example, the shortest path P is traversed 1-11-21 The storage units storing the pre-entangled resources in the quantum memories in the respective communication nodes Q-Node 1, Q-Node 11 and Q-Node 21 are recorded, and these storage units and the remaining time in which the pre-entangled resources are stored are recorded. Wherein the storage units of the communication nodes Q-Node 1, Q-Node 11 and Q-Node 21 for storing the pre-constructed entangled resources are PE (P) 1 )＝{PE 1-1 ,PE 1-2 ,...,PE 1-i }，PE(P 11 )＝{PE 11-1 ,PE 11-2 ,...,PE 11-k }，PE(P 21 )＝{PE 21-1 ,PE 21-2 ,...,PE 21-j Each storage unit stores the pre-constructed entanglement resources with residual time of T (P) 1 )＝{t 1-1 ,t 1-2 ,...,t 1-i }，T(P 11 )＝{t 11-1 ,t 11-2 ,...,t 11-k }，T(P 21 )＝{t 21-1 ,t 21-2 ,...,t 21-j }。
In step 5052, in response to the service duration being greater than or equal to the sustainable duration of the storage unit in the network, determining that the service request is blocked, and sending a blocking prompt message.
And when the duration of the storage unit in the network is smaller than the service duration, determining that the storage unit in the network cannot maintain the whole service to normally run, requesting for blocking the service, and sending a service blocking prompt message.
In the implementation, the number information of the pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node is acquired, and whether the number of the pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node meets preset conditions is respectively judged. Based on the above example, judgmentBreaking the selected path P 1-11-21 The number of storage units for storing the pre-constructed entanglement resources in each of the communication nodes Q-Node 1, Q-Node 11 and Q-Node 21 is N, wherein the number of storage units for storing the pre-constructed entanglement resources in the source Node Q-Node 1 and the sink Node Q-Node 21 is N s ，N d The number of storage units for storing the pre-constructed entanglement resources in the intermediate Node Q-Node 11 is N r 。
And step 507, performing entanglement distribution on all storage units included on the shortest path in response to the number of the pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node meeting a first condition, wherein the first condition is that the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is not null and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is greater than a preset threshold.
In the implementation, when the preset condition is a first condition, that is, the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is not null and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is greater than a preset threshold, where the preset threshold is preferentially 2, entanglement distribution is performed on all the storage units included in the shortest path. Based on the above example, the selected path P is determined 1-11-21 The number of storage units for storing the pre-constructed entanglement resources in each of the communication nodes Q-Node 1, Q-Node 11 and Q-Node 21 is N, wherein the number of storage units for storing the pre-constructed entanglement resources in the original destination nodes Q-Node 1 and Q-Node 21 is N s ，N d The number of storage units for storing the pre-constructed entanglement resources in the intermediate Node Q-Node 11 is N r If satisfy N s ,N d ≥1，N r And (2) carrying out entanglement distribution on all the storage units contained in the shortest path.
And step 508, in response to the number of pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node not meeting the first condition, judging whether the service duration is greater than the remaining duration of the pre-constructed entanglement resources in a unit period.
When the number of the pre-constructed entanglement resources in the storage units in the source node, the sink node and the intermediate node does not meet the first condition, judging the residual duration of the pre-constructed entanglement resources in the unit period and the service duration contained in the service attribute obtained in the steps. Based on the above example, the selected path P is determined 1-11-21 Pre-entangled resource duration in each hop of memory cells selected above, i.e. whether traffic duration is greater than t 1-i ，t 11-k1 ，t 11-k2 ，t 21-j I.e. whether t is satisfied 1-i ，t 11-k1 ，t 11-k2 ，t 21-j <t r ＝30s。
And in the specific implementation, carrying out entanglement exchange on the storage units which are subjected to entanglement distribution in the steps, and establishing end-to-end connection of the service.
In some embodiments, step 508 specifically includes:
in step 5081, in response to the service duration being greater than the remaining duration of the pre-constructed entanglement resource in the unit period, performing entanglement distribution on all storage units included in the shortest path, performing entanglement exchange on the storage units with entanglement distribution completed, and establishing end-to-end entanglement of the service.
In the implementation, when the service duration is greater than the remaining duration of the pre-constructed entanglement resource in the unit period, step 507 is executed, that is, entanglement distribution is performed on all the storage units included in the shortest path, step 509 is executed, entanglement exchange is performed on the storage units with the entanglement distribution completed, and end-to-end entanglement of the service is established. Based on the above example, the pre-constructed entanglement channel of the storage unit is recorded as ECh p ＝{ECh 1-11 ,ECH 11-21 While constructing entanglement channels ECh to the above p ＝{ECh 1-11 ,ECh 11-21 Go intoLine hop-by-hop entanglement exchange, finally forming end-to-end entanglement channels ECH of communication nodes Q-Node 1 and Q-Node 21 1-21 。
And step 5082, performing entanglement exchange on the storage unit in response to the service duration being less than or equal to the remaining duration of the pre-constructed entanglement resource in the unit period, and establishing end-to-end entanglement of the service.
In a specific implementation, when the service duration is less than or equal to the remaining duration of the pre-constructed entanglement resource in the unit period, step 509 is executed, that is, entanglement exchange is directly performed on the storage unit, and end-to-end entanglement of the service is established. Based on the above example, the pre-constructed entanglement channel of the storage unit is recorded as ECh p ＝{ECh 1-11 ,ECh 11-21 While constructing entanglement channels ECh to the above p ＝{ECh 1-11 ,ECh 11-21 Performing hop-by-hop entanglement exchange to finally form end-to-end entanglement channels ECh of the communication nodes Q-Node 1 and Q-Node 21 1-21 。
And step 510, releasing the storage unit occupied by the service in response to the service leaving, and redistributing entangled photon pairs for the storage unit occupied by the service.
When the service request leaves, the method releases all the storage units occupied by the service, redistributes entangled photon pairs for the storage units, and realizes the updating of the storage units. Based on the above example, when the service leaves, all the memory cells occupied by the service are released, namely: PE (polyethylene) 1-i ，PE 21-j ，PE 11-k1 ，PE 11-k2 The memory cell is that: PE (polyethylene) 1-i ，PE 21-j ，PE 11-k1 ，PE 11-k2 The entangled photon pairs are redistributed.
It should be noted that the method of the embodiments of the present disclosure may be performed by a single device, such as a computer or a server. The method of the embodiment can also be applied to a distributed scene, and is completed by mutually matching a plurality of devices. In the case of such a distributed scenario, one of the devices may perform only one or more steps of the methods of embodiments of the present disclosure, the devices interacting with each other to accomplish the methods.
It should be noted that the foregoing describes some embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments described above and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
Based on the same inventive concept, the present disclosure also provides a quantum entanglement distribution device based on the pre-constructed resource, corresponding to the method of any embodiment.
Referring to fig. 7, fig. 7 is a quantum entanglement distribution device based on pre-constructed resources according to an embodiment, including:
a service parsing module 701, configured to receive a service request in a network, parse the service request to obtain a service attribute of the service request, where the service attribute includes a service duration;
a path determining module 702 configured to determine a shortest path of the service request in a network topology according to the service attribute, wherein the network topology is a topology of the network;
a time determination module 703 configured to determine whether the service duration is less than a sustainable time of a storage unit in the network;
a storage unit traversing module 704 configured to, in response to the service duration being less than a sustainable time of a storage unit in the network, traverse all storage units included on the shortest path to obtain a number of pre-built entanglement resources stored in each storage unit on the shortest path and a remaining duration of the pre-built entanglement resources within a unit period;
the entanglement establishment module 705 is configured to perform entanglement exchange according to the number of the pre-constructed entanglement resources and the remaining duration of the pre-constructed entanglement resources in a unit period, and establish end-to-end entanglement of the service.
In some embodiments, after determining whether the traffic duration is less than a sustainable time of a storage unit in the network, the apparatus further comprises a congestion prompting module, specifically configured to determine that the traffic request is congested and to send a congestion prompting message in response to the traffic duration being greater than or equal to the sustainable time of the storage unit in the network.
In some embodiments, the service attribute further includes a source node and a destination node, and the entanglement establishment module 705 specifically includes:
a node determining unit configured to determine an intermediate node according to the source node, the sink node and the shortest path in the service attribute;
a number judgment unit configured to judge the number of pre-constructed entangled resources in storage units in the source node, the sink node, and the intermediate node;
an entanglement distribution unit configured to perform entanglement distribution on all storage units included on the shortest path in response to the number of pre-constructed entanglement resources in storage units in the source node, the sink node, and the intermediate node satisfying a first condition that the number of pre-constructed entanglement resources in storage units in the source node and the sink node is not null and the number of pre-constructed entanglement resources in storage units in the intermediate node is greater than a preset threshold;
The first entanglement creating unit is configured to perform entanglement exchange on the storage unit with the entanglement distributed, and create end-to-end entanglement of the service.
In some embodiments, after determining the number of pre-constructed entanglement resources in the storage units in the source node, the sink node, and the intermediate node, the entanglement establishment module 705 specifically further includes:
a time judging unit configured to judge whether the service duration is greater than a remaining duration of the pre-constructed entanglement resources in a unit period in response to the number of pre-constructed entanglement resources in the storage units in the source node, the sink node, and the intermediate node not satisfying a first condition;
a second entanglement creating module configured to create end-to-end entanglement of the service by performing entanglement distribution on all storage units included on the shortest path, entanglement exchange on the storage units whose entanglement distribution is completed, in response to the service duration being greater than a remaining duration of the pre-built entanglement resource in a unit period; or, in response to the service duration being less than or equal to the remaining duration of the pre-constructed entanglement resource within a unit period, performing entanglement exchange on the storage unit, and establishing end-to-end entanglement of the service.
In some embodiments, the time judging unit specifically includes:
the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is empty, and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is larger than a preset threshold; or,
the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is empty, and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is smaller than a preset threshold; or,
the number of pre-constructed entangled resources in storage units in the source node and the sink node is not null and the number of pre-constructed entangled resources in storage units in the intermediate node is less than a preset threshold.
In some embodiments, before receiving the service request in the network, the apparatus specifically further comprises:
the node traversing module is configured to traverse all communication nodes in the network topology to obtain the number of pre-constructed entanglement resources and the sustainable time in a storage unit of each communication node in the network topology.
In some embodiments, after establishing the end-to-end entanglement of the service, the apparatus specifically further comprises:
And the unit releasing module is configured to release the storage units occupied by the service in response to the service leaving, and redistribute entangled photon pairs for the storage units occupied by the service.
For convenience of description, the above devices are described as being functionally divided into various modules, respectively. Of course, the functions of the various modules may be implemented in the same one or more pieces of software and/or hardware when implementing the present disclosure.
The device of the foregoing embodiment is configured to implement the corresponding quantum entanglement distribution method based on the pre-constructed resource in any foregoing embodiment, and has the beneficial effects of the corresponding method embodiment, which is not described herein.
Based on the same inventive concept, the present disclosure also provides an electronic device corresponding to the method of any embodiment, including a memory, a processor, and a computer program stored on the memory and capable of running on the processor, where the processor implements the quantum entanglement distribution method based on the pre-constructed resource according to any embodiment when executing the program.
Fig. 8 shows a more specific hardware architecture of an electronic device according to this embodiment, where the device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 implement communication connections therebetween within the device via a bus 1050.
The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit ), microprocessor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc. for executing relevant programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 1020 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage device, dynamic storage device, or the like. Memory 1020 may store an operating system and other application programs, and when the embodiments of the present specification are implemented in software or firmware, the associated program code is stored in memory 1020 and executed by processor 1010.
The input/output interface 1030 is used to connect with an input/output module for inputting and outputting information. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.
It should be noted that although the above-described device only shows processor 1010, memory 1020, input/output interface 1030, communication interface 1040, and bus 1050, in an implementation, the device may include other components necessary to achieve proper operation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the embodiments of the present description, and not all the components shown in the drawings.
The electronic device of the foregoing embodiment is configured to implement the corresponding quantum entanglement distribution method based on the pre-constructed resource in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which are not described herein.
Based on the same inventive concept, corresponding to any of the above embodiments of the method, the present disclosure further provides a non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the pre-built resource based quantum entanglement distribution method according to any of the above embodiments.
The computer readable media of the present embodiments, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.
The storage medium of the foregoing embodiments stores computer instructions for causing the computer to perform the quantum entanglement distribution method based on the pre-constructed resource according to any of the foregoing embodiments, and has the advantages of the corresponding method embodiments, which are not described herein.
Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the disclosure, including the claims, is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined under the idea of the present disclosure, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present disclosure as described above, which are not provided in details for the sake of brevity.
Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the embodiments of the present disclosure. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the embodiments of the present disclosure, and this also accounts for the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform on which the embodiments of the present disclosure are to be implemented (i.e., such specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.
While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.
The disclosed embodiments are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Accordingly, any omissions, modifications, equivalents, improvements, and the like, which are within the spirit and principles of the embodiments of the disclosure, are intended to be included within the scope of the disclosure.
Claims (10)
1. The quantum entanglement distribution method based on the pre-constructed resource is characterized by comprising the following steps:
receiving a service request in a network, and analyzing the service request to obtain a service attribute of the service request, wherein the service attribute comprises service duration;
determining the shortest path of the service request in a network topology according to the service attribute, wherein the network topology is the topology structure of the network;
judging whether the service duration is smaller than the sustainable time of a storage unit in the network;
Traversing all storage units contained in the shortest path in response to the service duration being less than the sustainable time of the storage units in the network, and obtaining the number of the pre-built entanglement resources stored in each storage unit in the shortest path and the remaining duration of the pre-built entanglement resources in a unit period;
and performing entanglement exchange according to the number of the pre-constructed entanglement resources and the residual duration of the pre-constructed entanglement resources in a unit period, and establishing end-to-end entanglement of the service.
2. The method of claim 1, wherein said determining if said traffic duration is less than a sustainable time of a storage unit in said network further comprises:
and determining that the service request is blocked and sending blocking prompt information in response to the service duration being greater than or equal to the sustainable duration of the storage unit in the network.
3. The method of claim 1, wherein the traffic attributes further comprise a source node and a sink node,
performing entanglement exchange according to the number of the pre-constructed entanglement resources and the remaining duration of the pre-constructed entanglement resources in a unit period, and establishing end-to-end entanglement of the service, including:
Determining an intermediate node according to the source node, the destination node and the shortest path in the service attribute;
judging the number of the pre-constructed entangled resources in the storage units in the source node, the sink node and the intermediate node;
in response to the number of pre-constructed entangled resources in storage units in the source node, the sink node, and the intermediate node satisfying a first condition, performing entanglement distribution on all storage units included on the shortest path, wherein the first condition is that the number of pre-constructed entangled resources in storage units in the source node and the sink node is not null and the number of pre-constructed entangled resources in storage units in the intermediate node is greater than a preset threshold;
and performing entanglement exchange on the storage units with the entanglement distribution completed, and establishing end-to-end entanglement of the service.
4. The method of claim 3, wherein after the determining the number of pre-constructed entangled resources in the storage units in the source-sink node and the intermediate node, further comprising:
in response to the number of pre-constructed entangled resources in storage units in the source node, the sink node, and the intermediate node not meeting a first condition, determining whether the traffic duration is greater than a remaining duration of the pre-constructed entangled resources in a unit period;
In response to the service duration being greater than the remaining duration of the pre-constructed entanglement resources in a unit period, performing entanglement distribution on all storage units contained on the shortest path, performing entanglement exchange on the storage units with the entanglement distribution completed, and establishing end-to-end entanglement of the service; or,
and performing entanglement exchange on the storage unit in response to the service duration being less than or equal to the remaining duration of the pre-constructed entanglement resources in a unit period, and establishing end-to-end entanglement of the service.
5. The method of claim 4, wherein the number of pre-constructed entangled resources in storage units in the source node, the sink node, and the intermediate node does not satisfy a first condition, comprising:
the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is empty, and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is larger than a preset threshold; or,
the number of the pre-constructed entanglement resources in the storage units in the source node and the sink node is empty, and the number of the pre-constructed entanglement resources in the storage units in the intermediate node is smaller than a preset threshold; or,
The number of pre-constructed entangled resources in storage units in the source node and the sink node is not null and the number of pre-constructed entangled resources in storage units in the intermediate node is less than a preset threshold.
6. The method of claim 1, further comprising, prior to receiving the service request in the network:
traversing all communication nodes in the network topology to obtain the number and the sustainable time of the pre-constructed entanglement resources in the storage unit of each communication node in the network topology.
7. The method of claim 1, further comprising, after establishing the end-to-end entanglement of the traffic:
and releasing the storage unit occupied by the service in response to the service leaving, and redistributing entangled photon pairs for the storage unit occupied by the service.
8. A quantum entanglement distribution device based on pre-constructed resources, comprising:
the service analysis module is configured to receive a service request in a network, analyze the service request and obtain a service attribute of the service request, wherein the service attribute comprises service duration;
A path determining module configured to determine a shortest path of the service request in a network topology according to the service attribute, wherein the network topology is a topology structure of the network;
a time determination module configured to determine whether the service duration is less than a sustainable time of a storage unit in the network;
a storage unit traversing module configured to traverse all storage units included in the shortest path in response to the service duration being less than a sustainable time of the storage units in the network, to obtain a number of pre-built entanglement resources stored in each storage unit on the shortest path and a remaining duration of the pre-built entanglement resources within a unit period;
the entanglement building module is configured to perform entanglement exchange according to the quantity of the pre-constructed entanglement resources and the remaining duration of the pre-constructed entanglement resources in a unit period, and build end-to-end entanglement of the service.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the pre-built resource-based quantum entanglement distribution method according to any of claims 1 to 7 when the program is executed.
10. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the pre-built resource-based quantum entanglement distribution method according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310081625.4A CN116405196A (en) | 2023-01-13 | 2023-01-13 | Quantum entanglement distribution method based on pre-constructed resources and related equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310081625.4A CN116405196A (en) | 2023-01-13 | 2023-01-13 | Quantum entanglement distribution method based on pre-constructed resources and related equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116405196A true CN116405196A (en) | 2023-07-07 |
Family
ID=87016710
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310081625.4A Pending CN116405196A (en) | 2023-01-13 | 2023-01-13 | Quantum entanglement distribution method based on pre-constructed resources and related equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116405196A (en) |
-
2023
- 2023-01-13 CN CN202310081625.4A patent/CN116405196A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113760452B (en) | Container scheduling method, system, equipment and storage medium | |
| JP7218447B2 (en) | Policy control method, device and system | |
| CN114268371B (en) | Quantum channel resource allocation method and device and electronic equipment | |
| WO2016161677A1 (en) | Traffic offload method and system | |
| US20150088995A1 (en) | Method and apparatus for sharing contents using information of group change in content oriented network environment | |
| CN115484021A (en) | End-to-end quantum entangled resource routing and distribution method and related equipment | |
| CN113765816B (en) | Flow control method, system, equipment and medium based on service grid | |
| Chehimi et al. | Physics-informed quantum communication networks: A vision toward the quantum internet | |
| WO2024067886A1 (en) | Flexible ethernet-based power communication service resource allocation method and apparatus | |
| Tranoris et al. | Enabling Cyber-Physical Systems for 5G networking: A case study on the Automotive Vertical domain | |
| CN114499834B (en) | Internet of things quantum key distribution method, system, electronic equipment and storage medium | |
| Kamali et al. | Formal analysis of proactive, distributed routing | |
| Quang et al. | Multi-objective multi-constrained QoS Routing in large-scale networks: A genetic algorithm approach | |
| CN113179154B (en) | Resource joint distribution method in quantum key distribution Internet of things and related equipment | |
| CN117914485A (en) | Quantum key distribution network security routing and resource allocation method and related equipment | |
| CN113703996A (en) | Access control method, device and medium based on user and YANG model grouping | |
| CN113535381A (en) | Service function chain mapping method, device and equipment based on improved genetic algorithm | |
| CN116405196A (en) | Quantum entanglement distribution method based on pre-constructed resources and related equipment | |
| Skiadopoulos et al. | Multiple and replicated random walkers analysis for service discovery in fog computing IoT environments | |
| CN116933886A (en) | Quantum computing execution method, quantum computing execution system, electronic equipment and storage medium | |
| Kolar et al. | Adaptive, Continuous Entanglement Generation for Quantum Networks | |
| CN115529125B (en) | Route determining method and related equipment of distributed quantum entanglement distribution network | |
| CN109600431B (en) | Content increment transmission method facing mobile communication network and mobile communication system | |
| CN118487671A (en) | Quantum business transmission method and related equipment | |
| CN116248276A (en) | Quantum entanglement distribution method based on real-time entanglement and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |