CN106685649B - A kind of multi-point cooperative transmission method based on quantum entanglement exchange - Google Patents
A kind of multi-point cooperative transmission method based on quantum entanglement exchange Download PDFInfo
- Publication number
- CN106685649B CN106685649B CN201611160719.7A CN201611160719A CN106685649B CN 106685649 B CN106685649 B CN 106685649B CN 201611160719 A CN201611160719 A CN 201611160719A CN 106685649 B CN106685649 B CN 106685649B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- mode
- particle
- network
- 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.)
- Expired - Fee Related
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 38
- 238000000034 method Methods 0.000 title claims description 19
- 238000004891 communication Methods 0.000 claims abstract description 57
- 238000005259 measurement Methods 0.000 claims description 61
- 239000002245 particle Substances 0.000 claims description 58
- 238000012546 transfer Methods 0.000 abstract description 13
- 238000005516 engineering process Methods 0.000 abstract description 10
- 230000002269 spontaneous effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 6
- 238000012360 testing method Methods 0.000 description 4
- 238000013461 design Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000004576 sand Substances 0.000 description 2
- 238000001514 detection method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000704 physical effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
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
- H04L9/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
-
- 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/085—Secret sharing or secret splitting, e.g. threshold schemes
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of multi-point cooperative transmission scheme based on quantum entanglement exchange of the present invention, step 1. have multiple node N of communication requirement1, N2..., NkNetwork is set up.Step 2. is according to all node NiThe communication requirement of (1≤i≤k), negotiates communication pattern, that is, determines a pair of of multi-mode or many-one mode.If carrying out a pair of of multi-mode, 3 are entered step；Otherwise 4 are entered step.Step 3. network executes a pair of of multi-mode, this mode some node N suitable for networks(1≤s≤k) needs to send the scene of message to other nodes.Step 4. network executes many-one mode, which is suitable for only one receiving node Nr(1≤r≤k), remaining node Ni(1≤i≤k, i ≠ r) is the scene of sending node.The present invention makes full use of the EPR resource between adjacent node, and dynamic sets up quantum network, realizes multi-point cooperative transmission using quantum entanglement transfer technology.Network structure flexibility and changeability, there is no limit can be according to the spontaneous network consisting of node wish for specific participation interstitial content.Under the premise of node cooperation, scheme meets communication for coordination basic security demand.
Description
Technical field
The present invention relates to a kind of multi-point cooperative transmission methods of quantum entanglement exchange, belong to technical field of communication network.
Background technique
Since first quantum key distribution protocol BB84 is suggested, quantum communications are because of its peace based on physical property
Full property guarantees and obtains more and more concerns and research.From basic secure communication demand, quantum information science is developed
Quantum-key distribution (Quantum Key Distribution, QKD), Quantum Secure Direct Communication (Quantum Secure
Direct Communication, QSDC) etc. branches.Based on expand communication participant demand, quantum multi-party communication from however
So enter the visual field of people, typical case therein is quantum secret sharing (Quantum Secret Sharing, QSS).
QSS is combination and application of the privacy sharing in quantum information science in classical cryptoraphy, and basic thought is the transmission of message
Person worries the saboteur that may have malice in numerous recipients, and then message is divided into more parts by it, every portion message all phases
Mutual independence and it is respectively allocated to a recipient, only whole recipient's honesty cooperations could recover classified information jointly, appoint
The individual recipient that anticipates can not independently recover information, therefore effectively malicious recipients be prevented to break other participants
It is bad.Furthermore, it is understood that QSS is a kind of one-to-many safety communicating method, i.e. a sender sends message to multiple recipients,
All recipient's cooperative cooperatings receive message.
Multi-point cooperative (Coordinated Multi-point, CoMP) is an important technology in LTE network, it is intended to
By cooperateing with multiple base stations to provide service jointly for community user, to greatly improve telecommunication service quality, the technology is in LTE net
There are in-depth study and application in network.The core concept of CoMP first is that enable multiple base station cooperative cooperatings, while being a user
Send efficient message, this demand with QSS on the contrary, be a kind of many-to-one working method, but with one-to-many working method phase
Together, it is also required to multiple node cooperative cooperatings.
Quantum entanglement is the intrinsic physical characteristic of quantum, it is the basis that quantum information can play a great role.Quantum
Entanglement transfer is the key technology in quantum information science, it allows to operate by the measurement to two particles, makes other two
Originally effect is tangled in the quantum generation for not tangling relationship, in addition, the newly generated state for tangling particle pair and entanglement transfer
Measurement operating result has specific association, i.e., can be inferred that the state for newly tangling particle by measurement result.This characteristic
It is commonly used for the design of various quantum communications agreements, in fields such as Quantum Secure Direct Communication, quantum secret sharing, quantum signatures
All it is widely used.
In view of the functional requirement of multi-point cooperative communication and the preciousness of the particularity of quantum network and quantum resource, amount
Sub- multi-point cooperative transmission scheme should meet following demand: (1) confidentiality as far as possible, and when there is multiple senders, sender's disappears
Breath only has recipient can get, remaining sender is unavailable；(2) high efficiency efficiently uses existing quantum resource in network；
(3) dynamic, the limitation and requirement that the quantity of sender is not fixed can adjust the number of nodes of contract network as needed.
Inspiration of the present invention by QSS and CoMP is constructed flexible using entanglement transfer technology in quantum communication network
Multi-point cooperative transmission scheme.Multiple node cooperative cooperatings can either carry out the message transmission similar to the point to multi--point of QSS,
Also the multiple spot being able to carry out similar to CoMP transmits the message of a bit.Multi-point cooperative communication plan has expanded the more of quantum network
Square communication pattern, and effectively improve the transmission performance of quantum network.
Summary of the invention
Technology of the invention solves the problems, such as: based on the needs for expanding quantum network communication participant, towards quantum communications net
Network proposes a kind of multi-point cooperative transmission method of quantum entanglement exchange, wherein how to realize a side to multi-party message transmission and more
Side is the critical issue that must be solved to the message transmission of a side.
The technical solution adopted by the present invention is that: a kind of multi-point cooperative transmission method of quantum entanglement exchange, it includes following
Step:
Step 1. has multiple node N of communication requirement1, N2..., NkNetwork is set up, network structure is as follows: adjacent node
Between have EPR (Einsten-Podolsky-Rosen) tangle channel, i.e. Ni(2≤i≤k-1) respectively with Ni-1And Ni+1Tool
There is EPR to tangle channel, N1Respectively with N2And NkChannel, N are tangled with EPRkRespectively with N1And Nk-1Channel is tangled with EPR.Net
Network node is joined end to end by EPR channel, forms closed circular.
Step 2. is according to all node NiThe communication requirement of (1≤i≤k), negotiates communication pattern, that is, determines a pair of of multimode
Formula or many-one mode.If carrying out a pair of of multi-mode, 3 are entered step；Otherwise, if carrying out many-one mode, enter
Step 4.
Step 3. network executes a pair of of multi-mode, this mode some node N suitable for networks(1≤s≤k) need to
The scene of other nodes transmission message.The node N of message will be sents(1≤s≤k) renames as S, remaining node Ni(1≤i
≤ k, i ≠ s) it is receiving node, enable m=k-1, and by remaining node Ni(1≤i≤k, i ≠ s) renames as R1, R2...,
Rm.Sender S is to receiving node RiThe message-length that (1≤i≤m) is sent is 2l, l > 0.
Wherein steps are as follows for the specific execution of a pair of of multi-mode described in step 3:
Step 3.1. sending node S is ready to and each l EPR of left and right adjacent node tangles particleWithj
(1≤j≤l) is particle number.Whole receiving node Ri(1≤i≤m) is ready to respectively and each l EPR of left and right adjacent node
Tangle particleWithJ (1≤j≤l) is particle number.
2l message are divided into l parts by step 3.2. sending node S, and 2 every part, then S holds every part of 2 message in order
Row encoding operation UXTo particleOn, each encoding operation represents 2 message.
All receiving node R of step 3.3.i(1≤i≤m) is respectively to the particle of oneselfIt carries out
Bell measurement, obtains l parts of measurement resultsEach receiving node RiBy the whole measurement results of oneself by suitable
Sequence is combined intoThe length is 2l.Then, each receiving node RiIt will be respectiveIt is broadcasted.
Particle of the step 3.4. sending node S to oneselfBell measurement is carried out, l parts of measurement knots are obtained
FruitM is obtained after splicingS.According to encoding operation UX, S willRestore the state to before encodingThen, S peer-to-peerIt is examined
It tests, wherein O2lIt is to be all the sequence that the length of 0 composition is 2l.If equation is invalid, S terminates communication, conversely, S broadcast measurement
As a result MS.The each receiving node R of step 3.5.iThe measurement result that (1≤i≤m) is broadcasted according to whole receiving nodesWith the measurement result M of SS, obtainPass through comparison M againSAnd MS', byObtain l encoding operation UX, to obtain the position the 2l message of S coding.Then whole receiving node Ri(1≤i
≤ m) all obtain sending node S the position 2l message.
Step 4. network executes many-one mode, which is suitable for only one receiving node Nr(1≤r≤k),
Remaining node Ni(1≤i≤k, i ≠ r) is the scene of sending node.By receiving node Nr(1≤r≤k) renames as node
R enables m=k-1, by sending node Ni(1≤i≤k, i ≠ r) renames as S1, S2..., Sm.Each sending node Si(1≤i
≤ m) send message-length be 2l.
The specific implementation step of many-one mode described in step 4 is as follows:
Step 4.1. receiving node R is ready to and each l EPR of left and right adjacent node tangles particleWithj
(1≤j≤ml) is particle number.Whole sending node Si(1≤i≤m) is ready to respectively and that left and right adjacent node is shared is each
Ml particleWithJ (1≤j≤ml) is particle number.
The each sending node S of step 4.2.i(1≤i≤m) is respectively by the 2l message coding of oneself to particle
Encoding operation is UX.Each encoding operation encodes 2 message.
The each sending node S of step 4.3.i(1≤i≤m) is to the particle of oneselfIt carries out
Bell measurement, obtains ml measurement resultCombination is obtained intoAnd it is broadcasted.
Step 4.4. receiving node R receives allAfterwards, to the particle of oneselfBell measurement is carried out, is obtainedAnd it is combined into MR。
Step 4.5. receiving node R passes throughIt obtainsBefore coding
StateHave by the comparison on the 2nd (i-1) l+1 to the position 2ilObtain l encoding operation UX,
Each UXCorresponding 2 message, then R obtains each SiEach 2l message of (1≤i≤m).
The present invention gives full play to the characteristic of quantum entanglement exchange, designs a kind of multiple spot association based on quantum entanglement switching technology
Same transmission plan, the side being not only able to achieve similar to QSS transmits multi-party message, but also is able to achieve and passes in many ways to the message of a side
It is defeated.Each participant cooperative cooperating, in a pair of of multi-mode, all recipient's cooperative cooperatings recover disappearing for transmission jointly
Breath；In many-one mode, all sender's cooperative cooperatings send respective message, only recipient to recipient jointly
The message of all senders can be read.
The advantages of the present invention over the prior art are that:
(1) present invention makes full use of the EPR resource between adjacent node, dynamically sets up quantum network, and entangle using quantum
It twines switching technology and realizes multi-point cooperative transmission.Network structure flexibility and changeability, there is no limit can basis for specific participation interstitial content
The wish of node spontaneously network consisting.
(2) one-to-many transmission or many-to-one cooperative transmission can be achieved in the present invention, to adapt to different network needs.
In addition, scheme meets the basic security demand of communication for coordination under the premise of node cooperation.
Detailed description of the invention
Quantum network structural schematic diagram Fig. 1 of the invention.
A pair of of multi-communication mode schematic diagram Fig. 2 a, Fig. 2 b of the invention.
Measurement result Fig. 3 of the invention forms figure.
Many-one communication pattern schematic diagram Fig. 4 a, Fig. 4 b of the invention.
The subsequent shared model schematic diagram of many-one Fig. 5 a, Fig. 5 b of the invention.
Fig. 6 is flow diagram of the invention.
Symbol description is as follows in figure:
N1, N2..., N(k-1), NkFor the node in quantum network；
S is the sender of the message in a pair of of multi-communication mode；
R1, R(m-1), RmFor the recipient of message；
Respectively R1, R(m-1), RmMeasurement result；
For receiving node RiTo the measurement result for the progress Bell measurement of particle 1 and 2 that number is j；
R is the receiving node in many-one communication pattern；
S1, S(m-1), SmFor the sending node in many-one communication pattern；
Respectively S1, S(m-1), SmMeasurement result；
S1, Sp, SmFor the receiving node in the subsequent shared model of many-one, wherein grayed-out nodes expression needs shared message
Information node.
Specific embodiment
With reference to the accompanying drawing, the following further describes the technical solution of the present invention.
A kind of multi-point cooperative transmission method of quantum entanglement exchange proposed by the invention need to solve following problems: for amount
Multi-point demand in sub- communication network, the side being not only able to achieve similar to QSS transmits multi-party message, but also is able to achieve more
Side is transmitted by the message of one side.I.e. under the premise of each participant cooperative cooperating, in a pair of of multi-mode, all recipients
The message of single sender can be received；In many-one mode, single recipient can receive the message of all senders.
Quantum entanglement exchange is key technology in quantum communications, and basic thought is tangled pair by combined measurement two
In each particle so that other two be not directly linked particle generation tangle effect.Utilize the pass between measurement result
Connection relationship, entanglement transfer can by particle carry out coding to realize message transmit, thus Quantum Secure Direct Communication,
There is extensive application in the fields such as quantum secret sharing, quantum signature.
In many ways exchange is entwined by entanglement transfer technique extension to multiple participants, and the foundation of multi-party entanglement transfer must satisfy
Two conditions: (1) there are EPR to tangle channel between each node and adjacent node in the quantum network of the multi-party entanglement transfer of participation；
(2) node joins end to end to form closed loop, i.e., tangles pair between first node and the last one node there are EPR.In many ways it is entangling
It twining in exchange, the measurement result of all nodes needs to meet specific connection, by taking Fig. 1 as an example, node N1, N2..., NkRespectively to certainly
Oneself particle 1,2 carries out Bell measurement, then measurement result meets following relationship:
WhereinIndicate node NiThe measurement result of Bell measurement is carried out to the particle 1,2 of oneself,It indicates by node NiParticle 2 and node NjThe initial quantum state tangled pair that forms of particle 1.Four
Bell state corresponds respectively to 2 bit binary numbers:
|φ+> → 00, | φ-> → 01, | ψ+> → 10, | ψ->→11
A kind of main realization thought of the multi-point cooperative transmission method of quantum entanglement exchange of the present invention is: with quantum communications net
The existing EPR of network is tangled based on channel, is cooperated with each other between node, message coding is realized using entanglement transfer technology, into one
Step realizes multi-node collaborative transmission.The program supports one-to-many and two kinds of operating modes of many-one, to adapt to quantum communication network
Different demands.Flow diagram of the invention is as shown in fig. 6, program specific implementation step is as follows:
Step 1. is mainly used for having set up network between the multiple nodes for participating in communication, to carry out subsequent message biography
It is defeated.See Fig. 1, there are multiple node N of communication requirement in quantum network1, N2..., N(k-1), NkBetween set up network.Network knot
Structure meets condition: between adjacent node there is EPR to tangle channel, i.e. Ni(2≤i≤k-1) respectively with Ni-1And Ni+1It is entangled with EPR
Twine channel, N1Respectively with N2And NkChannel, N are tangled with EPRkRespectively with N1And Nk-1Channel is tangled with EPR, all EPR entangle
The original state twined pair is | φ+>, correspond to binary message 00.
Step 2. is mainly used for network node and determines final communication pattern.According to the communication requirement of node, consult to decide
Communication pattern is to select a pair of of multi-mode or many-one mode.Both of which is defined as follows:
A pair of of multi-mode: there are a sending node in network, remaining node is receiving node, and sending node connects to whole
It receives node and sends message.
Many-one mode: there are a receiving node in network, remaining node is sending node, and receiving node receives simultaneously
Message from whole sending nodes.
If network selects a pair of of multi-communication mode, 3 are entered step；Otherwise, if network selects many-one mode, enter
Step 4.
Step 3. a pair of multi-mode.The mode realizes that a sending node sends message to remaining receiving node.It is assumed that hair
Sending node is Ns(1≤s≤k), by NsIt renames as S, residue (k-1) a node Ni(1≤i≤k, i ≠ s) is to receive section
Point, enables m=k-1, and by remaining node Ni(1≤i≤k, i ≠ s) is renamed respectively as R1, R2..., Rm.Enable sending node S
To receiving node RiThe message-length that (1≤i≤m) is sent is 2l.Then it carries out in accordance with the following steps:
(1) as shown in Figure 2 a, sending node S and receiving nodes Ri(1≤i≤m) is ready to and left and right adjacent segments are tangled
L EPR tangle particle, particle number is j (1≤j≤l), at this time the state of entire quantized system are as follows:
Wherein subscript j (1≤j≤l) indicates that the number of particle, subscript 1,2 indicate the particle 1 and particle 2, Mei Gejie of node
The particle 1 of point and the particle 2 of previous node are that EPR is tangled pair, and the particle 1 of particle 2 and the latter node is to tangle pair.Such asIndicate the particle 2 and node R of the node S marked as j1The state tangled pair that forms of particle 1.
(2) 2l message are divided into part by sending node S, and 2 every part, then each 2 message is separately encoded by S in order
To particleOn, each encoding operation represents 2 message, and specific encoding operation is as follows:
If the transmission message of sending node S is " 101101 ... ", it will be rightPerform the encoding operation U10, rightInto
Row encoding operation U11, rightPerform the encoding operation U01…
(3) each receiving node Ri(1≤i≤m) is respectively to the particle of oneselfBell measurement is carried out,
Obtain l parts of measurement resultsThen Ri(1≤i≤m) is by the whole measurement results of oneself
It splices and combines into orderComposition figure it is as shown in Figure 3.Then, all receiving node RiIt will be respectiveExtensively
It broadcasts.
(4) it is sent in order to prevent because being destroyed caused by the EPR channel corruption or malice receiving node between each node
Node S needs to test to the correctness of measurement result.
As shown in Figure 2 b, particle of the sending node S to oneselfBell measurement is carried out, l parts of measurements are obtained
As a resultSplicing obtains M in sequenceS.According to encoding operation UX, S can be byIt obtainsFor example, if sending node S is to a certain specified particlePerform the encoding operation UXFor
U01, rightBell measurement resultFor | ψ->, correspond to binary message 11, then calculatesForOwnedAfterwards, it combines them in order and obtains M 'S。
Whether sending node S detection measurement result meets the rule of multi-party entanglement transfer:
Wherein, O2lIt is to be all the sequence that the length of 0 composition is 2l.S tests to above formula equation, if equation is invalid,
The recipient that then channel is interfered or has has lied about measurement result, then S terminates communication, if equation is set up, communicates continuation,
S is by measurement result MSIt is broadcasted.
(5) all receiving node Ri(1≤i≤m) is according to the measurement result of graspCalculate M 'S:
By comparing M 'SAnd MS:
L U can be obtained according to above formulaX, each UX2 message are corresponded to, then last all receiving node Ri(1≤i≤m)
The position the 2l message of sending node S transmission can be obtained, a pair of of multi-mode terminates.
Step 4. many-one mode.The mode realizes that multiple sending nodes send message to a receiving node.Many-one
Communication pattern is also common one of the demand of communication network.For example, a node will collect the message of remaining node, or all
Node has information to need to converge to a central node.The mode is suitable for only one receiving node Nr(1≤r≤k),
Remaining node Ni(1≤i≤k, i ≠ r) is the scene of sending node.By receiving node Nr(1≤r≤k) renames node R, enables
M=k-1, by sending node Ni(1≤i≤k, i ≠ r) renames as S1, S2..., Sm.Enable each sending node Si(1≤i≤
M) message-length sent is 2l, and scheme carries out as follows:
(1) as shown in fig. 4 a, receiving node R and whole sending node Si(1≤i≤l) is ready to adjacent with left and right respectively
Each ml particle of nodes sharing, particle number is j.The state of entire quantized system at this time are as follows:
(2) each sending node Si(1≤i≤m) needs to send 2l message, needs to lExecute encoding operation
UX, specifically, each SiExtremely by 2l message codingsThat is sending node S1By the 2l of oneself
Position message coding is to particleNode S2Extremely by the position the 2l message coding of oneself
(3) after the completion of encoding, each sending node Si(1≤i≤m) is to the particle of oneself
Bell measurement is carried out, ml measurement result is obtainedCombination is obtained intoAnd it is broadcasted.
(4) as shown in Figure 4 b, it receives allAfterwards, particle of the R to oneself
Bell measurement is carried out, is obtainedIt is combined into MR。
(5) according to the measurement result of multi-party entanglement transfer rule, following formula is set up on (i-1) l+1 to 2il 2:
WhereinIt isMeasurement result before coding.Then, receiving node R passes through comparisonWithObtain l
A encoding operation UX, S is come to obtainiThe position 2l message:
To obtain S1Message, following formula sets up on the 1st to 2l
Then, R passes through comparison M 'SiWith MSi, can get l encoding operation, thus to obtain S1The position 2l message.
R obtains each sending node SiThe position the 2l message of (1≤i≤m), terminates more modes.
The quantum communications of multi-mode may be implemented in a kind of multi-point cooperative transmission method of quantum entanglement exchange, have following property
Matter:
(1) the whole network is shared
In a kind of multi-point cooperative transmission method of quantum entanglement exchange of the present invention, a pair of of multi-mode, which realizes, to be similar to
The confidential corespondence of the point to multi--point of QSS, many-one mode realize multiple sending nodes and are received by cooperative cooperating to one
Node sends message.After many-one Pattern completion, the message that unique receiving node R may want to receive shares to certain
A little sending node Si(1≤i≤m), the node definition for needing message shared these are information node.Receiving node R only need by
Measurement result MRIt is sent to information node by Teleportation mode, they can be obtained all sending node Si(1≤i's≤m)
Message.
Enable transmission MRThe stealthy number of required progress is T, information node S in best-case such as Fig. 5 a1It is shown, when straight with R
When connecing shared EPR channel, R can be by MRIt is directly sent to by Teleportation mode, at this time T=1.In worst case such as Fig. 5 a
Information node SpShown, in the middle position of whole receiving nodes, distance R is farthest, and R needs to utilize S at this time1, S2, S(p-1)
It establishes and routes as relay node, they need to assist R and S using EPR resourcepTeleportation, thereforeWhereinSymbol expression rounds up result.For any one information node, need be using Teleportation number
When R wishes to share to message into whole Si, information node number is m, i.e., it is total that full contract network is gradually completing message
It enjoys, at this time T=m.As shown in Figure 5 b, only need R by M at this timeRAdjacent two are sent in a manner of Teleportation by EPR channel
A node, i.e. S1And Sm, then S1, SmAgain respectively by MRIt is sent to S2And Sm-1, and so on until whole nodes receive MR。
Since each node and adjacent node directly carry out Teleportation, relay node, therefore T=m are not used.
(2) utilization of resources
The resource used in scheme be mainly EPR tangle to classical bit, these are all the basic of quantum communication network
Resource, in previous quantum communication network, mainly there are two purposes for the EPR resource of node: first is that and directly shared EPR channel
Node communicated；Second is that helping the remote node of no direct EPR channel to realize communication as relay node, relay at this time
The EPR resource of node provides help for the communication of other nodes, without sending oneself message.
In order to facilitate the description utilization of resources, the service efficiency G that we define EPR couples is as follows:
Wherein M is the received message total amount of all nodes, and R is the quantity that the EPR of network consumption is tangled pair.G features EPR
Pair service efficiency, i.e., the EPR of each consumption transmits to how many information is realized.Enabling nodes quantity is that (m+1) is a,
Including sending node and receiving node, m >=0.The transmission message-length for enabling each sender is l, l > 0.The money of scheme
Source consumption and efficiency summarize such as table 1.
Table 1
(3) safety analysis
A kind of multi-point cooperative transmission method of quantum entanglement exchange of the present invention aims at the multiple spot in quantum communication network
Communication for coordination.Specifically, scheme realizes that point to multi--point or multiple spot pass the message of any by multi-node collaborative cooperation
It is defeated, therefore cooperative cooperating is the smooth premise of guarantee scheme.
The basic security requirement of scheme is as follows: in a pair of of multi-mode, if there is receiving node Ri(1≤i≤l) is robbed
Hold and lie about the measurement result of oneselfThis will ruin a plan, and sending node S should be able to be detected whether in the presence of lie
Node, so that bring be avoided to endanger；In many-one mode, all sending node Si(1≤i≤m) can not know other sections
The message of point, only receiving node R can receive all message.
In a pair of of multi-communication mode, EPR has been attacked if there is external attacker and has tangled channel or some reception section
Point RiIt is held as a hostage, to lie about the measurement result of oneselfIt then will affect all receiving node RiDecoding result, to side
Case causes damage.Therefore step 3.4 is introduced in a pair of of multi-mode, in all receiving node RiBroadcast oneself
Afterwards, sending node S carries out Bell measurement to the particle of oneself and obtains MS, S can be according to MSM ' is recovered with encoding operationS, then examine
Whether true test multi-party entanglement transfer measurement result rule:
If above formula is set up, illustrate that measurement result meets the measurement result rule of multi-party entanglement transfer, channel is not attacked
It hits, receiving node RiMeasurement result is not lied about, scheme can proceed with.
In many-one communication pattern, need to guarantee sending node SiMutual hair is not known between (1≤i≤m) mutually
Message is sent, only receiving node R can receive whole sending node SiThe message of (1≤i≤m).Receiving node R is according to as follows
Two formulas each sending node S can be obtainediThe position the 2l message of (1≤i≤m):
Since there is no externally announce M by RR, all sending node SiIt can not all know the transmission message of other sending nodes,
To ensure that the demand for security of many-one mode.
According to above-mentioned analysis, this programme can satisfy many-one mode and a pair of of multi-mode to the basic need of communication security
It asks.
The content that description in the present invention is not described in detail belongs to the prior art well known to professional and technical personnel in the field.
The above is only a kind of preferred embodiment of the multi-point cooperative transmission method of quantum entanglement exchange of the present invention, is answered
When pointing out, for those skilled in the art, a kind of multiple spot of quantum entanglement exchange of the present invention is not being departed from
Under the premise of collaborative transmission method principle, it can also make several improvements and retouch, these improvements and modifications also should be regarded as this hair
A kind of protection scope of the multi-point cooperative transmission method of bright quantum entanglement exchange.
Claims (1)
1. a kind of multi-point cooperative transmission method of quantum entanglement exchange, it is comprised the steps of:
Step 1. has multiple node N of communication requirement1, N2..., NkNetwork is set up, network structure is as follows: between adjacent node
Channel, i.e. N are tangled with EPRiRespectively with Ni-1And Ni+1Channel, N are tangled with EPR1Respectively with N2And NkLetter is tangled with EPR
Road, NkRespectively with N1And Nk-1Channel is tangled with EPR；Network node is joined end to end by EPR channel, forms closed circular；Its
In, 2≤i≤k-1；
Step 2. is according to all node NiCommunication requirement, negotiate communication pattern, that is, determine a pair of of multi-mode or many-one mould
Formula；If carrying out a pair of of multi-mode, 3 are entered step；Otherwise, if carrying out many-one mode, 4 are entered step；Wherein, 1≤i
≤k；
Step 3. network executes a pair of of multi-mode, this mode some node N suitable for networksIt needs to send to other nodes and disappear
The scene of breath, wherein 1≤s≤k；The node N of message will be sentsIt renames as S, wherein 1≤s≤k, remaining node NiTo connect
Receive node, wherein 1≤i≤k, i ≠ s enable m=k-1, and by remaining node NiIt renames as R1, R2..., Rm, wherein 1≤
i≤k,i≠s；Sender S is to receiving node RiThe message-length of transmission is 2l, wherein 1≤i≤m, l > 0；
Step 4. network executes many-one mode, which is suitable for only one receiving node Nr, wherein 1≤r≤k；Remaining
Node NiFor the scene of sending node, wherein 1≤i≤k, i ≠ r；By receiving node NrIt renames as node R, wherein 1
≤ r≤k, enables m=k-1, by sending node NiIt renames as S1, S2..., Sm, wherein 1≤i≤k, i ≠ r；Each transmission section
Point SiThe message-length of transmission is 2l, wherein 1≤i≤m；
Wherein, steps are as follows for the specific execution of a pair of of multi-mode described in step 3:
Step 3.1. sending node S is ready to and each l EPR of left and right adjacent node tangles particleWithJ is particle
Number, wherein 1≤j≤l；Whole receiving node RiIt is ready to respectively and each l EPR of left and right adjacent node tangles particle
WithWherein, 1≤i≤m；
2l message are divided into l parts by step 3.2. sending node S, and 2 every part, then every part of 2 message are executed volume by S in order
Code operation UXTo particleOn, wherein 1≤j≤l, each encoding operation represent 2 message；Specific encoding operation is as follows:
All receiving node R of step 3.3.iRespectively to the particle of oneselfCarry out Bell measurement, wherein 1≤j≤l, 1≤i
≤ m obtains l parts of measurement resultsWherein 1≤j≤l, each receiving node RiIn order by the whole measurement results of oneself
It is combined intoThe length is 2l；Then, each receiving node RiIt will be respectiveIt is broadcasted；
Particle of the step 3.4. sending node S to oneselfCarry out Bell measurement, wherein 1≤j≤l obtains l parts of measurement knots
FruitWherein, 1≤j≤l obtains M after splicingS；According to encoding operation UX, S willRestore the state to before encodingWherein, 1≤j≤l；Then, S peer-to-peerInto
Performing check, wherein O2lIt is to be all the sequence that the length of 0 composition is 2l；If equation is invalid, S terminates communication, conversely, S is broadcasted
Measurement result MS；
The each receiving node R of step 3.5.iThe measurement result broadcasted according to whole receiving nodesWith the measurement result M of SS,
In, 1≤i≤m is obtainedPass through comparison M againSWith M 'S, byObtain l
A encoding operation UX, to obtain the position the 2l message of S coding；Then whole receiving node RiThe position 2l for all obtaining sending node S disappears
Breath；Wherein, 1≤i≤m；
Wherein, the specific implementation step of many-one mode described in step 4 is as follows:
Step 4.1. receiving node R is ready to and each l EPR of left and right adjacent node tangles particleWithJ is particle
Number；Wherein, 1≤j≤ml；Whole sending node SiIt is ready to respectively and each ml particle that left and right adjacent node is shared
WithWherein, 1≤i≤m；
The each sending node S of step 4.2.iRespectively by the 2l message coding of oneself to particle, wherein 1≤i≤m；
Encoding operation is UX, wherein (i-1) l≤j≤il；Each encoding operation encodes 2 message；
The each sending node S of step 4.3.iTo the particle of oneselfBell measurement is carried out, ml measurement result is obtainedCombination is obtained intoAnd it is broadcasted；Wherein, 1≤j≤ml, 1≤i≤m；
Step 4.4. receiving node R receives allAfterwards, to the particle of oneselfBell measurement is carried out, is obtainedAnd it is combined into MR；Wherein, 1≤j≤ml, 1≤i≤m；
Step 4.5. receiving node R passes throughIt obtainsState before codingHave by the comparison on the 2nd (i-1) l+1 to the position 2ilObtain l encoding operation UX, each UX
Corresponding 2 message, then R obtains each SiEach 2l message, wherein 1≤i≤m.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611160719.7A CN106685649B (en) | 2016-12-15 | 2016-12-15 | A kind of multi-point cooperative transmission method based on quantum entanglement exchange |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611160719.7A CN106685649B (en) | 2016-12-15 | 2016-12-15 | A kind of multi-point cooperative transmission method based on quantum entanglement exchange |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106685649A CN106685649A (en) | 2017-05-17 |
| CN106685649B true CN106685649B (en) | 2019-10-11 |
Family
ID=58869443
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611160719.7A Expired - Fee Related CN106685649B (en) | 2016-12-15 | 2016-12-15 | A kind of multi-point cooperative transmission method based on quantum entanglement exchange |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106685649B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108494558B (en) * | 2018-02-13 | 2021-04-30 | 克洛斯比尔有限公司 | Method and system for implementing fair switching |
| CN113438032B (en) * | 2021-07-06 | 2023-02-17 | 中国工商银行股份有限公司 | Quantum communication method and device |
| CN113890627B (en) * | 2021-09-27 | 2022-08-16 | 北方工业大学 | Quantum cooperation multicast method based on hybrid topological structure |
| CN115907019B (en) * | 2023-01-09 | 2023-11-07 | 苏州浪潮智能科技有限公司 | Quantum computer for weather prediction |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301098A (en) * | 2014-09-01 | 2015-01-21 | 北京航空航天大学 | Opportunistic quantum network coding method |
| CN105915335A (en) * | 2016-05-09 | 2016-08-31 | 浙江工商大学 | Multi-party quantum private comparison method based on Bell state entanglement swapping |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9509506B2 (en) * | 2011-09-30 | 2016-11-29 | Los Alamos National Security, Llc | Quantum key management |
-
2016
- 2016-12-15 CN CN201611160719.7A patent/CN106685649B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301098A (en) * | 2014-09-01 | 2015-01-21 | 北京航空航天大学 | Opportunistic quantum network coding method |
| CN105915335A (en) * | 2016-05-09 | 2016-08-31 | 浙江工商大学 | Multi-party quantum private comparison method based on Bell state entanglement swapping |
Non-Patent Citations (2)
| Title |
|---|
| An Efficient Protocol for the Secure Multi-party Quantum Summation;Xiu-Bo Chen et al;《Int J Theor Phys (2010)》;20101231;全文 * |
| Quantum Secret Sharing Based on Multi-Particle Entanglement;GUO Fen-zhuo et al;《THE JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOMMUNICATIONS》;20051231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106685649A (en) | 2017-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106685649B (en) | A kind of multi-point cooperative transmission method based on quantum entanglement exchange | |
| He et al. | Quantum key agreement protocols with four-qubit cluster states | |
| US20080313462A1 (en) | Apparatus and method for deriving keys for securing peer links | |
| CN109995510A (en) | A kind of quantum key relay services method | |
| CN107455012A (en) | Establish safe NAN data link | |
| CN105846999B (en) | Multi-party quantum key agreement method based on one-way transmission circuit | |
| CN107786280A (en) | It is a kind of based on the super tripartite's quantum safety direct communication method for tangling Bel's state | |
| Xu et al. | An efficient protocol for the quantum private comparison of equality with a four-qubit cluster state | |
| CN109995513A (en) | A kind of quantum key Information Mobile Service method of low latency | |
| CN108462573A (en) | A kind of flexible quantum safety moving communication means | |
| CN106685654A (en) | Quantum secret key distribution method with function of bidirectional identity authentication | |
| Chong et al. | The enhancement of three-party simultaneous quantum secure direct communication scheme with EPR pairs | |
| Min et al. | Novel multi-party quantum key agreement protocol with g-like states and bell states | |
| Chen et al. | Centrally controlled quantum teleportation | |
| CN107147492A (en) | A kind of cipher key service System and method for communicated based on multiple terminals | |
| CN110138550B (en) | QKD network system model construction method | |
| CN106789009A (en) | Multi-party quantum privacy comparative approach based on d grades of cat state and d grades of Bell state entanglement transfer | |
| CN110350968A (en) | Chain type Teleportation method is tieed up based on the d that relay node measurement result is sent at random | |
| Zhou et al. | Novel quantum deterministic key distribution protocols with entangled states | |
| CN111314336A (en) | Dynamic transmission path construction method and system for anti-tracking network | |
| Yang et al. | Revisiting the security of secure direct communication based on ping-pong protocol [Quantum Inf. Process. 8, 347 (2009)] | |
| CN109510706A (en) | Surpass the heterogeneous wireless communication method and system of Entangled State based on photon | |
| CN110635907A (en) | Controlled quantum conversation method with identity authentication function based on GHZ-like state | |
| CN108599943A (en) | The multi-party quantum privacy comparative approach suitable for stranger based on d grades of single photons | |
| CN109495262B (en) | Quantum key distribution method with dense coding characteristic in quantum communication 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210125 Address after: G3-21, artificial intelligence Industrial Park, 88 Jinjihu Avenue, Suzhou Industrial Park, 215000, Jiangsu Province Patentee after: Suzhou san60 Intelligent Security Technology Co.,Ltd. Address before: 100191 No. 37, Haidian District, Beijing, Xueyuan Road Patentee before: BEIHANG University |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20191011 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |