CN113890627A - Quantum cooperation multicast method based on hybrid topological structure - Google Patents
Quantum cooperation multicast method based on hybrid topological structure Download PDFInfo
- Publication number
- CN113890627A CN113890627A CN202111136166.2A CN202111136166A CN113890627A CN 113890627 A CN113890627 A CN 113890627A CN 202111136166 A CN202111136166 A CN 202111136166A CN 113890627 A CN113890627 A CN 113890627A
- Authority
- CN
- China
- Prior art keywords
- node
- quantum
- ring network
- central ring
- information
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 239000002245 particle Substances 0.000 claims abstract description 56
- 238000004220 aggregation Methods 0.000 claims abstract description 52
- 230000002776 aggregation Effects 0.000 claims abstract description 51
- 230000002093 peripheral effect Effects 0.000 claims abstract description 42
- 238000005259 measurement Methods 0.000 claims description 42
- 230000009466 transformation Effects 0.000 claims description 10
- 239000004576 sand Substances 0.000 claims description 4
- 239000011159 matrix material Substances 0.000 claims description 3
- 239000002096 quantum dot Substances 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 17
- 230000005540 biological transmission Effects 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 5
- 238000010367 cloning Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 238000000844 transformation Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000006116 polymerization reaction Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012411 cloning technique Methods 0.000 description 1
- XOFYZVNMUHMLCC-ZPOLXVRWSA-N prednisone Chemical compound O=C1C=C[C@]2(C)[C@H]3C(=O)C[C@](C)([C@@](CC4)(O)C(=O)CO)[C@@H]4[C@@H]3CCC2=C1 XOFYZVNMUHMLCC-ZPOLXVRWSA-N 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
Images
Classifications
-
- 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
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
-
- 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
-
- 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)
- Optics & Photonics (AREA)
- Electromagnetism (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a quantum cooperation multicast method based on a mixed topological structure, which comprises the following four steps: step 1: constructing a ring-star mixed topological structure, preparing two particle entangled states (EPR pairs) as quantum resources, and pre-sharing between any adjacent nodes in a central ring network; step 2: the peripheral star network sends an information aggregation request to a central node in a central ring network, and the central ring network determines the central node as a sink node according to the source of the information aggregation request; and step 3: the sink node collects the aggregation information of all nodes of the central ring network; and 4, step 4: the central ring network requires all the nodes of the central ring network to repeat a plurality of rounds of information aggregation processes until the number of the aggregated information reaches the target requirement according to the requirement of the peripheral star network, and multicast-sends the aggregated information to the peripheral star network. The invention designs a high-efficiency and practical quantum cooperative multicast method aiming at a mixed topological structure by combining quantum network communication.
Description
Technical Field
The invention relates to a quantum cooperation multicast method based on a hybrid topological structure, and belongs to the technical field of quantum network communication.
Background
Quantum communication is an emerging discipline in quantum information science. At present, point-to-point quantum communication is becoming mature and is becoming more and more practical. With the continuous expansion of communication scale, quantum communication is gradually developing from point-to-point two-way communication to multi-user and networking. How to effectively transmit information among multiple users is the key of large-scale networking of quantum communication, so that realizing multicast communication among multiple users in a quantum network will inevitably become a new development trend in the field of quantum network communication.
The quantum multicast problem, the most major obstacle to its implementation, is the quantum unclonable theorem. Since the theorem prohibits the accurate replication of any unknown quantum state, in the quantum theory, multicast in a true sense cannot be realized, that is, a sender cannot replicate information sent by the sender, thereby achieving the purpose of simultaneously communicating with a plurality of receivers. Early related literature relied on approximate cloning techniques to allow quantum states to be cloned multiple times and then transmitted to multiple recipients. However, the fidelity of the quantum state after the approximate cloning is lost to a certain extent, if the cloned quantum state is used as a sample for carrying out multiple iterations of the approximate cloning, the error of the fidelity between the quantum state finally transmitted to the receiver and the initial quantum state is circularly amplified, and the received information is distorted. On the one hand, since the multicast technology employs that a plurality of senders must send quantum states to a plurality of receivers simultaneously, the requirement of storage capacity of each internal node is too high. On the other hand, the existing multicast network topology, such as the butterfly network, has a bottleneck problem that may restrict the selection of the transmission path, resulting in that the network transmission needs a higher channel transmission capacity to alleviate the bottleneck problem. Therefore, the quantum unclonable theorem is not directly applicable to quantum multicast networks.
The quantum cooperative multicast proposal can better solve the problems. In 2015, Xu et al introduced reasonable definition of quantum cooperative multicast for the first time, and proposed a multi-party quantum cooperative multicast scheme in a butterfly network. According to the scheme, the invisible transmission technology is combined, quantum information is backed up by two source nodes in a cooperative mode, and fidelity distortion caused by adopting approximate cloning is avoided. And the network coding technology is adopted at the intermediate node, original 8-bit classical information is coded into 1-bit classical information, and then the 1-bit classical information is transmitted to two receivers through a bottleneck channel, so that the problem of the transmission capacity of the bottleneck channel is effectively solved.
At present, quantum cooperative multicast research is still in the beginning stage, and most researchers consider the coding problem in the butterfly network. Although the butterfly network can be represented as a topology with bottleneck problems, it does not cover all possible network types. In the face of more complex topologies, it is still unknown whether quantum cooperative multicast is feasible.
On the basis of relevant research, the quantum cooperative multicast method is expanded from the existing butterfly network structure to be applied to a hybrid topology structure. All nodes of the central ring network cooperate together to aggregate information to the sink node, and then the aggregated information is sent to the peripheral star network in a quantum multicast mode, so that quantum cooperative multicast based on the hybrid topological structure is realized.
Disclosure of Invention
The technical problem solved by the invention is as follows: the method breaks through the limitation that the existing quantum cooperative multicast method is only suitable for a butterfly network structure, and designs the quantum cooperative multicast method supporting the mixed topological structure. The technical scheme of the invention is that quantum cooperative communication and quantum multicast technology are combined, and quantum cooperative multicast is realized by adopting quantum basic gate operation and quantum measurement technology based on a ring-star mixed topological structure.
The invention provides a quantum cooperative multicast method based on a hybrid topology structure by taking a quantum system shown in figure 2 as the topology structure. The hybrid topology consists of a central ring network and a peripheral star network. In which there are k sets of peripheral star networks (n)11,n12),(n21,n22),...,(nk1,nk2,nk3) Central node n of each group of peripheral star networks1,n2,...,nkForming a central ring network. The solid lines in fig. 2 represent quantum channels and the dashed lines represent classical channels. Wherein each node n in the central ring networkiI ∈ {1, 2.. k } all have their own information αi,Suppose a peripheral star network (n)s1,ns2,...,nst) To a central node n in a central ring networksAnd sending an information aggregation request for requesting access to the aggregation information of the central ring network. At this time, the intermediate node nsThe aggregation node is established as a central ring network, and information aggregation is carried out through the central ring network to aggregate all node information to the aggregation node ns. Last sink node nsAggregating information in quantum state | ψ>=cosα|0>+sinα|1>,α=α1+α2+...+αkIs multicast to a peripheral star network (n)s1,ns2,...,nst). The whole process comprises the following steps:
step 1: constructing a ring-star mixed topological structure, preparing two particle entangled states (EPR pairs) as quantum resources, and pre-sharing quantum states | phi at any adjacent nodes in a central ring network->. In particular, each node n in the central ring networkiI ∈ {1, 2.. so, k } all with the next node ni+1Sharing a pair of EPR pairs
Step 2: and the peripheral star network sends an information aggregation request to a central node in the central ring network, and the central ring network determines the central node as a sink node of the central network according to the source of the information aggregation request. The method for specifically determining the sink node comprises the following steps:
step 2.1, peripheral star network (n)s1,ns2,...,nst) To a central node n in a central ring networksSending an information aggregation request, and then sending the information aggregation request by a central node nsForwarding aggregated information requests to the entire central ring network (n)1,n2,...,nk)。
Step 2.2, the central ring network aggregates the source n of the request according to the informationsDetermining k sets of peripheral star networks (n)11,n12),(n21,n22),...,(nk1,nk2,nk3) Peripheral star network (n) in which requests are sents1,ns2,...,nst)。
Step 2.3, the central ring network specifies the peripheral star network (n) to send the requests1,ns2,...,nst) Central node n ofsAs a sink node of the central ring network, and n is added to the central ring network1As a starting point, according to the counterclockwise n1→n2→...→nkFinds the sink node ns。
And step 3: sink node nsCollecting all nodes n of central ring network1,n2,...,nkThe aggregate information of (1). Each node n of the central ring networkiI e {1, 2.. k } is operated by performing a quantum rotation gateCarrying out information aggregation and carrying out cooperative operation on the information alpha of each nodei,In a quantum state | ψ>=cosα|0>+sinα|1>,α=α1+α2+...+αkIs aggregated to the sink node ns. Quantum revolving door operationBelonging to unitary operation, the matrix of which is expressed asQuantum state | ψ>=cosα|0>+sinα|1>Is a quantum state in two-dimensional Hilbert space, |0>And |1>Is a set of orthogonal bases whose amplitude information a contains information of all nodes and a ═ a1+α2+...+αk. The specific information aggregation mode is as follows:
step 3.1, each node n of the central ring networkiI e {1, 2.. k } is operated by performing a quantum rotation gateInformation of each node alphaiEncoding to a pre-shared EPR pairIn (1). Each one of which isActing on node ni-1And node niPre-shared EPR vs. | Φ ->(i-1)′iThe ith qubit of (a);
step 3.2, by sink node nsAnd s is more than or equal to 1 and less than or equal to ks+1At the beginning, node ni(i.e. the initial value of i is s +1) making Bell base { | PhiO on the particle i' i±>,|Ψ±>Measuring and transmitting the measurement result to the next node ni+1. Here, ,andrespectively, the results after Bell-based measurement. Table 1 gives the next node ni+1According to the last node niThe sent Bell-Based Measurements (BMR) are the unitary transformations that need to be performed to recover the ideal quantum state. As shown in table 1, by node niThe next node ni+1Choosing to perform the corresponding unitary transformation U on particle (i +1)(i+1)The quantum state of the collapsed particle s' (i +1) is converted into an ideal quantum state. Unitary transformation U(i+1)Is the following unitary operationOne of them. The superscript i +1 indicates that the unitary transformation is performed on particle (i + 1). It should be noted that, in the description of I,x and Z are both unitary operations, the matrices of which are respectively denoted And
specifically, the ideal quantum state of the particle s' (i +1) is
If node niThe measurement result is | Φ+>Then the particle s' (i +1) collapses to a quantum stateNode ni+1I operation needs to be performed on the particle (I + 1);
if node niThe measurement result is | Φ->Then the particle s' (i +1) collapses to a quantum stateNode ni+1Needs to execute for particle (i +1)Operating;
if node niThe measurement result is | Ψ+>Then the particle s' (i +1) collapses to a quantum stateNode ni+1Needs to execute for particle (i +1)Operating;
if node niThe measurement result is | Ψ->Then the particle s' (i +1) collapses to a quantum stateNode ni+1The XZ operation needs to be performed for particle (i + 1). Then node ni+1Then (i + 1)' (i +1) is subjected to Bell base { | phi±>,|Ψ±>Measure and pass the measurement result to the next node. Slave node n on a central ring networks+1Starting to sequentially and circularly execute the operations anticlockwise until the sink node nsReceives the signal from the last node ns-1And based on the node ns-1Performs the following unitary operation on the particles sOne of them.
TABLE 1 Ideal Quantum states, Bell Base Measurements (BMR), collapsed states, and unitary transformations U(i+1)The relationship between
step 3.3, sink node nsCarrying out Z-base { |0 on the particles s>,|1>And measuring, and selecting to perform I or XZ unitary operation on the particles s' according to the measurement result. If the measurement result is |0>Sink node nsPerforming an I operation on the particle s'; if the measurement result is |1>Sink node nsPerforming XZ operation on the particles s', and finally converging the node nsObtaining a quantum state | ψ>=cosα|0>+sinα|1>,α=α1+α2+...+αkAnd information aggregation is realized.
The specific implementation process of information aggregation is as follows: entangle k pairs of two particles (EPR pairs))The input quantum states are respectively composed of particles 1k ', particles 1' 2, particles 2 '3, … and particles (k-1)' k, and are adjacent to each other in the central ring network (n)1,nk),(n1,n2),(n2,n3),...,(nk-1,nk) Pre-sharing; and performing quantum revolving door operationAll node information alphai,Encoding into an input quantum state; from the sink node nsNext node n ofs+1Initially, Bell base { | Φ is used in order±>,|Ψ±>Measuring, transmitting the measuring information to the next node n through the classical channeli+1I ∈ {1, 2...., k }, the next node performs a unitary transformation U according to table 1(i+1)I belongs to {1, 2.,. k }, and the process is repeated for k-1 times until the aggregation node nsFinish the unitary transformation Uk s -1Aggregating all node information of the central ring network to the particles ss'; use of Z-base { |0 on particles s>,|1>Measuring and performing a unitary operation Z according to the measurement resultkAnd XkFinally, the particle s' outputs the polymerization quantum state | psi>=cosα|0>+sinα|1>,α=α1+α2+...+αk。
The quantum wires of a round of information aggregation process are shown in fig. 3. A round of information-aggregated quantum wires comprising k rotating gate operations RαiK-1 Bell base { | φ±>,|Ψ±>Measure (MB) 1 times Z-basis 0>,|1>Measurement (MZ), k-1 unitary operations 1 time ZkAnd XkThe line depth is k + 2. The double lines in the figure represent classical channels; l Φ->Is a two-particle entangled state (EP)R pairs);is operated by a revolving door in the form of a matrixMBiIs the ith Bell-based measurement, hereRespectively representing the results after Bell base measurement;are unitary operations, with the subscript representing the unitary operation performed on the basis of the measurement and the superscript representing the unitary operation performed on the particle. Such asIndicating that a unitary operation is performed on the particle s +2 according to the 1 st measurement. For a specific unitary operation, refer to table 1 if the measurement result is | Φ+>Selecting unitary operation as I; if the measurement result is | Φ->Unitary operation is selected asIf the measurement result is | Ψ+>Unitary operation is selected asIf the measurement result is | Ψ->Selecting unitary operation as XZ; MZkIs the kth Z base { |0>,|1>Measuring; zkAnd XkRespectively, if the measurement result is |1 > -based on the k-th measurement result, performing the unitary operationAndotherwise no operation is performed.
And 4, step 4: central ring shapeThe network requires all the nodes of the central ring network to repeat multi-round information aggregation process according to the requirement of the peripheral star network until the number of information aggregation reaches the target requirement. By a sink node nsAnd transmitting the collected aggregation information to the peripheral star network in a multicast mode. In particular, according to the sink node nsOf a peripheral star network sub-node ns1,ns2,...,nstT, the t information aggregation operations are repeatedly cycled to obtain t aggregation information quantum statesSink node nsAs a central node of the peripheral star topology, quantum statesSimultaneously sending to a peripheral star network in multicast form (n)s1,ns2,...,nst) And finishing quantum cooperative multicast.
The invention has the beneficial effects that: the multicast transmission of the invention is deterministic, and promotes the further development of quantum multicast. In addition, the invention can realize the information aggregation of the central ring network and transmit the information to the peripheral star network in a multicast mode. The method not only accords with the basic idea of quantum cooperative communication, but also well reflects the quantum multicast characteristic on a ring-star mixed topological structure, and improves the communication efficiency of a large-scale quantum network.
Drawings
FIG. 1 is a flow chart of a hybrid topology-based quantum cooperative multicast method according to the present invention;
FIG. 2 is a diagram of a hybrid topology of the present invention;
FIG. 3 is a diagram of a quantum circuit of a round of information aggregation process in the present invention;
table 1 is the relationship between ideal quantum states, Bell-based measurements BMR, collapsed states, and unitary transformations.
Detailed Description
The invention relates to a quantum cooperative multicast method based on a hybrid topological structure. Aiming at the problem of multiparty quantum communication, the cooperative multicast transmission quantum state is realized based on a quantum ring-star mixed topology structure.
The following detailed description of embodiments of the present invention is provided in connection with the accompanying drawings and examples. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.
As shown in fig. 1, the method mainly comprises the following steps:
step 1: constructing a ring-star mixed topological structure, preparing two particle entangled states (EPR pairs) as quantum resources, and pre-sharing between any adjacent nodes in a central ring network;
step 2: the peripheral star network sends an information aggregation request to a central node in a central ring network, and the central ring network determines the central node as a sink node according to the source of the information aggregation request;
and step 3: the sink node collects the aggregation information of all nodes of the central ring network;
and 4, step 4: the central ring network requires all the nodes of the central ring network to repeat a plurality of rounds of information aggregation processes until the number of the aggregated information reaches the target requirement according to the requirement of the peripheral star network, and multicast-sends the aggregated information to the peripheral star network.
The specific embodiment is as follows:
based on the ring-star hybrid topology shown in fig. 2, assume that there are 3 nodes n on the central ring network1,n2,n3They are respectively peripheral star networks (n)11,n12),(n21,n22,n23,n24),(n31,n32,n33) The central node of (2). Node n in a central network1,n2,n3Each having its own information alpha1,α2,α3Here alpha1,α2,Suppose a peripheral star network (n)21,n22,n23,n24) To the center in a central ring networkNode n2Sending an information aggregation request requesting access to a central network (n)1,n2,n3) The information of (2) is aggregated. At this time, node n21,n22,n23,n24Intermediate node n of star topology2Will respond to the request and act as an aggregation node with the rest of the nodes n on the central ring network1,n3And performing information aggregation through mutual cooperation. Finally, the polymerization information is in quantum state | psi>=cosα|0>+sinα|1>,α=α1+α2+α3Is multicast to a peripheral star network (n)21,n22,n23,n24). The following describes specific steps of the present invention.
Step 1: constructing a ring-star mixed topology structure, and each node n in a central ring networkiI ∈ {1,2,3} all with the next node ni+1Sharing a pair of two-particle entangled states (EPR pair)In particular, node n1And node n2Inter-pre-shared EPR pair | Φ->1′2Node n2And node n3Inter-pre-shared EPR pair | Φ->2′3Node n3And node n1Inter-pre-shared EPR pair | Φ->3′1. The entire initial quantum system can be written as:
step 2: and the peripheral star network sends a request to the central node to request information aggregation for accessing the central ring network. And the central ring network determines that the central node is the sink node according to the source of the information aggregation request. The method for specifically determining the sink node comprises the following steps:
step 2.1, peripheral star network (n)21,n22,n23,n24) To a central node n in a central ring network2Sending an information aggregation request, and then sending the information aggregation request by a central node nsForwarding aggregated information requests to the entire central ringForm network (n)1,n2,n3)。
Step 2.2, the central ring network according to the source n of the aggregation request2Determining 3 sets of peripheral star networks (n)11,n12),(n21,n22,n23,n24),(n31,n32,n33) Peripheral star network (n) in which requests are sent21,n22,n23,n24)。
Step 2.3, the central ring network specifies the peripheral star network (n) to send the request21,n22,n23,n24) Central node n of2As a sink node of the central network, and n on the central ring network1As a starting point, according to the counterclockwise n1→n2→n3Finds the sink node n2。
And step 3: each node n of the central ring networkiI e {1,2,3} is operated by performing a quantum rotation gateCarrying out information aggregation and carrying out cooperative operation on the information alpha of each nodei,In a quantum state | ψ>=cosα|0>+sinα|1>,α=α1+α2+α3To the sink node. The specific information aggregation mode is as follows:
step 3.1, Central Ring network node niI e {1,2,3} operated by quantum rotating gateInformation of each node alphai,Encoding to a pre-shared EPR pairIn (1).Each one of which isOperation acts on node ni-1And node niPre-shared EPR pair | Φ->(i-1)′iOn the particle i of (1).
At this time, the whole quantum system evolves as:
step 3.2, by sink node n2Next node n of3Initially, Bell base { | φ is applied to particle 3' 3±>,|Ψ±>Measuring, whereinAnd transmits the measurement result to the next node n1. Suppose that the measurement result is | Φ+>3′3At this time, the whole quantum system evolves as:
from table 1, by the next node n1To particles 1 doAnd (5) operating. Then the Bell-based measurement of the particles 1' 1 is carried out±>,|Ψ±>}. Suppose that the measurement result is | Φ->1′1At this time, the whole quantum system evolves as:
from table 1, by the next node n2To particles 2Operation, at this point the entire quantum system evolves to:
step 3.3, sink node n2Z-base { |0 for particle 2>,|1>And (6) measuring. If the measurement result is |0>Carrying out I operation on the particles 2'; if the measurement result is |1>The particles 2' are subjected to an XZ operation. At a sink node n2Obtaining a quantum state:
|ψ>=cos(α1+α2+α3)|0>+sin(α1+α2+α3)|1>
and 4, step 4: according to sink node n2Of a peripheral star network node n21,n22,n23,n24The number of the aggregation nodes n can be obtained through 4 rounds of information aggregation2To obtain 4 quantum statesSink node n2As a central node of the peripheral star topology, quantum statesSimultaneously sending to peripheral star network nodes n in a multicast mode21,n22,n23,n24And finishing quantum cooperative multicast.
The invention belongs to the field of multiparty quantum communication, and expands the application scene of a quantum multicast network. On the one hand, the information aggregation of the central ring network can be realized deterministically, and on the other hand, the information can be transmitted to the peripheral star network in a multicast mode. Not only accords with the basic idea of quantum cooperative communication, but also well reflects the multicast characteristic on the ring-star mixed topology structure. Therefore, the invention can promote the further development of quantum multicast and improve the communication efficiency of a large-scale quantum network.
Claims (3)
1. A quantum cooperative multicast method based on a hybrid topology structure is characterized by comprising the following steps:
step 1, constructing a ring-star mixed topological structure, preparing two particle entangled states (EPR pairs) as quantum resources, and randomly adjacent nodes (n) in a central ring networki,ni+1) In pre-shared quantum states|Φ->Is two-particle entangled state (EPR pair), and subscripts i' and i +1 represent the 1 st and 2 nd particles of the EPR pair respectively, and are formed by a central ring network node niAnd ni+1The method comprises the steps that a central ring network has k nodes, namely i belongs to {1, 2.., k };
step 2, the peripheral star network sends an information aggregation request to a central node in the central ring network, and the central ring network determines the central node as a sink node according to the source of the information aggregation request;
step 3. sink node nsCollecting all nodes n of central ring network1,n2,...,nkThe aggregate information of (1); the method specifically comprises the following steps: each node n of the central ring networkiI e {1, 2.. k } is operated by performing a quantum rotation gateCarrying out information aggregation and carrying out cooperative operation on the information alpha of each nodei,In a quantum state | ψ>=cosα|0>+sinα|1>,α=α1+α2+...+αkIs aggregated to the sink node ns(ii) a Quantum revolving door operationBelonging to unitary operation, the matrix of which is expressed asQuantum state | ψ>=cosα|0>+sinα|1>Is a quantum state in two-dimensional Hilbert space, |0>And |1>Is a set of orthogonal bases whose amplitude information a contains information of all nodes and a ═ a1+α2+...+αk;
And 4, the central ring network requires all the nodes of the central ring network to repeat a plurality of rounds of information aggregation processes according to the requirement of the peripheral star network until the number of the aggregated information reaches the target requirement, and the aggregated information is sent to the peripheral star network by the aggregation node in a multicast mode.
2. The method of claim 1, wherein the method for determining sink nodes in step 2 comprises:
step 2.1, peripheral star network (n)s1,ns2,...,nst) To a central node n in a central ring networksSending an information aggregation request, and then sending the information aggregation request by a central node nsForwarding the aggregated information request to the entire central ring network;
step 2.2, the central ring network aggregates the source n of the request according to the informationsDetermining k sets of peripheral star networks (n)11,n12),(n21,n22),...,(nk1,nk2,nk3) Peripheral star network (n) in which requests are sents1,ns2,...,nst);
Step 2.3, the central ring network specifies the peripheral star network (n) to send the requests1,ns2,...,nst) Central node n ofsAs a sink node of the central ring network, and n is added to the central ring network1As a starting point, according to the counterclockwise n1→n2→...→nkFinds the sink node ns。
3. The method of claim 1, wherein the information aggregation method in step 3 comprises:
step 3.1, each node n of the central ring networkiI e {1, 2.. k } is processed byRow quantum revolving door operationInformation of each node alphai,Encoding to a pre-shared EPR pairIn each caseActing on node ni-1And node niPre-shared EPR pairsThe ith qubit of (a);
step 3.2, by sink node nsAnd s is more than or equal to 1 and less than or equal to ks+1At the beginning, node ni(i.e. the initial value of i is s +1) making Bell base { | PhiO on the particle i' i±>,|Ψ±>Measuring and transmitting the measurement result to the next node ni+1Here, theAndrespectively representing the results after Bell-based measurements, according to node niThe next node ni+1Choosing to perform a unitary transformation U on particle (i +1)(i+1)(ii) a Unitary transformation U(i+1)Is the following unitary operationOne of them, wherein, I,x and Z are both unitary operations, the matrices of which are respectively denotedAndif node niThe measurement result is | Φ+>Node ni+1I operation needs to be performed on the particle (I + 1); if node niThe measurement result is | Φ->Node ni+1Needs to execute for particle (i +1)Operating; if node niThe measurement result is | Ψ+>Node ni+1Needs to execute for particle (i +1)An XZ operation; if node niThe measurement result is | Ψ->Node ni+1An XZ operation needs to be performed on particle (i + 1); then node ni+1Then making Bell base { | φ) for the particle (i + 1)' (i +1)±>,|Ψ±>Measure and pass the measurement to the next node, from node n on the central ring networks+1Starting to sequentially and circularly execute the operations anticlockwise until the sink node nsReceives the signal from the last node ns-1And based on the node ns-1Performs the following unitary operation on the particles s
Step 3.3, sink node nsCarrying out Z-base { |0 on the particles s>,|1>Measuring, and selecting to execute I or XZ unitary operation on the particles s' according to the measurement result; if the measurement result is |0>Sink node nsPerforming an I operation on the particle s'; if the measurement result is |1>Sink node nsPerforming XZ operation on the particles s', and finallySink node nsObtaining a quantum state | ψ>=cosα|0>+sinα|1>,α=α1+α2+...+αkAnd information aggregation is realized.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111136166.2A CN113890627B (en) | 2021-09-27 | 2021-09-27 | Quantum cooperation multicast method based on hybrid topological structure |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111136166.2A CN113890627B (en) | 2021-09-27 | 2021-09-27 | Quantum cooperation multicast method based on hybrid topological structure |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113890627A true CN113890627A (en) | 2022-01-04 |
CN113890627B CN113890627B (en) | 2022-08-16 |
Family
ID=79007064
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202111136166.2A Active CN113890627B (en) | 2021-09-27 | 2021-09-27 | Quantum cooperation multicast method based on hybrid topological structure |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113890627B (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106685649A (en) * | 2016-12-15 | 2017-05-17 | 北京航空航天大学 | Multipoint coordinated transmission scheme based on quantum entanglement swapping |
CN109714261A (en) * | 2019-01-11 | 2019-05-03 | 东南大学 | A kind of multi-broadcast routing method based on fidelity measurement in quantum communication network |
US20190173589A1 (en) * | 2015-07-10 | 2019-06-06 | Omnisent, LLC | Systems and methods for modeling quantum entanglement and performing quantum communication |
CN110768793A (en) * | 2019-10-15 | 2020-02-07 | 国网甘肃省电力公司信息通信公司 | Two-stage quantum state cooperative multicast method based on butterfly network structure |
CN111147154A (en) * | 2019-12-24 | 2020-05-12 | 北方工业大学 | Multi-unicast network coding method based on quantum repeaters with different dimensions |
-
2021
- 2021-09-27 CN CN202111136166.2A patent/CN113890627B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20190173589A1 (en) * | 2015-07-10 | 2019-06-06 | Omnisent, LLC | Systems and methods for modeling quantum entanglement and performing quantum communication |
CN106685649A (en) * | 2016-12-15 | 2017-05-17 | 北京航空航天大学 | Multipoint coordinated transmission scheme based on quantum entanglement swapping |
CN109714261A (en) * | 2019-01-11 | 2019-05-03 | 东南大学 | A kind of multi-broadcast routing method based on fidelity measurement in quantum communication network |
CN110768793A (en) * | 2019-10-15 | 2020-02-07 | 国网甘肃省电力公司信息通信公司 | Two-stage quantum state cooperative multicast method based on butterfly network structure |
CN111147154A (en) * | 2019-12-24 | 2020-05-12 | 北方工业大学 | Multi-unicast network coding method based on quantum repeaters with different dimensions |
Non-Patent Citations (4)
Title |
---|
DEBBIE LEUNG等: "Quantum Network Communication—The Butterfly and Beyond", 《IEEE TRANSACTIONS ON INFORMATION THEORY》 * |
SHI,Y;SOLJANIN,E: "On multicast in quantum networks", 《2006 40TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS》 * |
安隆熙: "量子通信网络中多播传输问题研究", 《中国优秀博硕士学位论文全文数据库(硕士)基础科学辑》 * |
尚涛等: "量子网络编码研究进展", 《无线电通信技术》 * |
Also Published As
Publication number | Publication date |
---|---|
CN113890627B (en) | 2022-08-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Muralidharan et al. | Perfect teleportation, quantum-state sharing, and superdense coding through a genuinely entangled five-qubit state | |
CN107612689B (en) | Quantum state invisible transmission method based on flow distribution transmission in quantum network | |
CN109379144B (en) | Quantum network coding method based on quantum detuning | |
WO2021008508A1 (en) | D-dimensional chain-type teleportation method based on random sending of measurement result of relay node | |
CN109982410B (en) | Quantum wireless mesh network routing method and framework based on entanglement exchange | |
Zhang et al. | Cyclic joint remote state preparation in noisy environment | |
CN110212978B (en) | Quantum communication method and system for terminal delay selection | |
CN112804009B (en) | Joint quantum remote state acceleration preparation method based on terminal uncertainty | |
CN103618695A (en) | Total probability arbitrary multiparty JRSP method | |
CN110768793A (en) | Two-stage quantum state cooperative multicast method based on butterfly network structure | |
Yang et al. | Efficient quantum multi-hop communication based on Greenberger–Horne–Zeilinger states and Bell states | |
Yang et al. | Quantum wireless network communication based on cluster states | |
CN111510289A (en) | Bidirectional single-bit state preparation method based on Brown state and network coding | |
CN111179087A (en) | Alliance chain consensus method based on grid arbitration | |
CN109347631A (en) | The long-range complex coefficient quantum state preparation method of probability based on unknown parameter GHZ channel | |
Zhao et al. | Multicast-based N-party remote-state preparation of arbitrary Greenberger-Horne-Zeilinger–class states | |
CN114629562A (en) | Quantum communication invisible state transfer optimization method based on non-maximum entangled state | |
Zhang et al. | Multi-hop cyclic joint remote state preparation | |
Choudhury et al. | Remote preparation of some three particle entangled states under divided information | |
CN112217576B (en) | Long-distance remote quantum state preparation method based on GHZ state and Bell state | |
CN113890627B (en) | Quantum cooperation multicast method based on hybrid topological structure | |
Wang et al. | Addendum to “Quantum wireless multihop communication based on arbitrary Bell pairs and teleportation” | |
CN111130771B (en) | Quantum network coding method based on quantum state non-loss | |
Wang et al. | Deterministic joint remote preparation of a four-qubit cluster-type state via GHZ states | |
Chen et al. | On the optimality of data exchange for master-aided edge computing systems |
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 | ||
GR01 | Patent grant | ||
GR01 | Patent grant |