CN106656348A - Position distribution method for entangled particle pair distribution nodes in quantum communication - Google Patents
Position distribution method for entangled particle pair distribution nodes in quantum communication Download PDFInfo
- Publication number
- CN106656348A CN106656348A CN201611163869.3A CN201611163869A CN106656348A CN 106656348 A CN106656348 A CN 106656348A CN 201611163869 A CN201611163869 A CN 201611163869A CN 106656348 A CN106656348 A CN 106656348A
- Authority
- CN
- China
- Prior art keywords
- node
- distribution
- particle
- quantum communications
- path
- 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
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
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Optics & Photonics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention relates to a position distribution method for entangled particle pair distribution nodes in quantum communication. The method finds out set positions of the entangled particle pair distribution nodes by iteration, and in each round of iteration, executes the following steps of: selecting two quantum communication nodes which are at the longest Euclidean distance from a quantum communication node set uncovered by a distribution range of the entangled particle pair distribution nodes, calculating all shortest paths between two nodes, selecting a plurality of pairs of adjacent quantum communication nodes from each shortest path, presetting the entangled particle pair distribution node at a midpoint of a link between each pair of quantum communication nodes, and calculating a number X of the quantum communication nodes in each path, which are covered by the distribution range of the preset entangled particle pair distribution nodes, and selecting a path with the maximum X value to carry out setting of the entangled particle pair distribution nodes. The iterating process is repeated until all the quantum communication nodes are covered. The position distribution method disclosed by the invention can be used for a network diagram with a random number of quantum communication nodes and a random topological structure, and is simple in execution process.
Description
Technical field
The present invention relates to tangle particle pair in quantum communications and quantum entanglement switching technology, more particularly to a kind of quantum communications
The position distribution method of distribution node.
Background technology
Quantum communications refer to a kind of new communication modes that information transmission is carried out using entangled quantum effect.For realization amount
Son communication, communication terminal needs to share and tangles particle pair, carries out quantum state information to transmitting terminal by quantum e measurement technology and carries
Take, as long as the quantum state of transmitting terminal particle changes, necessarily affect another therewith in the particle of Entangled State, last root
Unitary transformation is carried out to the quantum state of receiving terminal according to the measurement result of transmitting terminal, so as to complete effective transmission of information.
Compared to classical communication, the application prospect of quantum communications is more extensive.First, quantum communications breach classical information
The restriction of shannon formula by, bandwidth and transfer rate are brought up to infinitely, meet remote space, Large Copacity, easy networking, height
The requirement of the aspects such as speed transmission.Secondly as the strict application conditions of entangled quantum effect, quantum communications can be realized protecting completely
Close communication, all plays an important role in fields such as military affairs, national defence, the developments of the national economy.Finally, the characteristics of quantum communications time delay is zero
Can realize that superlight speed communicates, therefore the development of quantum communications will accelerate the process in people's exploration of the universe space.
In quantum communication network, generation is tangled the equipment of particle pair and is referred to as to tangle particle to distribution node, participates in letter
The node of breath transmission is quantum communications node.Tangle particle and particle is tangled to the distribution of multiple quantum communications nodes to distribution node
It is right, make to set up the quantum channel for transmitting the quantum state of carrying information between quantum communications node.If source node and purpose section
Point is directly shared to tangle particle pair, then two nodes directly can direct transmission of quantum state；If source node and destination node be not same
One tangle particle to the distribution of distribution node in the range of, then need between source node and destination node exist a quantum path,
Exist to share between adjacent node in the path and tangle particle pair, then set up between source and destination node by methods such as entanglement transfers
Quantum entanglement.
Therefore, for quantum communication network, company of the quantum entanglement particle to the position of distribution node to network how is distributed
The general character plays vital effect.But the work that at present quantum communication network builds is mostly based on simple network topology knot
Structure, predominantly point to point network topology, and the star comprising several nodes or bus-network topology on a small quantity.To complex network
Quantum communication network research under structure is less, and research work is also concentrated mainly on network safety filed and quantum state transmission, right
There is vacancy in the research for how improving network connectivty.
The content of the invention
It is an object of the invention to provide a kind of particle that tangles for quantum communication network divides distribution node position
Cloth method, the position for tangling particle to distribution node is distributed according to the positional information of quantum communications node, makes quantum communications net
The connectedness of network is improved.
In order to achieve the above object, the present invention proposes to tangle position distribution of the particle to distribution node in a kind of quantum communications
Method, including step：
(1) with the quantum communications node set in quantum communication network as vertex set, network G (V, E) is built；Wherein, V
The quantum communications node set in quantum communication network is represented, E is represented and meet in quantum communication network DijThe quantum communications of ＜ 2R
The set of hop, DijThe distance between quantum communications node i and quantum communications node j are represented, R is represented and tangled particle pair
The distribution scope radius of distribution node；
(2) to V in each quantum communications node be numbered；Definition is tangled particle and is to distribution node coordinate set
Q, is combined into M by the collection for tangling the quantum communications node serial number that particle is covered to the distribution scope of distribution node, is not tangled grain
The collection of the quantum communications node serial number that son is covered to the distribution scope of distribution node is combined intoInitialization
(3) calculateIn Euclidean distance in each quantum communications node and network between other quantum communication nodes, choose
The farthest quantum communications node of Euclidean distance, and find out all shortest paths between the two quantum communications nodes；To find out
All paths be included into set P；
(4) to P in every paths perform following steps：
By quantum communications node in path by tangle particle to distribution node distribute scope cover number it is most for the purpose of,
One group of preset is found out in respective path, as pre-seting the location point that tangles particle to distribution node；Define kth bar in P
In path, arrange according to preset in the case of tangling particle to distribution node, particle is tangled in the k of path to distribution node point
The quantum communications interstitial content for sending out scope covering is Xk；
(5) according to the result of calculation of step (4) update Q, M andIncluding step：
Choose XkThe maximum paths of value, are designated as kX-MAX；In path kX-MAXIn preset on arrange tangle particle pair
Distribution section；By path kX-MAXIn arranged tangle particle to distribution section coordinate count Q, tangled particle to distribution section distribution model
The quantum communications node serial number for enclosing covering counts M；Update
(6) calculate after updatingNumber s of middle remaining quantum communication node, if s ＞ 1, return to step (3)；If s=1,
Then proceed to step (7)；If s=0, stop iteration；
(7) in V choose withIn last quantum communications node the nearest point of Euclidean distance, in 2 lines
Midpoint arranges and tangles particle to distribution node, and this is tangled into particle charges to Q to the coordinate of distribution node.
Further, the method for selection preset is in each path in the step (4) from P：
(4.1) sum that m is path in P is defined, the length of path k is H；Definition set M0、Q0, variable S0、h；
(4.2) initialize, k=1, h=1,S0=0；
(4.3) the link midpoint in path selection k between h-th and the h+1 quantum communications node is preset, and will
The default point coordinates selected counts Q0；Calculate the quantum communications node with the preset as the center of circle, in coverages of the R as radius
Number x, to this x quantum communications node temporary marker is done, and the numbering of the quantum communications node after mark is counted into M0；Make S0
=S0+ x, proceeds to step (4.4)；
(4.4) judge whether to meet h+1≤H；If meeting, h=h+1 is made, proceed to step (4.5)；Otherwise, execution step
(4.6)；
(4.5) judge whether the h+1 quantum communications node in the k of path is labeled；If not being labeled, step is returned
Suddenly (4.3)；If being labeled, return to step (4.4)；
(4.6) X is madek=S0, export Xk、Q0And M0；Wherein, Q0The coordinate of the preset to select in the k of path；M0It is to select
When the preset for going out is as particle is tangled to the location point of distribution node, particle is tangled in the k of path model is distributed to distribution node
Enclose the numbering of the quantum communications node of covering.
Beneficial effect：From the foregoing, it will be observed that tangling position of the particle to distribution node in a kind of quantum communications of present invention offer
Location mode, can be used for containing arbitrarily quantum communication node number and randomly topologically structured network-in-dialing figure, its implementation procedure
It is simple and clear, and be easily achieved, only it is to be understood that the positional information of quantum communications node just can be distributed tangles particle to distribution section
The position of point, and the connectedness of quantum communication network can be calculated, tangle situation phase of the particle to distribution node with random distribution
Than network connectivty is significantly improved.
Description of the drawings
Fig. 1 is the workflow diagram of the present invention；
Fig. 2 is that point counting cloth of falling into a trap of the invention tangles workflow diagram of the particle to the shortest path of distribution node；
Fig. 3 is the network topological diagram G in the embodiment of the present invention0(V,E0)；
Fig. 4 is the network topological diagram G (V, E) in the embodiment of the present invention；
Fig. 5 is that network of the particle to distribution node is tangled in first shortest path setting first in the embodiment of the present invention
Figure；
Fig. 6 is that network of the particle to distribution node is tangled in first shortest path setting second in the embodiment of the present invention
Figure；
Fig. 7 is that network of the particle to distribution node is tangled in the setting of Article 5 shortest path in the embodiment of the present invention；
Fig. 8 is to arrange the 3rd in the embodiment of the present invention to tangle network of the particle to distribution node；
Fig. 9 is to tangle network of the particle to distribution node Optimal Distribution in the embodiment of the present invention.
Specific embodiment
The present invention is further described below in conjunction with the accompanying drawings.
The workflow of the present invention is as shown in figure 1, comprise the following steps：
(1) for the network topological diagram G containing N number of quantum communications node0(V,E0), it is known that each quantum communications node
Numbering and position, calculate the distance between any two quantum communications node, and generate the matrix D that a M*M is tieed up, D=[Dij],
Element DijRepresent the distance between i-th quantum communications node and j-th quantum communications node.Distribution is saved according to particle is tangled
The distribution scope radius R of point, finds DijAll connection E less than 2R, regenerate network topological diagram G (V, E).
(2) it is Q that definition tangles particle to distribution node location sets, and distribution scope of the particle to distribution node is tangled
The quantum communications node set of covering is M, is not tangled the quantum communications node that particle is covered to the distribution scope of distribution node
Collection is combined intoInitialization
(3) calculateIn Euclidean distance in each quantum communications node and network between other quantum communication nodes, choose
The farthest quantum communications node of Euclidean distance, and find out all shortest paths between the two quantum communications nodes；To find out
All paths be included into set P；
(4) to P in every paths perform following steps：Particle is tangled to distribution section with quantum communications node in path
For the purpose of the number of point distribution scope covering is most, one group of preset is found out in respective path, as pre-seting particle is tangled
Location point to distribution node；Define in P in kth paths, arrange according to preset and tangle situation of the particle to distribution node
Under, it is X to be tangled particle to the quantum communications interstitial content of distribution node distribution scope covering in the k of pathk；
(5) according to the result of calculation of step (4) update Q, M andIncluding step：
Choose XkThe maximum paths of value, are designated as kX-MAX；In path kX-MAXIn preset on arrange tangle particle pair
Distribution section；By path kX-MAXIn arranged tangle particle to distribution section coordinate count Q, tangled particle to distribution section distribution model
The quantum communications node serial number for enclosing covering counts M；Update
(6) calculate after updatingNumber s of middle surplus element, if s ＞ 1, return to step (3)；If s=1, step is proceeded to
Suddenly (7)；If s=0, stop iteration；
(7) in V choose withIn last quantum communications node the nearest point of Euclidean distance, in 2 lines
Midpoint arranges and tangles particle to distribution node, and this is tangled into particle charges to Q to the coordinate of distribution node.
In above-mentioned flow process update Q, M andIdiographic flow as shown in Fig. 2 including the following steps for performing successively：
(S1) sum that m is path in P is defined, the length of path k is H；Definition set Q0、Q1、M0、M1, variable S0、S1、
h；
(S2) initializeS1=0, k=1, h=1；
(S3) initializeS0=0；
(S4) the link midpoint in path selection k between h-th and the h+1 quantum communications node is preset, and will
The default point coordinates selected counts Q0；Calculate the quantum communications node with the preset as the center of circle, in coverages of the R as radius
Number x, to this x quantum communications node temporary marker is done, and the numbering of the quantum communications node after mark is counted into M0；Make S0
=S0+ x, proceeds to step (S5)；
(S5) judge whether to meet h+1≤H；If meeting, h=h+1 is made, proceed to step (S6)；Otherwise, execution step
(S7)；
(S6) judge whether the h+1 quantum communications node in the k of path is labeled；If not being labeled, step is returned
Suddenly (S4)；If being labeled, return to step (S5)；
(S7) judge whether to meet S1＜ S0；If meeting, Q is made1=Q0, M1=M0, k=k+1, S1=S0, proceed to step
(S8)；If being unsatisfactory for, k=k+1 is made, proceed to step (S8)；
(S8) judge whether to meet k≤m；If meeting, return to step (S3), otherwise execution step (S9)；
(S9) update and tangle particle to distribution node location sets Q=Q ∪ Q1, the quantum communications set of node M being capped
=M ∪ M1, uncovered quantum communications set of node
Below by taking a network comprising 10 quantum communications nodes as an example, being embodied as the present invention is illustrated.
(1) it is as shown in Figure 3 the network topological diagram G containing 10 quantum communications nodes0(V,E0), wherein V=1,2,3,
4,5,6,7,8,9,10 }, quantum communications node coordinate set (9.6284,8.7860), (7.8237,40.5547),
(13.6181,0.9666),(9.1359,25.6623),(1.7650,45.8873),(3.5480,37.4109),(1.1224,
38.9823), (30.6637,18.2736), (13.5471,48.1578), (23.4837,17.7484) }, calculate any two points
The distance between, and generator matrix D：
Distribution scope radius R=20 of the particle to distribution node is tangled in setting, is as shown in Figure 4 connection DijThe amount of≤2R
The network topological diagram G (V, E) that sub- communication node is regenerated.
(2) it is Q that definition tangles particle to distribution node location sets, and distribution scope of the particle to distribution node is tangled
The quantum communications node set of covering is M, is not tangled the quantum communications node that particle is covered to the distribution scope of distribution node
Collection is combined intoInitialization
(3) calculateIn Euclidean distance in each quantum communications node and network between other quantum communication nodes, choose
The farthest quantum communications node of Euclidean distance is 3 and 9, by Yen algorithms calculate between quantum communication node 3 and 9 it is all of most
Short path set P=(3,1,9), (3,4,9), (3,6,9), (3,8,9), (3,10,9) }, note being obtained using distinct methods
Set of minimal paths P does not affect this patent to implement；
(4) to P in every paths perform following steps：Particle is tangled to distribution section with quantum communications node in path
For the purpose of the number of point distribution scope covering is most, one group of preset is found out in respective path, as pre-seting particle is tangled
Location point to distribution node；Define in P in kth paths, arrange according to preset and tangle situation of the particle to distribution node
Under, it is X to be tangled particle to the quantum communications interstitial content of distribution node distribution scope covering in the k of pathk, idiographic flow is such as
Under：
(4.1) in the present embodiment, m=5, H=2；Definition set M0、Q0, variable S0、h；
(4.2) initialize, k=1, h=1,S0=0；
(4.3) P (1)=(3,1,9), h=1, P (1) represent path 1, set at the midpoint of the line of quantum communications node 3 and 1
Put and tangle particle to distribution node, coordinate for (11.6233,4.8763), Q0=(11.6233,4.8763) }, as shown in figure 5,
The quantum communications interstitial content x=3 that the distribution node is covered, then S0=3, and the quantum communications node to being capped does interim mark
Note, charges to M0={ 1,3,10 }；
(4.4) due to h+1=2, it is clear that meet h+1≤H, then h=h+1=2 is made；
Link midpoint in path selection k between h-th and the h+1 quantum communications node is preset, and will be selected
Default point coordinates count Q0；Calculate the quantum communications interstitial content with the preset as the center of circle, in coverages of the R as radius
X, to this x quantum communications node temporary marker is done, and the numbering of the quantum communications node after mark is counted into M0；Make S0=S0+
X, proceeds to step (4.4)；
(4.5) Jing and M0Compare understand, P (1)=(3,1,9) in the 3rd quantum communications node 9 be not belonging to M0, then in amount
The midpoint of the line of sub- communication node 1 and 9 arranges distribution node, coordinate for (11.5878,28.4719), as shown in fig. 6, the distribution
The quantum communications interstitial content x=8 of coverage, then S0=11, Q0=(11.6233,4.8763), (11.5878,
28.4719), M0={ 1,2,3,4,6,7,9,10 }；
(4.6) X is madek=S0, export Xk、Q0And M0；Wherein, Q0The coordinate of the preset to select in the k of path；M0It is to select
When the preset for going out is as particle is tangled to the location point of distribution node, particle is tangled in the k of path model is distributed to distribution node
Enclose the numbering of the quantum communications node of covering.
(4.7) due to h+1=3, h+1≤H is unsatisfactory for, therefore terminates to tangle path P (1) setting particle to distribution section
Point；
(4.8) judge to learn S1<S0, then Q1=(11.6233,4.8763), (11.5878,28.4719) }, M1=1,
2,3,4,6,7,9,10 }, k=k+1=2；
(4.9) due to k=2 ＜ m, then return to step (3.3), to P (k), (k=2,3,4,5) carry out identical operation, respectively
It is as shown in the table that the quantum communications node total number mesh situation that can be covered after distribution node is set, the 5th article of shortest path on shortest path
The quantum communications interstitial content that footpath P (5) is covered is most, as shown in fig. 7, therefore repeating after aforesaid operations, Q1=(18.5509,
9.3575), (18.5154,32.9531) }, M1={ 1,2,3,4,6,7,8,9,10 }；
The capped situation of quantum communications node is as shown in the table in each path：
| k | P(k) | Xk |
| 1 | (3,1,9) | 11 |
| 2 | (3,4,9) | 11 |
| 3 | (3,6,9) | 11 |
| 4 | (3,8,9) | 10 |
| 5 | (3,10,9) | 12 |
(5) according to the result of calculation of step (4) update Q, M andIncluding step：
XkValue maximum is the 5th paths, is designated as kX-MAX=5；In path kX-MAXIn preset on arrange tangle particle
To distribution section；By path kX-MAXIn arranged tangle particle to distribution section coordinate count Q=(18.5509,9.3575),
(18.5154,32.9531) }, by tangled particle to distribution section distribution scope cover quantum communications node serial number count M=1,
2,3,4,6,7,8,9,10}；Update
(6) calculate after updatingNumber s=1 of middle surplus element；
(7) node nearest with the Euclidean distance of quantum communications node 5 in V is 7, as shown in Figure 9 in 2 lines
Point setting tangles particle to distribution node, tangle particle to the coordinate of distribution node for (1.4437,42.4348), and charge to Q=
(18.5509,9.3575), (18.5154,32.9531), (1.4437,42.4348) }.
The above is only the preferred embodiment of the present invention, it should be pointed out that：For the ordinary skill people of the art
For member, under the premise without departing from the principles of the invention, some improvements and modifications can also be made, these improvements and modifications also should
It is considered as protection scope of the present invention.
Claims (2)
1. position distribution method of the particle to distribution node is tangled in a kind of quantum communications, it is characterised in that including step：
(1) with the quantum communications node set in quantum communication network as vertex set, network G (V, E) is built；Wherein, V is represented
Quantum communications node set in quantum communication network, E is represented and meet in quantum communication network DijThe quantum communications node of ＜ 2R
Between path set, DijThe distance between quantum communications node i and quantum communications node j are represented, R is represented and tangled particle to distribution
The distribution scope radius of node；
(2) to V in each quantum communications node be numbered；It is Q that definition tangles particle to distribution node coordinate set, is entangled
The collection for twining the quantum communications node serial number that particle is covered to the distribution scope of distribution node is combined into M, is not tangled particle to distribution
The collection of the quantum communications node serial number that the distribution scope of node is covered is combined intoInitialization
(3) calculateIn Euclidean distance in each quantum communications node and network between other quantum communication nodes, choose European
Apart from farthest quantum communications node, and find out all shortest paths between the two quantum communications nodes；By the institute for finding out
There is path to be included into set P；
(4) to P in every paths perform following steps：
By quantum communications node in path by tangle particle to distribution node distribute scope cover number it is most for the purpose of, right
Answer and find out in path one group of preset, as pre-seting the location point that tangles particle to distribution node；Define kth paths in P
In, arrange according to preset in the case of tangling particle to distribution node, particle is tangled in the k of path model is distributed to distribution node
The quantum communications interstitial content for enclosing covering is Xk；
(5) according to the result of calculation of step (4) update Q, M andIncluding step：
Choose XkThe maximum paths of value, are designated as kX-MAX；In path kX-MAXIn preset on arrange tangle particle to distribution
Section；By path kX-MAXIn arranged tangle particle to distribution section coordinate count Q, tangled particle to distribution section distribution scope cover
The quantum communications node serial number of lid counts M；Update
(6) calculate after updatingNumber s of middle remaining quantum communication node, if s ＞ 1, return to step (3)；If s=1, turn
Enter step (7)；If s=0, stop iteration；
(7) in V choose withIn last quantum communications node the nearest quantum communications node of Euclidean distance, at 2 points
The midpoint of line arranges and tangles particle to distribution node, and this is tangled into particle charges to Q to the coordinate of distribution node.
2. position distribution method of the particle to distribution node is tangled in a kind of quantum communications according to claim 1, and it is special
Levy and be, the method that preset is chosen in each path in the step (4) from P is：
(4.1) sum that m is path in P is defined, the length of shortest path is H；Definition set M0、Q0, variable S0、h；
(4.2) initialize, k=1, h=1,S0=0；
(4.3) the link midpoint in path selection k between h-th and the h+1 quantum communications node is preset, and will be selected
Default point coordinates count Q0；Calculate the quantum communications interstitial content with the preset as the center of circle, in coverages of the R as radius
X, to this x quantum communications node temporary marker is done, and the numbering of the quantum communications node after mark is counted into M0；Make S0=S0+
X, proceeds to step (4.4)；
(4.4) judge whether to meet h+1≤H；If meeting, h=h+1 is made, proceed to step (4.5)；Otherwise, execution step (4.6)；
(4.5) judge whether the h+1 quantum communications node in the k of path is labeled；If not being labeled, return to step
(4.3)；If being labeled, return to step (4.4)；
(4.6) X is madek=S0, export Xk、Q0And M0；Wherein, Q0The coordinate of the preset to select in the k of path；M0To select
When preset is as particle is tangled to the location point of distribution node, particle is tangled in the k of path distribution node distribution scope is covered
The numbering of the quantum communications node of lid.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611163869.3A CN106656348B (en) | 2016-12-16 | 2016-12-16 | Particle is tangled to the position distribution method of distribution node in a kind of quantum communications |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611163869.3A CN106656348B (en) | 2016-12-16 | 2016-12-16 | Particle is tangled to the position distribution method of distribution node in a kind of quantum communications |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106656348A true CN106656348A (en) | 2017-05-10 |
| CN106656348B CN106656348B (en) | 2018-12-28 |
Family
ID=58822838
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611163869.3A Active CN106656348B (en) | 2016-12-16 | 2016-12-16 | Particle is tangled to the position distribution method of distribution node in a kind of quantum communications |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106656348B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107248888A (en) * | 2017-05-25 | 2017-10-13 | 东南大学 | That improves quantum communication network connectedness tangles particle to distribution node dispositions method |
| CN107483189A (en) * | 2017-08-08 | 2017-12-15 | 河南理工大学 | A kind of quantum cryptography lock system based on quantum entanglement |
| CN107689866A (en) * | 2017-08-28 | 2018-02-13 | 河南理工大学 | It is a kind of based on the quantum cryptography lock system tangled particle and compensated automatically |
| CN115441960A (en) * | 2022-09-02 | 2022-12-06 | 中国人民解放军国防科技大学 | Method and device for request-first-service entanglement routing based on quantum network |
| CN115529125A (en) * | 2022-07-25 | 2022-12-27 | 北京邮电大学 | Route determining method of distributed quantum entanglement distribution network and related equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110186756A1 (en) * | 2008-02-25 | 2011-08-04 | The University Of Melbourne | Method of fabricating a single photon source |
| CN104754688A (en) * | 2015-04-17 | 2015-07-01 | 东南大学 | Routing method for entangled state based wireless Mesh quantum communication network |
| CN104883304A (en) * | 2015-05-12 | 2015-09-02 | 东南大学 | Method for routing part entangled quantum pair bridging communication network |
| CN105681028A (en) * | 2015-12-28 | 2016-06-15 | 华南师范大学 | Multi-user network system for footballene structure and quantum key distribution method thereof |
| CN106156451A (en) * | 2015-03-16 | 2016-11-23 | 江南大学 | A kind of based on the Mutual coupling technology improving quantum particle swarm |
-
2016
- 2016-12-16 CN CN201611163869.3A patent/CN106656348B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110186756A1 (en) * | 2008-02-25 | 2011-08-04 | The University Of Melbourne | Method of fabricating a single photon source |
| CN106156451A (en) * | 2015-03-16 | 2016-11-23 | 江南大学 | A kind of based on the Mutual coupling technology improving quantum particle swarm |
| CN104754688A (en) * | 2015-04-17 | 2015-07-01 | 东南大学 | Routing method for entangled state based wireless Mesh quantum communication network |
| CN104883304A (en) * | 2015-05-12 | 2015-09-02 | 东南大学 | Method for routing part entangled quantum pair bridging communication network |
| CN105681028A (en) * | 2015-12-28 | 2016-06-15 | 华南师范大学 | Multi-user network system for footballene structure and quantum key distribution method thereof |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107248888A (en) * | 2017-05-25 | 2017-10-13 | 东南大学 | That improves quantum communication network connectedness tangles particle to distribution node dispositions method |
| CN107248888B (en) * | 2017-05-25 | 2019-04-30 | 东南大学 | That improves quantum communication network connectivity tangles particle to distribution node dispositions method |
| CN107483189A (en) * | 2017-08-08 | 2017-12-15 | 河南理工大学 | A kind of quantum cryptography lock system based on quantum entanglement |
| CN107483189B (en) * | 2017-08-08 | 2019-06-21 | 河南理工大学 | A kind of quantum cryptography lock system based on quantum entanglement |
| CN107689866A (en) * | 2017-08-28 | 2018-02-13 | 河南理工大学 | It is a kind of based on the quantum cryptography lock system tangled particle and compensated automatically |
| CN107689866B (en) * | 2017-08-28 | 2019-07-23 | 河南理工大学 | It is a kind of based on the quantum cryptography lock system tangling particle and compensating automatically |
| CN115529125A (en) * | 2022-07-25 | 2022-12-27 | 北京邮电大学 | Route determining method of distributed quantum entanglement distribution network and related equipment |
| CN115441960A (en) * | 2022-09-02 | 2022-12-06 | 中国人民解放军国防科技大学 | Method and device for request-first-service entanglement routing based on quantum network |
| CN115441960B (en) * | 2022-09-02 | 2024-04-12 | 中国人民解放军国防科技大学 | Quantum network-based first-request-first-service entanglement routing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656348B (en) | 2018-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106656348A (en) | Position distribution method for entangled particle pair distribution nodes in quantum communication | |
| CN104936186B (en) | Cognitive radio network spectrum allocation method based on cuckoo searching algorithm | |
| CN109729528A (en) | A kind of D2D resource allocation methods based on the study of multiple agent deeply | |
| CN104467999B (en) | Spectrum sensing algorithm based on quantum leapfrog | |
| CN108401254A (en) | A kind of wireless network resource distribution method based on intensified learning | |
| CN106533679A (en) | Quantum key distribution method based on GHZ state | |
| CN105873214B (en) | A kind of resource allocation methods of the D2D communication system based on genetic algorithm | |
| CN106777449A (en) | Distribution Network Reconfiguration based on binary particle swarm algorithm | |
| CN107248888B (en) | That improves quantum communication network connectivity tangles particle to distribution node dispositions method | |
| CN106789408A (en) | A kind of IPRAN network access layers equipment cyclization rate computational methods | |
| CN113382381A (en) | Unmanned aerial vehicle cluster network intelligent frequency hopping method based on Bayesian Q learning | |
| CN108712746A (en) | One kind partly overlaps channel aggregation betting model and learning algorithm | |
| Lu et al. | Stability of phase difference trajectories of networks of Kuramoto oscillators with time-varying couplings and intrinsic frequencies | |
| CN104394569B (en) | The method that QoS routing is set up based on angle and interference control in wireless D2D networks | |
| CN106230528A (en) | A kind of cognition wireless network frequency spectrum distributing method and system | |
| CN107241273A (en) | A kind of communications ring network structure method to set up based on genetic algorithm | |
| CN107133877A (en) | The method for digging of overlapping corporations in network | |
| CN107368600A (en) | The adjoint point of Random Graph and Edge Coloring algorithm can be distinguished | |
| CN106899407A (en) | A kind of method for designing of remote quantum communication network | |
| Baroni et al. | Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds | |
| CN107358333B (en) | Optimization method is evacuated in multi-ant colony people Che Jingzheng based on entropy-cooperation | |
| CN108667749A (en) | Data dispatching method and device | |
| Mufid et al. | Performance evaluation of PEGASIS protocol for energy efficiency | |
| CN108093496A (en) | A kind of uniformity network-building method based on ISA100.11a standards | |
| CN106793122A (en) | A kind of heterogeneous network minimizes Radio Resource safety distribution method per bit |
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 |