CN116248276A - Quantum entanglement distribution method based on real-time entanglement and related equipment - Google Patents

Quantum entanglement distribution method based on real-time entanglement and related equipment Download PDF

Info

Publication number
CN116248276A
CN116248276A CN202310119267.1A CN202310119267A CN116248276A CN 116248276 A CN116248276 A CN 116248276A CN 202310119267 A CN202310119267 A CN 202310119267A CN 116248276 A CN116248276 A CN 116248276A
Authority
CN
China
Prior art keywords
entanglement
quantum
determining
service
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
Application number
CN202310119267.1A
Other languages
Chinese (zh)
Inventor
郁小松
王亚子
赵永利
李亚杰
张会彬
王伟
张�杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN202310119267.1A priority Critical patent/CN116248276A/en
Publication of CN116248276A publication Critical patent/CN116248276A/en
Pending legal-status Critical Current

Links

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
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/70—Photonic quantum communication
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Optics & Photonics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application provides a quantum entanglement distribution method based on real-time entanglement and related equipment, wherein a target storage unit is determined according to the shortest path of a service corresponding to a service request in a quantum communication network topology, and point-to-point entanglement channel construction is realized by utilizing quantum entanglement resources, so that end-to-end entanglement channel establishment is realized. According to the scheme, the quantum entanglement resources are utilized to realize dynamic construction of entanglement channels, so that the quantum communication network is guaranteed to realize efficient quantum entanglement distribution, and finally the purpose of greatly improving the utilization rate of the whole network resources is achieved.

Description

