CN108615078A - Hyperspace code forming method - Google Patents
Hyperspace code forming method Download PDFInfo
- Publication number
- CN108615078A CN108615078A CN201810451236.5A CN201810451236A CN108615078A CN 108615078 A CN108615078 A CN 108615078A CN 201810451236 A CN201810451236 A CN 201810451236A CN 108615078 A CN108615078 A CN 108615078A
- Authority
- CN
- China
- Prior art keywords
- information
- group
- hyperspace
- code
- output signal
- 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 25
- 239000002245 particle Substances 0.000 claims abstract description 27
- 239000011159 matrix material Substances 0.000 claims abstract description 23
- 238000009826 distribution Methods 0.000 claims abstract description 21
- 230000009466 transformation Effects 0.000 claims abstract description 11
- 238000004088 simulation Methods 0.000 claims abstract description 6
- 238000006073 displacement reaction Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 4
- 238000006243 chemical reaction Methods 0.000 claims description 3
- 238000012546 transfer Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 10
- 230000005540 biological transmission Effects 0.000 description 7
- 230000014509 gene expression Effects 0.000 description 6
- 239000002096 quantum dot Substances 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000005610 quantum mechanics Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012067 mathematical method Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
- 230000014616 translation Effects 0.000 description 1
Landscapes
- Error Detection And Correction (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a kind of hyperspace code forming methods.Group translating is carried out to the information x of input, before carrying out group translating, first as needed, selection primitive polynomial constitutes quadrature pseudo-random matrix by group translating, information matrix x and quadrature pseudo-random matrix are subjected to multi-simulation transformation, the information after being converted, and a point group is carried out to information；After again by the physical parameter-particle distribution having determined, determine in which kind of " group " be which kind of " distribution ".Last basis " group " and " distribution " information, is fed back and is remapped to the information in classical information domain, and finally obtain hyperspace code.Hyperspace code has the characteristics that superposition, tangles and be concerned with, due to the uncertainty of hyperspace code, i.e. in its uncertain parameter and group (group number is non-determined value), the decoding of information can not be completed, therefore this special information structuring method can be applied to secure data communication.
Description
Technical field
The invention belongs to communication technique fields, and in particular to a kind of hyperspace code forming method.
Background technology
Quantum be it is found that a kind of new information carrier, it will be that one kind after optical signal, electric signal etc. is
The new material base for capableing of load and processing information that informationized society development is provided.Using quantum as information carrier
Mode is known as quantum information (quantum information).Quantum information is in quantum mechanics about quantized system " shape
State " the physical message carried.By the various coherences of quantized system, (such as quantum parallelism, quantum entanglement and quantum can not
Clone etc.), calculated, encode and information transmission completely new information mode.
In message transmitting procedure, that weigh data transmission efficiency is symbol transmission rate RB, referred to as passes code check, also known as accords with
Number rate etc..It indicates the number of transmitted per unit time symbol, and unit is baud (Baud), is denoted as B.Symbol transmission rate
It can be expressed as the average information transmitted in the unit interval or bit number, unit is bps that can be denoted as bit/s or b/
S or bps.Each code element or symbol usually all contain the information content of certain bit numbers.
For quantum information, its common unit is for quantum bit (qubit) -- there are two namely one
The quantized system of state.However different from classical digital status (it is discrete), a two-state quantized system can essentially
It is the superposition state of two states at any time, this two state can also be eigenstate.In quantized system, information is by quantum
Bit stores.Quantum bit can be assumed two states with itself as " 0 " or " 1 ", the two states
It is superposition in synchronization.Simultaneously from quantum-mechanical angle, two particles that may spatially separate are at two
Or it will produce interactional quantum entanglement phenomenon in more than two particle composition systems.Quantum entanglement technology is safe transmission
It is unrelated to transmit information with superlight speed for the encryption technology of information.While it is known that between these particles the speed of " exchange " quickly, but I
Can not but utilize this contact with so fast speed control and transmit information.Simultaneously the electronics in quantum spin to the right with just
The state that electronics spins to the left is associated, therefore quantum also has coherence.
Based on quantum information theory and the above feature, people are carrying out the computer based on quantum theory at present, that is, measure
The research of sub- computer.Quantum computer is to follow quantum mechanics rule to carry out high speed mathematical and logical operation, storage and processing
The physical unit of quantum information.The concept of quantum computer is derived from the research to reversible computer.Quantum computer application be
Quantum bit, can be in multiple states simultaneously, can be only in 0 or 1 binary condition like that rather than traditional computer.
Invention content
The present invention provides a kind of hyperspace code forming method to overcome problems of the prior art.
In order to solve the above technical problems, the present invention provides the constructive method of hyperspace code, include the following steps：
Step 1：Input information is matched and is converted；The matching is in group's size of message length and group of transformation
Unanimously, it selects each primitive polynomial to reach the matrix that requirement needs by group translating apolegamy according to the physical parameter of setting, obtains
Similar-orthogonal pseudo-random extended matrix；The information for being transformed to becoming " 0 " " 1 " information in input information into particulate forms；
Step 2：Weight transfer：Find out positive and negative particle number in the information of particulate forms；
Step 3：Group determines：According to input information particle number and distribution, the distribution in which kind of " group " is determined；
Step 4：Distribution determination refers to the distributing position for inputting particle information in the group of place, or inputs particle information with referring to
With the offset between group's base vector；By steeping Ke Ersi boxes, the setting of bubble Ke Ersi parameters is carried out, is determined more in conversion process
The relevant superposition position of dimension space code, group number flag, displacement position and reversed position；
Step 5：Output, including ambipolar output signal, unipolar output signal and binary format Encoded output signal；
The ambipolar output signal is multi -components output signal, there is three weight, group, particle distribution real components；The unipolarity is defeated
It is multi -components output signal to go out signal, there is three weight, group, particle distribution components；The binary format Encoded output signal
It is constituted with binary format according to the output form of unipolar output signal；
Step 6：Output signal in step 5 is fed back and remapped, is repeated the above steps.
Physical parameter in step 1 includes message length, the number of " 0 " and " 1 ", swarm parameter, information distributed constant, particle
Level parameters and output format.
Transformation in step 1 is specially：Classical information matrix is extended with by the quadrature pseudo-random of combed filter device
Matrix carries out multi-simulation and converts to obtain information converting, is expressed as：
C=H (XP)
In formula, C is information converting, and X is classical information matrix, and P is quadrature pseudo-random matrix.
Signified hyperspace code of the invention includes superposition position successively, group number flag, moves using group as organization unit
Position position and reversed position；The superposition position indicates that the number of " 1 " in information, the group number flag indicate where hyperspace code
Group, the offset that displacement position expression occurs in group are described reversed including judging positioned at upper semigroup or lower semigroup and offset
Position indicates the complementation of information " 1 " and " 0 " in group.
Hyperspace code is expressed by the number of " 1 " or " 0 " and spatial position distribution, and expression formula is：
(N)B=L (M, Ki,Tj·)；
In formula, N represents hyperspace code, and B represents " 0 " and " 1 " numerical value, L representative function relationships, and M represents superposition position, K generations
Table group number flag, T represent reversed position.
Advantageous effect：Compared with prior art, the present invention the building method of the hyperspace code of the present invention is totally different from
Classical information code, due to the superposability of hyperspace code, tangling property and uncertainty, i.e., in its uncertain parameter and group
When (group number is non-determined value), the decoding of information can not be completed, therefore this special information structuring method can be answered
For secure data communication, and there is very strong operational feasibility and higher economic benefit
Description of the drawings
Fig. 1 is the production method schematic diagram of the hyperspace code of the present invention.
Fig. 2 is the hyperspace code data form schematic diagram of the present invention.
Specific implementation mode
The inventive method is expanded on further with reference to embodiment.
Hyperspace code has the characteristics that be superimposed, tangle, being concerned with and uncertain, therefore how hyperspace code is compiled
Code, decoding have been to be different from classical information coding, coding/decoding method, while to realize " superposition " in quantum information and " tangling "
Etc. characteristics, not only with being mathematical method, but physics, mathematics combined method, and using information group coding, coding/decoding method come
Realize the encoding and decoding of hyperspace code.
As shown in Figure 1, the present invention is as follows：
In Fig. 1, the information X (i) of input is matched and converted first in the first block diagram.The information in classical information domain with
" 0 " and " 1 " indicates, 1 information bit indicates 1 bit.The length of information X (i) can be 8 or 16, wherein a certain position is believed
Breath is expressed as x (i).Matching refer to message length and group of transformation group it is in the same size, and according to the physical parameter packet of setting
Message length, the number of " 0 " and " 1 ", swarm parameter, information distributed constant, particle energy levels parameter and output format are included, is selected various
For primitive polynomial by group translating, apolegamy reaches the matrix of requirement needs, referred to as a kind of similar-orthogonal pseudo-random extended matrix, multidimensional
The constructive method of similar-orthogonal pseudo-random extended matrix, the patent No.： ZL200910264376.2.Transformation refers to will be in input information
" 0 " " 1 " information of certain length becomes the information of particulate forms.
" weight transfer " is the number for converting positive and negative particle in the information for finding out particulate forms in second block diagram.
In third block diagram " group's determination ", according to input information particle number and distribution, the distribution in which kind of " group " is determined, it is right
It for some " group " having determined, can be extracted, some " group " can be further divided by further information
" upper semigroup " and " lower semigroup ".This is the local transformation in a time and space, thus information can be effectively extracted from signal,
Multiscale analysis (Multiscale Analysis) is carried out to function or signal by calculation functions such as flexible and translations.
In 4th block diagram " distribution determination ", the distributing position of particle information is inputted in group where referring to, or input with referring to
Offset (can be described as the degree of association) between particle information and group's base vector.By steeping the relative theory of Ke Ersi boxes, steeped
The setting of Ke Ersi parameters determines code length L, more body transform size N, number, group number in conversion process in hyperspace code
Equal important parameters.This four transformation and judgement determine block diagram effect, and being will be in the classical information microcosmos in macrocosm
Particle model is emulated and is determined, a kind of multi-simulation (Muli-system Simulation) being known as in physics also may be used
(transformation of abbreviation mathematics information) is converted with referred to as mathematical physics information
Five, the six block diagrams are output, and there are three types of forms, respectively Y for output tool1, Y2, Y3。
Y1：It is multi -components output signal for ambipolar output signal, there is three weight, group, particle distribution real components.Cause
For Y1Output when three real components, i.e., only need three time-gap pulsings, for baseband form N information digits of input (warp
Allusion quotation information), on the time slot ratio output and input：3/N；If N=8.12.16,32,64 when, information transmit data speed
Rate can greatly improve.It wants N number of time slot (symbol) period (Symbol Time) with from A being transmitted to B, hyperspace code is believed
Breath transmission only wants three slot cycles, such hyperspace code information that can be passed by with classical information system platform
It send.Time slot ratio value is respectively 3/8,3/12,3/16,3/32,3/64.<1.Inference：N values are bigger, and time slot ratio value is smaller.
Y2：For unipolar output.It is also multi -components output signal, has three weight, group, particle distribution components, power supply special
Require have a positive or negative power supply in sign, it is same as described above on time slot ratio.
Y3It encodes and exports for binary format.Y3Output is according to Y2One kind for being constituted with binary format of output form
Coding, Y3One-to-one relationship can be established with input signal X (i).But physical parameter difference according to the rules, not such as particle energy levels
On an equal basis, Y3Can be that different form and input signal X (i) establish one-to-one relationship.It can accomplish one code table of a system.
Hyperspace code is that the number of " 1 " or " 0 " and spatial position are distributed to express, and expression formula is：
(N)B=L (M, Ki,Tj·)。
In formula, N represents hyperspace code, and B represents " 0 " and " 1 " numerical value, L representative function relationships, and M represents superposition position, indicates
The number of " 1 " in information, " weight " (M ∈ 1, N/2) in Classical field, K represent group number flag, and T represents reversed position.
For hyperspace code using group as organization unit, the length of information code is L, its hyperspace yardage after transformation
According to format as shown in Fig. 2, as L=8：
It is superimposed the number that position (M) indicates " 1 "：S1、S2
The superposition of 1 " 1 " is indicated when S1S2=00；
The superposition of 2 " 1 " is indicated when S1S2=01；
The superposition of 3 " 1 " is indicated when S1S2=10；
The superposition of 4 " 1 " is indicated when S1S2=11.
Group number flag (K) indicates the group where hyperspace code：S3、S4
S3S4=00 indicates group 1.
S3S4=01 indicates group 2.
S3S4=10 indicates group 3.
S3S4=11 indicates group 4.
Displacement position (S) indicates the offset occurred in group：S5、S6、S7
Semigroup or lower semigroup wherein in S5 expressions；
S6, S7 indicate offset；
S5S6=00 indicates that each " 1 " is not moved.
S5S6=11 indicates that each " 1 " is moved.
Part " 1 " is mobile after S5S6=01 is indicated.
Part " 1 " is mobile before S5S6=10 is indicated.
Reversed position (T) indicates the complementation of information " 1 " and " 0 " in group, S7
S7=0 indicates the number of " 1 " in information<The number of " 0 ", such as " 11000000 ".
S7=1 indicates the complementary (number of " 1 " in information>The number of " 0 "), such as " 00111111 ".
Embodiment：
Classical information domain information x, length L in the present invention can be it is arbitrarily long, each information can value " 0 " or
“1”.Assuming that the length of classical information domain information x is 8, for classical coding mode, since each takes " 0 " and " 1 "
Two kinds of possibility, so the information x of L=88All coding number=28=256.
The wherein 8 coding numbers for being all 0 have 1, i.e., 0,000 0000；
There is the coding number of 1 " 1 " there are 8 in 8, i.e.,
1000 0000,0,100 0000,0,010 0000,0,001 0000,0,000 1000,0,000 0100,0000
0010,0000 0001；
There is the coding number of 2 " 1 " there are 28 in 8, i.e.,
1100 0000,1,010 0000,1,001 0000,1,000 1000,1,000 0100,1,000 0010,1000
0001,0,110 0000,0,101 0000,0,100 1000,0,100 0100,0,100 0010,0,100 0001,0,011 0000,
0010 1000,0010 0100,0010 0010,0010 00010001 1000,0001 0100,0001 0010,0001
0001,0,000 1100,0,000 1010,0,000 1001,0,000 0110,0,000 0101,0,000 0011；
The coding number containing 3 " 1 " is 56 in 8, is not enumerated herein.
The coding number containing 4 " 1 " is 60 in 8, is not enumerated herein.
The coding number containing 5 " 1 " is 56 in 8, is not enumerated herein.
The coding number containing 6 " 1 " is 28 in 8, is not enumerated herein.
The coding number containing 7 " 1 " is 8 in 8, is not enumerated herein.
In 8 containing 8 " 1 " coding number be 1, i.e., 1,111 1111.
Similar-orthogonal pseudo-random extended matrix in the present invention is obtained by group translating, by classical information matrix X and warp
After crossing the quadrature pseudo-random matrix P progress operations of comb filter, information converting C is obtained.
C=H (XP)
After carrying out heap sort to information converting C, different branch groups can be obtained, i.e., the group in block diagram determines.
Here is to contain branch group when 2 " 1 " in classical information matrix X after group determines.
1 branch of table group's table
| A groups | B groups | C groups | D groups |
| 01100000 | 00110000 | 01010000 | 10001000 |
| 00000110 | 00000011 | 00000101 | 01000100 |
| 00100100 | 00010010 | 01000001 | 00100010 |
| 01000010 | 00100001 | 00010100 | 00010001 |
| 10010000 | 11000000 | 10100000 | |
| 00001001 | 00001100 | 00101000 | |
| 00011000 | 01001000 | 00001010 | |
| 10000001 | 10000100 | 10000010 |
By each branch group by bubble Ke Ersi boxes, Ke Ersi parameters are steeped to it and are configured, determine and multidigit space code
The important parameters such as relevant superposition position, flag, displacement position, reversed position are configured, this process is the distribution number in block diagram
It determines.
According to the group number of setting and distribution number, then the information in classical information domain is fed back and remapped, you can
To hyperspace code corresponding with classical information domain information, corresponding to the expression formula of hyperspace code is：
(N)B=L (M*Ki*Tj·)
In formula, N represents hyperspace code, and B represents " 0 " and " 1 " numerical value, L representative function relationships, and M represents superposition position, indicates
The number of " 1 " in information, " weight " (M ∈ 1, N/2) in Classical field, K represent group number flag, and T represents reversed position.Such as
M=2 is set here.
By taking classical information matrix X above as an example, if M=2 (S1S2=01), group number such as following table (group number
On-fixed) setting when, indicate when T=0 not move, when T=1 indicates movement, then its hyperspace code is as follows：
2 hyperspace code of table is with reference to table
Hyperspace code after multi-simulation converts, its building method are totally different from classical information code, therefore
This special information structuring method can be applied to secure data communication, in its uncertain parameter and group's (group number
For non-determined value) when, the decoding of information can not be completed, therefore hyperspace code can be used for the communications such as word, picture and audio and video
Transmission, while being also that can be applied to secret communication to carry out data encryption.
Hyperspace code can also carry out in " space "+,-, * ,/arithmetic.Such as with 8 code lengths, and M
In the case of=2, it is as follows to carry out four-dimensional information operation：
11111111=(11000000+00110000+00001100+00000011)【Referring to group B in table 1】=
10100000+01010000+00001100+00000011【Referring to group C in table 1】
" sugarcoated haws string " characteristic of hyperspace code makes the information seen in a certain " space ", from another " space "
In can be decomposed into different information, that is, present the superimposed characteristics of hyperspace code.And the expression in different " spaces "
Mode also not be it is unique, i.e., its structure array be also it is not exclusive, 11111111 number of example as above can by one, two
A, four different arrays are constituted；With stochastic behaviour as quadrature pseudo-random code.11111111 in classical information domain
It is unique, and 11111111 information in hyperspace code domain, and the information as described in Mr. Shannon has become as dough,
It can arbitrarily be combined with.Certain physical characteristics in microcosmos are simulated in macrocosm.
Claims (3)
1. the constructive method of hyperspace code, it is characterised in that：Include the following steps：
Step 1：Input information is matched and is converted；The matching is in group's size one of message length and group of transformation
It causes, selects each primitive polynomial to reach the matrix that requirement needs by group translating apolegamy according to the physical parameter of setting, obtain class
Orthogonal pseudo-random extended matrix；The information for being transformed to becoming " 0 " " 1 " information in input information into particulate forms；
Step 2：Weight transfer：Find out positive and negative particle number in the information of particulate forms；
Step 3：Group determines：According to input information particle number and distribution, the distribution in which kind of " group " is determined；
Step 4：Distribution determination refers to the distributing position for inputting particle information in the group of place, or inputs particle information and group with referring to
Offset between base vector；By steeping Ke Ersi boxes, the setting of bubble Ke Ersi parameters is carried out, determines that multidimensional is empty in conversion process
Between the relevant superposition position of code, group number flag, displacement position and reversed position；
Step 5：Output, including ambipolar output signal, unipolar output signal and binary format Encoded output signal；It is described
Ambipolar output signal is multi -components output signal, there is three weight, group, particle distribution real components；The unipolar output letter
Number be multi -components output signal, have three weight, group, particle distribution components；The binary format Encoded output signal according to
The output form of unipolar output signal is constituted with binary format；
Step 6：Output signal in step 5 is fed back and remapped, is repeated the above steps.
2. hyperspace code forming method according to claim 1, it is characterised in that：Physical parameter in the step 1
Including message length, the number of " 0 " and " 1 ", swarm parameter, information distributed constant, particle energy levels parameter and output format.
3. hyperspace code forming method according to claim 1, it is characterised in that：Transformation in the step 1 is specific
For：Classical information matrix is carried out multi-simulation with the similar-orthogonal pseudo-random extended matrix by combed filter device to convert
Information is changed, is expressed as：
C=H (XP)
In formula, C is information converting, and X is classical information matrix, and P is quadrature pseudo-random matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810451236.5A CN108615078B (en) | 2018-05-11 | 2018-05-11 | Secret data communication method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810451236.5A CN108615078B (en) | 2018-05-11 | 2018-05-11 | Secret data communication method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108615078A true CN108615078A (en) | 2018-10-02 |
| CN108615078B CN108615078B (en) | 2022-03-08 |
Family
ID=63662856
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810451236.5A Active CN108615078B (en) | 2018-05-11 | 2018-05-11 | Secret data communication method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108615078B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109639423A (en) * | 2019-02-27 | 2019-04-16 | 苏州工业园区服务外包职业学院 | A kind of constituent apparatus of Encryption Algorithm and the constituent apparatus of decipherment algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107608935A (en) * | 2017-08-30 | 2018-01-19 | 西安交通大学 | Impact class signal time frequency analysis and reconstructing method based on time rearrangement compressed transform |
| CN107622036A (en) * | 2017-09-30 | 2018-01-23 | 中国人民解放军战略支援部队航天工程大学 | A kind of adaptive time-frequency conversion method of Polynomial Phase Signals based on ant group optimization |
| CN107729288A (en) * | 2017-09-30 | 2018-02-23 | 中国人民解放军战略支援部队航天工程大学 | A kind of Polynomial Phase Signals time-frequency conversion method based on particle group optimizing |
-
2018
- 2018-05-11 CN CN201810451236.5A patent/CN108615078B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107608935A (en) * | 2017-08-30 | 2018-01-19 | 西安交通大学 | Impact class signal time frequency analysis and reconstructing method based on time rearrangement compressed transform |
| CN107622036A (en) * | 2017-09-30 | 2018-01-23 | 中国人民解放军战略支援部队航天工程大学 | A kind of adaptive time-frequency conversion method of Polynomial Phase Signals based on ant group optimization |
| CN107729288A (en) * | 2017-09-30 | 2018-02-23 | 中国人民解放军战略支援部队航天工程大学 | A kind of Polynomial Phase Signals time-frequency conversion method based on particle group optimizing |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109639423A (en) * | 2019-02-27 | 2019-04-16 | 苏州工业园区服务外包职业学院 | A kind of constituent apparatus of Encryption Algorithm and the constituent apparatus of decipherment algorithm |
| CN109639423B (en) * | 2019-02-27 | 2023-03-10 | 苏州工业园区服务外包职业学院 | Constituent device of decryption algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108615078B (en) | 2022-03-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Perseguers et al. | Distribution of entanglement in large-scale quantum networks | |
| Datta et al. | A real–integer–discrete-coded differential evolution | |
| CN112633508A (en) | Quantum line generation method and device, storage medium and electronic device | |
| Sagar et al. | A symmetric key cryptography using genetic algorithm and error back propagation neural network | |
| CN104468412A (en) | RSS-based network session data packet distribution method and system | |
| Patti et al. | Variational quantum optimization with multibasis encodings | |
| Lang | Quantum gate-based quantum private comparison | |
| Liu et al. | A novel quantum visual secret sharing scheme | |
| Sadkhan et al. | A proposed security evaluator for cryptosystem based on information theory and triangular game | |
| Diker | Deterministic construction of arbitrary $ W $ states with quadratically increasing number of two-qubit gates | |
| CN108615078A (en) | Hyperspace code forming method | |
| CN108683497B (en) | Multi-dimensional space code forming device | |
| US6505180B1 (en) | Information encoding and retrieval through synthetic genes | |
| CN115660096A (en) | Quantum random walking error correction method based on multiple particles | |
| CN106559782B (en) | Heterogeneous sensor network encryption method based on chaotic neural network public key encryption algorithm | |
| CN108737028B (en) | Encryption method | |
| Kundu et al. | Quantum computation: from Church-Turing thesis to qubits | |
| Cui et al. | A new image encryption algorithm based on DNA dynamic encoding and hyper-chaotic system | |
| Pain et al. | Quantum random number generators for cryptography: Design and evaluation | |
| Safari et al. | Application of Optical Wireless Communications in IoT Devices of Smart Grids within Smart Sustainable Cities: With Hybrid Perspectives to Metaverse & Quantum IoT | |
| Chen et al. | Degree of entanglement for two qubits | |
| Yeang | Engineering entanglement, conceptualizing quantum information | |
| Kaushik et al. | VG1 Cipher–A DNA Indexing Cipher | |
| Nemirovsky-Levy et al. | Increasing Quantum Communication Rates Using Hyperentangled Photonic States | |
| Elias et al. | Utilizing quantum genetic algorithm with TM to solve DEs |
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 |