Quantum entanglement distribution method based on real-time entanglement and related equipment
Technical Field
The application relates to the technical field of quantum communication, in particular to a quantum entanglement distribution method based on real-time entanglement and related equipment.
Background
Entangled-based quantum networks are an important component of distributed quantum computing and quantum communication systems. However, in the related art, quantum communication research based on quantum entanglement is mostly aimed at between two communication parties, and a quantum communication network based on quantum entanglement with multiple parties cannot be ensured.
Disclosure of Invention
In view of the foregoing, it is an object of the present application to provide a quantum entanglement distribution method based on real-time entanglement and related devices, so as to solve or partially solve the above-mentioned problems.
In a first aspect of the present application, a quantum entanglement distribution method based on real-time entanglement is provided, and is applied to a quantum communication network, where the quantum communication network includes a plurality of quantum communication nodes, and each quantum communication node is provided with a plurality of storage units;
the method comprises the following steps:
receiving a service request;
determining a shortest path corresponding to the service request in a quantum communication network topology;
in response to determining that the shortest path meets a preset condition, determining a plurality of unoccupied storage units in the shortest path as a plurality of target storage units;
respectively carrying out entanglement distribution on the plurality of target storage units, and respectively constructing point-to-point entanglement channels to obtain a plurality of first entanglement channels;
performing hop-by-hop entanglement exchange on the plurality of first entanglement channels until a target entanglement channel is constructed; wherein the target entanglement channel characterizes an end-to-end entanglement channel.
Optionally, the determining the shortest path corresponding to the service request in the quantum communication network topology includes:
analyzing the service request to obtain a service source node and a service sink node;
and calculating the shortest path corresponding to the quantum communication network topology according to the service source node and the service sink node.
Optionally, the meeting the preset condition includes:
in response to determining that the update period of the storage unit is greater than or equal to the duration of the service corresponding to the service request, and determining that the number of unoccupied storage units in the service source node is greater than or equal to one, and determining that the number of unoccupied storage units in the service sink node is greater than or equal to one, and determining that the number of unoccupied storage units in each intermediate node is greater than or equal to two, determining that a preset condition is satisfied; wherein the intermediate node is a quantum communication node in the shortest path.
Optionally, the method further comprises:
determining a secondary path corresponding to the service request in a quantum communication network topology in response to determining that the shortest path does not meet a preset condition;
and judging the preset condition of the secondary short path.
Optionally, the method further comprises:
performing time segmentation on the storage unit based on a preset time slot resource; wherein, the time slot resource is consistent with the duration of the service corresponding to the service request.
Optionally, the method further comprises:
and releasing the target storage units in response to determining that the current service leaves.
In a second aspect of the present application, a quantum entanglement distribution device based on real-time entanglement is provided, and is applied to a quantum communication network, where the quantum communication network includes a plurality of quantum communication nodes, and each quantum communication node is provided with a plurality of storage units;
the device comprises:
a receiving module configured to: receiving a service request;
a first determination module configured to: determining a shortest path corresponding to the service request in a quantum communication network topology;
a second determination module configured to: in response to determining that the shortest path meets a preset condition, determining a plurality of unoccupied storage units in the shortest path as a plurality of target storage units;
a first build module configured to: respectively carrying out entanglement distribution on the plurality of target storage units, and respectively constructing point-to-point entanglement channels to obtain a plurality of first entanglement channels;
a second build module configured to: performing hop-by-hop entanglement exchange on the plurality of first entanglement channels until a target entanglement channel is constructed; wherein the target entanglement channel characterizes an end-to-end entanglement channel.
In a third aspect of the present application, there is provided an electronic device comprising a memory, a processor and a computer program stored on the memory and executable by the processor, characterized in that the processor implements the method according to the first aspect when executing the computer program.
In a fourth aspect of the present application, there is provided a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method according to the first aspect.
From the above, it can be seen that the quantum entanglement distribution method and related device based on real-time entanglement provided by the present application determine the target storage unit according to the shortest path of the service corresponding to the service request in the quantum communication network topology, and implement the point-to-point entanglement channel construction by using the quantum entanglement resource, thereby implementing the end-to-end entanglement channel establishment. According to the scheme, the quantum entanglement resources are utilized to realize dynamic construction of entanglement channels, so that the quantum communication network is guaranteed to realize efficient quantum entanglement distribution, and finally the purpose of greatly improving the utilization rate of the whole network resources is achieved.
Drawings
In order to more clearly illustrate the technical solutions of the present application or related art, the drawings that are required to be used in the description of the embodiments or related art will be briefly described below, and it is apparent that the drawings in the following description are only embodiments of the present application, 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 quantum entanglement distribution method based on real-time entanglement according to an embodiment of the present application;
FIG. 2 is a schematic diagram of an exemplary end-to-end centralized quantum entanglement distribution system according to embodiments of the present application;
FIG. 3 is a schematic diagram of an exemplary quantum relay scheme of an embodiment of the present application;
FIG. 4 is a schematic diagram illustrating time slicing of memory cells according to an embodiment of the present application;
FIG. 5 is a schematic diagram of an exemplary quantum communication network topology according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a quantum entanglement distribution device based on real-time entanglement according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the present application more apparent, the following detailed description of the embodiments of the present application is given with reference to the accompanying drawings.
It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present application should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present application belongs. The terms "first," "second," and the like, as used in embodiments of the present application, 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.
Quantum communication uses quantum state as information carrier, and uses some quantum characteristics to ensure the security of its cipher protocol. Among the two quantum properties that are often used are quantum entanglement and quantum coherence. Quantum entanglement and quantum coherence are important components of quantum communications. The method and the device are widely applied to the design and analysis of cryptographic protocols such as quantum key distribution, quantum signature, quantum multiparty security computation and the like. Quantum entanglement has evolved from a theoretical concept since the last 80 years to the completion of work that is not possible in many classical systems today applied in various practical scenarios. In quantum communication, the entangled state can break the limitation of the traditional communication due to the magic entangled property, so that the safe long-distance communication can be performed, wherein the two key technologies comprise quantum invisible state transmission and quantum key distribution.
With the rapid development of quantum technology, qualitative analysis of quantum entanglement has far failed to meet the needs of these studies. Therefore, it is desired to systematically study such quantum characteristics from the viewpoint of resources, and quantum entanglement resource theory has been proposed. The quantum resource theory provides a powerful technical tool for researching different phenomena in quantum physics. In order to build a unified and strict physical resource quantitative theory framework, the quantum entanglement resource theory has three core problems: (one) characterization of resources; (II) quantification of resources; and (III) operating the resource under the limiting condition.
Entangled-based quantum networks are an important component of distributed quantum computing and quantum communication systems. The quantum network works in a similar way to a classical network, and a quantum processor is used at the terminal node to send, receive and process information. The channels of communication may consist of fiber optic networks or free space networks. However, in practical applications, the loss of photons in the channel is a great challenge to achieve long-distance and large-scale quantum networks. Even the use of an exponential loss of 0.14dB/km for the currently lowest loss communications band fiber limits the direct transmission of single photons carrying quantum information in the channel, severely limiting the rate of communications over the scale of hundreds of kilometers. The above-described problems can be solved by a long-distance quantum communication scheme based on entanglement, i.e., a quantum relay scheme.
However, in the related art, quantum communication research based on quantum entanglement is mostly aimed at between two communication parties, and a quantum communication network based on quantum entanglement with multiple parties cannot be ensured.
In view of this, the embodiment of the application provides a quantum entanglement distribution method based on real-time entanglement and related equipment. And determining a target storage unit according to the shortest path of the service corresponding to the service request in the quantum communication network topology, and constructing a point-to-point entanglement channel by utilizing the quantum entanglement resource, thereby realizing the establishment of the end-to-end entanglement channel. According to the scheme, the quantum entanglement resources are utilized to realize dynamic construction of entanglement channels, so that the quantum communication network is guaranteed to realize efficient quantum entanglement distribution, and finally the purpose of greatly improving the utilization rate of the whole network resources is achieved.
It should be noted that, the quantum entanglement distribution method based on real-time entanglement and the related device according to the embodiments of the present application may be applied to a quantum communication network, where the quantum communication network includes a plurality of quantum communication nodes, each of the quantum communication nodes is provided with a quantum memory, and the quantum memory includes a plurality of storage units. Specifically, each communication node has only one quantum memory, and the quantum memory has a plurality of storage units. There may be up to 225 individually accessible memory cells in a quantum memory.
In the present embodiment, there is a multiplexed quantum memory having many memory cells in a quantum communication network. Wherein each memory cell can be accessed individually, in separate physical locations of the cell.
In particular, an optical quantum memory is a device capable of reversibly mapping quantum information in an optical field to a quantum state of a substance system, and reading the stored quantum information as needed. The coherence protection of quantum states in a matter system has been a major challenge in quantum information science. The natural coherence life of most quantum systems is below the millisecond level, and decoherence occurs very easily due to environmental interference, which makes the construction of scalable quantum computers and large-scale quantum networks very challenging.
In quantum relay schemes, the storage time of a quantum memory is directly related to the communication distance, as its lifetime generally exceeds the total time consumption required to establish entanglement between the two communication nodes at the far end. For quantum computing to achieve a practical quantum computer, the coherence lifetime of a qubit must exceed the total time required to initialize, control, and measure the bit. Distributed quantum computing networks are beneficial to improving the scalability of quantum computing, and communication between computing nodes also places additional demands on the lifetime of the qubits. Furthermore, in order to transmit static qubits, the static qubits must be changed into "fly" bits, i.e. photons. Long-lived qubits with optically addressable capabilities are therefore important for achieving scalable quantum computing. Heretofore, the longest lifetime quantum memory has only a storage time on the order of seconds; the longest lifetime of optical storage has a storage time of the order of minutes only.
In the embodiment of the application, the execution subject of the quantum entanglement distribution method based on real-time entanglement may be a quantum device in a quantum communication network, for example, a quantum processor. It is understood that a quantum processor may perform transmission, reception, processing, etc. of information.
Fig. 1 shows a flow diagram of a quantum entanglement distribution method 100 based on real-time entanglement according to an embodiment of the application. As shown in fig. 1, the method 100 may include the following steps.
Step S101, receiving a service request.
It should be noted that, several service requests in this embodiment arrive dynamically, that is, the arriving characteristics of these service requests conform to poisson distribution. Thus, when the service request arrives, the service request is received to obtain the service corresponding to the service request and the attribute thereof.
Step S102, determining the shortest path corresponding to the service request in the quantum communication network topology.
In this embodiment, the service request is parsed to obtain a service source node and a service sink node; and calculating the shortest path corresponding to the quantum communication network topology according to the service source node and the service sink node.
In some embodiments, after parsing to obtain the service source node and the service sink node, the communication nodes and links in the current network topology are calculated to obtain a plurality of paths between the service source node and the service sink node, and the hop count of each path is recorded. It is understood that the path with the smallest number of hops is determined as the shortest path.
Further, in some embodiments, after determining the corresponding shortest path of the service request in the quantum communication network topology, the shortest path and corresponding ones of the intermediate nodes (i.e., the quantum communication nodes in the shortest path) are stored.
In some alternative embodiments, the service request may be further parsed, so as to obtain other more specific attributes of the service corresponding to the service request. Such as a service start time, a service duration, a service end time, etc.
And step S103, determining a plurality of unoccupied storage units in the shortest path as a plurality of target storage units in response to determining that the shortest path meets a preset condition.
In this embodiment, in response to determining that the update period of the storage unit is greater than or equal to the duration of the service corresponding to the service request, and determining that the number of unoccupied storage units in the service source node is greater than or equal to one, and determining that the number of unoccupied storage units in the service sink node is greater than or equal to one, and determining that the number of unoccupied storage units in each intermediate node is greater than or equal to two, it is determined that a preset condition is satisfied; wherein the intermediate node is a quantum communication node in the shortest path.
In particular, quantum memory storage time is typically limited by the coherence time of the storage medium employed, some memories can store photons for several minutes, and some memories can store a single photon for more than 1 hour under certain conditions. Furthermore, the maximum storage duration (i.e., the update period) is an important benchmark for memory in an actual communication platform. The storage time is directly related to the communication distance, since its duration needs to exceed the total time required to establish entanglement between two remote communication nodes. In a multi-hop entanglement exchange process, all nodes on a path need to establish and maintain quantum entanglement with their predecessor and successor nodes in a limited time.
The limiting time refers to a duration of one quantum request. Therefore, the degree of time synchronization between all nodes is necessary.
In some embodiments, the update period of the storage unit in the equivalent sub-communication network is smaller than the service duration obtained by analyzing the service request, and it is determined that the service request is blocked due to the entanglement channel construction failure. Thus, the current service fails.
In some embodiments, the update period of the storage units in the quantum communication network is greater than or equal to the service duration obtained by parsing the service request, and further condition determination is made on the state of the storage units in each quantum memory in the shortest path (i.e. whether they are already occupied by other services).
It should be appreciated that multiple services may be included in a quantum communication network. Specifically, other services than the service in the embodiment of the present application may be other services that are received earlier than the current service in the dynamically arrived services, which is not specifically limited in the embodiment. In this way, the storage unit may already be occupied by other services and cannot be the target storage unit of the present embodiment, and therefore, it is necessary to determine and determine a storage unit that meets the condition as the target storage unit for the subsequent construction of the entanglement channel.
In some alternative embodiments, since there is one and only one quantum memory in each communication node, there are several memory units in the quantum memory, and each memory unit is individually accessible, so that the number of memory units in the quantum memory that are free (not occupied by other traffic) reaches a certain requirement, the condition can be satisfied. Specifically, the number of unoccupied storage units in the quantum memory of the service source node is greater than or equal to one, the number of unoccupied storage units in the quantum memory of the service sink node is greater than or equal to one, and the number of unoccupied storage units in the quantum memory of each intermediate node is greater than or equal to two.
In some alternative embodiments, the states of the memory cells in each quantum memory in the shortest path are traversed, recorded, and stored. In particular, the storage units already occupied by other services may be recorded.
For example, the total cases where the storage unit in the source/sink node is occupied by other traffic are:
NQ s,d ＝{NQ s ,Q d }；
wherein the occupied storage unit in the source node is NQ s ＝{NQ s1 ,Q s2 ,...Q si Occupied storage unit in the host node is NQ d ＝{NQ d1 ,Q d2 ,...Q dj }；
The storage unit in each intermediate node between the source and the destination nodes is occupied by other services:
NQ r ＝{NQ r1 ,Q r2 ,...Q rk }。
in addition, in another embodiment, in response to determining that the shortest path does not meet a preset condition, determining a corresponding secondary short path of the service request in a quantum communication network topology; and judging the preset condition of the secondary short path. Specifically, traversing the states (occupied by other services) of storage units in each quantum memory in the short path, and recording and storing; and determining unoccupied memory cells in the path as target memory cells in response to determining that the idle number of the memory cells in the short path meets a preset condition.
Step S104, entanglement distribution is carried out on the target storage units respectively, point-to-point entanglement channel construction is carried out respectively, and a plurality of first entanglement channels are obtained.
In this embodiment, the number of idles of the storage units of the quantum memory in the source/sink node is N s ，N d The free number of the storage units of the quantum memory in any intermediate node is N r For example, when N s , d Not less than 1 and N r And when the number is more than or equal to 2, determining the idle storage units as target storage units, and respectively carrying out real-time entanglement distribution.
Referring to fig. 2, an exemplary end-to-end centralized quantum entanglement distribution system is illustrated. As shown in fig. 2, the end-to-end centralized quantum entanglement distribution system utilizes three types of channels for communication between the quantum transmitter Alice and the quantum receiver Bob, namely, a quantum channel (QCh), a classical channel (CCh) and an entanglement channel (ECh). Wherein the quantum channel QCh is for entangled photon distribution; classical channel CCh is used to send bell state measurements; entangled channel ECh is created from entangled photon pairs, completing the invisible state transfer.
Further, in some embodiments, for each target storage unit, entanglement is established with another adjacent target storage unit to obtain a first entanglement channel, thereby obtaining a plurality of first entanglement channels. It is understood that these first entanglement channels are point-to-point entanglement channels.
Step S105, performing hop-by-hop entanglement exchange on the plurality of first entanglement channels until a target entanglement channel is constructed; wherein the target entanglement channel characterizes an end-to-end entanglement channel.
In this embodiment, for each first entanglement channel, entanglement exchange is performed with another adjacent first entanglement channel, and then two adjacent channels (channels obtained by entanglement exchange between two first entanglement channels) are connected step by step through entanglement exchange operation until entanglement is established at both ends, that is, a target entanglement channel between a service source node and a service sink node is obtained. It will be appreciated that the target entanglement channel is an end-to-end entanglement channel.
Thus, a target entanglement channel is constructed by utilizing a quantum relay scheme, so that end-to-end entanglement of both communication parties of the current service is established. In particular, the quantum relay scheme may divide a communication channel into a plurality of shorter-distance basic links, and relay stations are used to connect between the basic links. Entanglement is established between quantum memories of two adjacent relay stations through basic links, then the two adjacent basic links are connected step by step through entanglement exchange operation, and finally entanglement is established at two ends of the farthest channel. This entangled allocation approach will effectively overcome losses in the channel, providing much better scalability than the direct transmission scheme.
It should be noted that the quantum memory involved in the quantum relay scheme needs to be able to store entanglement in the link until entanglement is also established on an adjacent link, and then cannot perform the next entanglement exchange operation. If there is no efficient quantum memory, entanglement in all links must be established at the same time, which greatly increases the difficulty of long-distance entanglement distribution. The quantum memory avoids damage caused by measuring the quantum state, skillfully bypasses the uncertain principle, and plays a vital synchronization role in a quantum relay scheme.
Referring to fig. 3, a schematic diagram of an exemplary quantum relay scheme is shown. As shown in fig. 3, to establish long-distance entanglement between quantum memories (Quantum Memory QM) a and Z, entanglement is first independently generated in short elementary links (e.g., a and B, C and D, …, W and X, Y and Z); entanglement exchanges are then performed between adjacent links, extending short-range entanglement over longer links (e.g., a and D, W and Z); until entanglement is distributed between a and Z.
Further, in some embodiments, the number of target storage units is released in response to determining that current traffic is leaving. In this way, these target storage units are restored as free (i.e., unoccupied by any task) storage units for other ones of the dynamically arriving traffic that are received later than the current traffic. Therefore, the real-time updating of the storage unit in the quantum memory under the entanglement resource scene and the real-time dynamic construction of the entanglement channel are realized.
Furthermore, in some alternative embodiments, the memory unit is time-sliced based on a predetermined time slot resource; wherein, the time slot resource is consistent with the duration of the service corresponding to the service request.
Referring to fig. 4, a schematic diagram of time slicing a memory cell is illustrated. As shown in fig. 4, the storage unit for constructing ECh (entanglement channel) is divided into units of a fixed-size time slot, and the time slot resource is the resource required for ECh construction, and in this time slot, generation of entangled photon pairs, distribution of entangled resources, construction of ECh, and the like can be completed. Wherein the update period of each memory cell is a fixed time T, and the duration of each service is consistent with the duration of ECh in the corresponding memory cell. As can be seen from fig. 5, the duration of the data traffic 1 is T4-T1, and the duration of ECh in the corresponding memory cell 1 is also T4-T1, and the update period of the memory cell 1 is T5-t1=t, i.e., the memory cell 1 remains idle for the period T5-T4 when the data traffic 1 leaves.
Therefore, fixed time slot resources are allocated for each entanglement channel, so that time division is carried out on storage units for storing entanglement resources in the quantum network, entanglement end-to-end entanglement establishment between two communication parties based on entanglement can be guaranteed to be completed in time slots with fixed sizes, waste of entanglement resources in the network can be reduced, and utilization efficiency of each storage unit in the quantum memory is improved.
Fig. 5 shows a schematic diagram of an exemplary quantum communication network topology. As shown in fig. 5, the quantum communication network includes 25 nodes and 56 links. Specifically, the device comprises 21 quantum communication nodes, 4 Entanglement Preparation Sources (EPS), 32 classical channels and 24 quantum channels. Wherein nodes and links within a circle represented by dashed lines may be considered as a subset.
Taking the quantum communication network topology in fig. 5 asFor example, the received service request is parsed to obtain a service source Node Q-Node1 and a service sink Node Q-Node 21, the service start time is 10s, the service duration is 30s, and the service end time is 40s; according to the service source Node Q-Node1 and the service destination Node Q-Node 21, the shortest path corresponding to the service request in the quantum communication network topology can be determined as P by calculation 1-11-21 (hop count=2).
Further, due to the shortest path P 1-11-21 The update period (t=1min) of the memory cells of (c) is greater than the traffic duration (T r =30), and the number N of idleness of memory cells of the quantum memory in the traffic source Node Q-Node1 s 1 or more, and the free number N of the storage units of the quantum memory in the service destination Node Q-Node 21 d 1 or more, and the number N of idleness of memory cells of the quantum memory in the intermediate Node Q-Node11 r Not less than 2, the shortest path P 1-11-21 The preset condition is satisfied.
In the process of judging the preset condition, recording which of the storage units occupied by other services in the source and destination nodes Q-Node1 and Q-Node 21 are respectively NQ s ＝{NQ s1 ,Q s2 ,...Q si }，NQ d ＝{NQ d1 ,Q d2 ,...q dj Total situation where storage units in source-sink nodes are occupied by other traffic is NQ s,d ＝{NQ s ,Q d Recording which of the storage units occupied by other services in the intermediate Node Q-Node11 are respectively NQ r ＝{NQ r1 ,Q r1 ,...Q rk }. In this way, the names of the free memory locations may be obtained to determine the unoccupied memory locations in the path as target memory locations (e.g., CM 1-i ，CM 21-j ，CM 11-k1 ，CM 11-k2 )。
Further, for these target memory cells (CM 1-i ，CM 21-j ，CM 11-k1 ，CM 11-k2 ) Respectively carrying out real-time entanglement distribution and respectively constructing point-to-point entanglement channels to obtainA number of first entanglement channels (e.g. ECh p ＝{ECh 1-11 ,Ch 11-21 }. ) The method comprises the steps of carrying out a first treatment on the surface of the These first entanglement channels are then hop-by-hop entangled exchanged until a target entanglement channel is constructed, i.e., communication nodes Q-Node1 and Q-Node 21 end-to-end entanglement channel ECh 1-21 。
It should be noted that some embodiments of the present application are described above. 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 technical concept, the application also provides a quantum entanglement distribution device 600 based on real-time entanglement, corresponding to the method of any embodiment. In particular, the quantum entanglement distribution device 600 based on real-time entanglement can be applied to a quantum communication network including a plurality of quantum communication nodes, each of which is provided with a plurality of storage units.
Referring to fig. 6, the quantum entanglement distribution device 600 based on real-time entanglement includes:
a receiving module 601 configured to: receiving a service request;
a first determination module 602 configured to: determining a shortest path corresponding to the service request in a quantum communication network topology;
a second determination module 603 configured to: in response to determining that the shortest path meets a preset condition, determining a plurality of unoccupied storage units in the shortest path as a plurality of target storage units;
a first build module 604 configured to: respectively carrying out entanglement distribution on the plurality of target storage units, and respectively constructing point-to-point entanglement channels to obtain a plurality of first entanglement channels;
a second building block 605 configured to: performing hop-by-hop entanglement exchange on the plurality of first entanglement channels until a target entanglement channel is constructed; wherein the target entanglement channel characterizes an end-to-end entanglement channel.
In some alternative embodiments, the first determining module 602 is specifically configured to: analyzing the service request to obtain a service source node and a service sink node; and calculating the shortest path corresponding to the quantum communication network topology according to the service source node and the service sink node.
In some alternative embodiments, the second determining module 603 is specifically configured to: in response to determining that the update period of the storage unit is greater than or equal to the duration of the service corresponding to the service request, and determining that the number of unoccupied storage units in the service source node is greater than or equal to one, and determining that the number of unoccupied storage units in the service sink node is greater than or equal to one, and determining that the number of unoccupied storage units in each intermediate node is greater than or equal to two, determining that a preset condition is satisfied; wherein the intermediate node is a quantum communication node in the shortest path.
In some alternative embodiments, the real-time entanglement-based quantum entanglement distribution device 600 may further comprise a third determination module and a release module (not shown in fig. 6).
Specifically, the third determining module is configured to: determining a secondary path corresponding to the service request in a quantum communication network topology in response to determining that the shortest path does not meet a preset condition; and judging the preset condition of the secondary short path.
A release module configured to: and releasing the target storage units in response to determining that the current service leaves.
For convenience of description, the above devices are described as being functionally divided into various modules, respectively. Of course, the functions of each module may be implemented in the same piece or pieces of software and/or hardware when implementing the present application.
The device of the foregoing embodiment is configured to implement the corresponding quantum entanglement distribution method based on real-time entanglement 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 technical concept, the application also provides an electronic device corresponding to the method of any embodiment, which comprises a memory, a processor and a computer program stored on the memory and executable by the processor, wherein the processor realizes the quantum entanglement distribution method based on real-time entanglement according to any embodiment when executing the computer program.
Fig. 7 is a schematic diagram of a hardware structure of an electronic device according to the 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.
Communication interface 1040 is used to connect communication modules (not shown) to enable communication interactions of the present device with other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).
Bus 1050 includes a path for transferring information between components of the device (e.g., processor 1010, memory 1020, input/output interface 1030, and communication interface 1040).
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 real-time entanglement 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 technical concept, corresponding to the method of any embodiment, the application further provides a non-transitory computer readable storage medium, wherein the non-transitory computer readable storage medium stores computer instructions for causing a computer to execute the quantum entanglement distribution method based on real-time entanglement as described in any embodiment.
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 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 above embodiment stores computer instructions for causing the computer to perform the quantum entanglement distribution method based on real-time entanglement as described in any of the above 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 application (including the claims) is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined within the idea of the present application, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present application as described above, which are not provided in detail 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 application. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the embodiments of the present application, and this also takes into account 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 application 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 application, it should be apparent to one skilled in the art that embodiments of the application 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 application 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 present 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/or the like which are within the spirit and principles of the embodiments are intended to be included within the scope of the present application.

Claims (9)

1. The quantum entanglement distribution method based on real-time entanglement is characterized by being applied to a quantum communication network, wherein the quantum communication network comprises a plurality of quantum communication nodes, and each quantum communication node is provided with a plurality of storage units;
the method comprises the following steps:
receiving a service request;
determining a shortest path corresponding to the service request in a quantum communication network topology;
in response to determining that the shortest path meets a preset condition, determining a plurality of unoccupied storage units in the shortest path as a plurality of target storage units;
respectively carrying out entanglement distribution on the plurality of target storage units, and respectively constructing point-to-point entanglement channels to obtain a plurality of first entanglement channels;
performing hop-by-hop entanglement exchange on the plurality of first entanglement channels until a target entanglement channel is constructed; wherein the target entanglement channel characterizes an end-to-end entanglement channel.
2. The method of claim 1, wherein the determining the corresponding shortest path for the service request in the quantum communication network topology comprises:
analyzing the service request to obtain a service source node and a service sink node;
and calculating the shortest path corresponding to the quantum communication network topology according to the service source node and the service sink node.
3. The method according to claim 2, wherein the meeting of the preset condition comprises:
in response to determining that the update period of the storage unit is greater than or equal to the duration of the service corresponding to the service request, and determining that the number of unoccupied storage units in the service source node is greater than or equal to one, and determining that the number of unoccupied storage units in the service sink node is greater than or equal to one, and determining that the number of unoccupied storage units in each intermediate node is greater than or equal to two, determining that a preset condition is satisfied; wherein the intermediate node is a quantum communication node in the shortest path.
4. The method according to claim 1, wherein the method further comprises:
determining a secondary path corresponding to the service request in a quantum communication network topology in response to determining that the shortest path does not meet a preset condition;
and judging the preset condition of the secondary short path.
5. A method according to claim 3, characterized in that the method further comprises:
performing time segmentation on the storage unit based on a preset time slot resource; wherein, the time slot resource is consistent with the duration of the service corresponding to the service request.
6. The method according to claim 1, wherein the method further comprises:
and releasing the target storage units in response to determining that the current service leaves.
7. The quantum entanglement distribution device based on real-time entanglement is characterized by being applied to a quantum communication network, wherein the quantum communication network comprises a plurality of quantum communication nodes, and each quantum communication node is provided with a plurality of storage units;
the device comprises:
a receiving module configured to: receiving a service request;
a first determination module configured to: determining a shortest path corresponding to the service request in a quantum communication network topology;
a second determination module configured to: in response to determining that the shortest path meets a preset condition, determining a plurality of unoccupied storage units in the shortest path as a plurality of target storage units;
a first build module configured to: respectively carrying out entanglement distribution on the plurality of target storage units, and respectively constructing point-to-point entanglement channels to obtain a plurality of first entanglement channels;
a second build module configured to: performing hop-by-hop entanglement exchange on the plurality of first entanglement channels until a target entanglement channel is constructed; wherein the target entanglement channel characterizes an end-to-end entanglement channel.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable by the processor, wherein the processor implements the method of any one of claims 1 to 6 when the computer program is executed.
9. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 6.
CN202310119267.1A 2023-02-01 2023-02-01 Quantum entanglement distribution method based on real-time entanglement and related equipment Pending CN116248276A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310119267.1A CN116248276A (en) 2023-02-01 2023-02-01 Quantum entanglement distribution method based on real-time entanglement and related equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310119267.1A CN116248276A (en) 2023-02-01 2023-02-01 Quantum entanglement distribution method based on real-time entanglement and related equipment

Publications (1)

Publication Number Publication Date
CN116248276A true CN116248276A (en) 2023-06-09

Family

ID=86634518

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310119267.1A Pending CN116248276A (en) 2023-02-01 2023-02-01 Quantum entanglement distribution method based on real-time entanglement and related equipment

Country Status (1)

Country Link
CN (1) CN116248276A (en)

Similar Documents

Publication Publication Date Title
Shi et al. Concurrent entanglement routing for quantum networks: Model and designs
Foerster et al. Characterizing the algorithmic complexity of reconfigurable data center architectures
CN111565113B (en) Flexible Ethernet network topology abstraction method and system for SDN controller
WO2019196921A1 (en) Quantum key distribution method, device and storage medium
CN112910639B (en) Quantum encryption service transmission method under multi-domain scene and related equipment
CN102739518A (en) Flow load sharing method and equipment
CN114268371B (en) Quantum channel resource allocation method and device and electronic equipment
JP2014103514A (en) Communication device, communication system and program
CN115277429B (en) Power communication service resource allocation method and device based on flexible Ethernet
Zhang et al. Fragmentation-aware entanglement routing for quantum networks
Chen et al. SimQN: A network-layer simulator for the quantum network investigation
Wang et al. Pre-established entanglement distribution algorithm in quantum networks
Zhu et al. Resource allocation in quantum-key-distribution-secured datacenter networks with cloud–edge collaboration
Rikos et al. Non-oscillating quantized average consensus over dynamic directed topologies
Aparicio et al. Multiplexing schemes for quantum repeater networks
CN116248276A (en) Quantum entanglement distribution method based on real-time entanglement and related equipment
CN114499834A (en) Internet of things quantum key distribution method and system, electronic equipment and storage medium
JP2014241463A (en) Communication device, communication method, program and communication system
Liu et al. Joint jobs scheduling and routing for metro-scaled micro datacenters over elastic optical networks
Kaewpuang et al. Entangled Pair Resource Allocation under Uncertain Fidelity Requirements
CN116405196A (en) Quantum entanglement distribution method based on pre-constructed resources and related equipment
Zeng et al. Entanglement Routing over Quantum Networks Using Greenberger-Horne-Zeilinger Measurements
US20170331716A1 (en) Active probing for troubleshooting links and devices
JP6206105B2 (en) Communication system, communication method, and communication program
Yu et al. Dynamic virtual network embedding algorithm based on multi-path virtual concatenation in elastic optical network

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