CN113553027A - Random number generation method based on real-time estimation of stacking state preparation error rate in quantum computer - Google Patents
Random number generation method based on real-time estimation of stacking state preparation error rate in quantum computer Download PDFInfo
- Publication number
- CN113553027A CN113553027A CN202110673430.XA CN202110673430A CN113553027A CN 113553027 A CN113553027 A CN 113553027A CN 202110673430 A CN202110673430 A CN 202110673430A CN 113553027 A CN113553027 A CN 113553027A
- Authority
- CN
- China
- Prior art keywords
- error rate
- base
- quantum
- state
- preparation
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/588—Random number generators, i.e. based on natural stochastic processes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Computational Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Computation (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Optical Modulation, Optical Deflection, Nonlinear Optics, Optical Demodulation, Optical Logic Elements (AREA)
- Complex Calculations (AREA)
Abstract
The invention relates to the technical field of quantum information communication, and discloses a random number generation method based on real-time estimation of a superposition state preparation error rate in a quantum computer, which comprises the following steps: preparing the qubit into a superposition state using a RY (pi/2) gate in an initial state |0>And transmitting the prepared superposition state to a credible measuring terminal; randomly selecting an X base or a Z base to measure the superposition state by using a string of random seeds; estimating the preparation error rate e of the superposition state in the X-base measuring result in real time according to the X-base measuring resultbxAnd according to ebxError rate e for stacked state preparation under Z basezCarrying out estimation; generating a random number by using a measurement result under the Z base; and (4) performing randomness extraction on the generated original data by using a Toeplitz post-processing method. The invention relates to aThe error rate of the prepared superposition state is effectively estimated in real time, so that the minimum entropy in the quantum computer is monitored in real time, and the randomness of the generated random number is ensured.
Description
Technical Field
The invention relates to the technical field of quantum information communication, in particular to a random number generation method based on real-time estimation of a superposition state preparation error rate in a quantum computer.
Background
Random numbers are widely used in modern society, and play an important role in many fields, such as monte carlo analog sampling, gaming, numerical computation simulation, information security, etc., and especially in Cryptography and secure communications (refer j. menezes, score a. vanstone, Paul c. van oorschot. Handbook of Applied cryptograph [ M ]// Handbook of Applied cryptograph, 1997.) (schinier b. Applied cryptograph [ M ]. Wiley John + Sons, 2009).
In the prior art, random numbers generated by means of classical deterministic mathematical algorithms or according to classical physical processes are called pseudo-random numbers. Although pseudo-random numbers can satisfy the statistical properties of random numbers, the generation principle is a deterministic process, and the generated random numbers are actually predictable and not true random numbers. Therefore, in a field where the requirement for randomness of random numbers is relatively high, the security of pseudo-random numbers cannot meet the requirements of these applications.
Quantum random numbers generated according to the quantum mechanics principle have also been proposed in the prior art, and are considered as true random numbers whose information theory is theoretically secure and provable. The existing quantum random number generation protocol is mainly realized based on quantum optical devices, for example, schemes such as single photon detection, vacuum fluctuation and laser phase noise are utilized. On the other hand, research on physical implementation of quantum computers, especially quantum computer schemes based on superconducting circuit implementation, is rapidly advancing. Meanwhile, quantum cloud computing of hewlett packard services such as quantum computing hardware and software provides convenience for achieving quantum computing capacity. Quantum stacking states and quantum entanglement resources present in quantum computers make it possible for quantum computers to generate quantum random numbers.
However, current quantum computers are noisy, with errors in initial state preparation, quantum gate operation, and quantum readout operations. In the existing random number generation protocol based on a superconducting quantum computer, an initial state is generally prepared into a superposition state through a Hadamard quantum gate, the superposition state is repeatedly measured to obtain a random number, the randomness of the generated random number depends on the performance of the quantum computer, and the prepared superposition state cannot be estimated. The existing protocol for generating random number by using quantum computer is characterized by that firstly, preparing initial state, utilizing Hadamard quantum logic gate operation to prepare initial state into superposition stateIn calculating the base |0>And |1>And measuring the superposition state to obtain 0 or 1, and forming a random number by the results after multiple measurements. However, the existing quantum computer produces the superposition state | +due to environmental noise or imperfect control mechanism>There is a certain error, that is, the prepared quantum state is measured for many times, so that a sequence with balanced 1 and 0 cannot be obtained, and the safety and randomness of the formed random number cannot be ensured.
Disclosure of Invention
The invention provides a random number generation method based on real-time estimation of a preparation error rate of a superposition state in a quantum computer, aiming at the problems that in the conventional random number generation protocol based on a superconducting quantum computer, an initial state is generally prepared into the superposition state through a Hadamard quantum gate, the superposition state is repeatedly measured to obtain a random number, the randomness of the generated random number depends on the performance of the quantum computer, and the prepared superposition state cannot be estimated.
In order to achieve the purpose, the invention adopts the following technical scheme:
a random number generation method based on a superposition state preparation error rate in a real-time estimation quantum computer comprises the following steps:
step 1: in the initial state |0>Preparing quantum bit to superposition state by applying RY (pi/2) gateAnd transmitting the prepared superposition state to a credible measuring terminal;
step 2: the superposition state is measured by randomly selecting X base or Z base by using a string of random seeds, and the quantum line runs n times in total, including nxQuantum wires for sub-X-base measurements and nzA quantum wire for sub-Z-basis measurement;
and step 3: estimating the preparation error rate e of the superposition state in the X-base measuring result in real time according to the X-base measuring resultbxAnd according to ebxError rate e for stacked state preparation under Z basezCarrying out estimation;
and 4, step 4: generating a random number using the measurement result under the Z basis to form a random sequence in which a number 0 indicates that the measurement result is |0>The number 1 indicates that the measurement result is |1>In which the quantum wires of the Z-based measurement run in total nzThen, n can be generatedzA random bit;
and 5: and (4) performing randomness extraction on the generated original data by using a Toeplitz post-processing method.
Further, the method estimates the preparation error rate e of the superposition state in the X-base measurement result in real time according to the X-base measurement resultbxThe method comprises the following steps:
the number of |0> and |1> without read errors is calculated from the known X-base measurements:
wherein N is0And N1Respectively represent |0 in the X-base measurement results>And |1>And satisfies N0+N1=nx;n0And n1Denotes |0 in the X-base measurement in the ideal case without readout errors>And |1>The number of (2); r is0Represents |0>Read error rate of (2), i.e. prepared is |0>But the result of the readout is |1>The proportion of the components is calculated; r is1Represents |1>Read error rate of (2), i.e. prepared is |1>But the result of the readout is |0>The proportion of the components is calculated;
n0and n1Satisfies the following formula:
the error rate of the stack preparation in the X-based measurement result, namely the probability of appearance of | - > is as follows:
where δ represents the angle of rotation about the Y axisThe angle is offset and phi represents the offset angle of rotation about the Z axis.
Further, said is according to ebxError rate e for stacked state preparation under Z basezThe estimating includes:
error rate e of stacked state preparation under Z basezSatisfies the following formula:
ez≤ebx+θ
wherein θ represents an error caused by statistical fluctuation, and satisfies the following formula:
wherein ζ (θ) ═ H (e)bx+θ+qxθ)-qxH(ebx)-(1-qx)H(ebx+θ),qx=nxThe/n is the ratio of the selected X-based measurement, and H () represents Shannon entropy; epsiloneIs a given fixed parameter indicating the probability of failure; prob (e)z>ebx+ theta) represents the error rate e of the preparation of the superposed state in the Z radicalzGreater than ebxProbability of + θ, i.e. pair ezThe value of (c) estimates the probability of failure.
Compared with the prior art, the invention has the following beneficial effects:
in the prior art, various noises existing in a quantum computer have a large influence on the randomness of the generated random numbers, the relationship between the two has no clear quantitative description, and the randomness of the generated random numbers may become poor under the condition of large noises. In the present invention, random numbers with provable randomness can be generated even if various noises exist in a quantum computer, and the control of quantum gates and the output operation of quantum states are imperfect. By effectively estimating the error rate of the prepared superposition state in real time, the minimum entropy in the quantum computer is monitored in real time, and the randomness of the generated random number is ensured.
Drawings
FIG. 1 is a basic flowchart of a random number generation method based on real-time estimation of error rate of stack state preparation in a quantum computer according to an embodiment of the present invention;
FIG. 2 is a structural topology diagram of qubits of a quantum computer used in experiments;
FIG. 3 is a graph of φ as a function of δ;
FIG. 4 is ebxGraph as a function of δ.
Detailed Description
The invention is further illustrated by the following examples in conjunction with the accompanying drawings:
as shown in fig. 1, a random number generation method based on real-time estimation of error rate of superposition state preparation in a quantum computer includes:
step S101, a random source: in the initial state |0>Preparing quantum bit to superposition state by applying RY (pi/2) gateAnd transmitting the prepared superposition state to a credible measuring terminal;
in particular, due to imperfections in the physical implementation of quantum computers, the single quantum bit gate RY (pi/2) used is in error. The error can be divided into two parts, one part is the angle of rotation around the Y axis andthe angle has a deviation delta and the other part is the deviation from the Y axis of the rotation axis, corresponding to the deviation angle phi of the rotation around the Z axis. Thus, an actual RY (π/2) gate may be equivalent toThe superposition of gates and RZ (phi) gates, expressed in matrix form asAnd
errors in the operation of the RY (pi/2) gate can cause errors in the prepared stack state, namely the parameter ezThe value of (c) needs to be estimated. In the random source part, the qubit is first prepared to the ground state |0>After passing through the imperfect RY (pi/2) gate, the qubit is in the state
Thus, the quantum state emitted from the random source is at | +>Sum of states | ->Superposition of states, where | +>The probability of a state is|->The probability of a state is
Step S102, random sampling: the superposition state is measured by randomly selecting X base or Z base by using a string of random seeds, and the quantum line runs n times in total, including nxQuantum wires for sub-X-base measurements and nzA quantum wire for sub-Z-basis measurement; it is worth noting that in quantum computers, by adding a RY (pi/2) gate, the measurement under the Z-basis can be converted into an X-basis measurement, whereZ={|0>,|1>}。
In particular, in quantum wires for X-based measurements, the same imperfect RY (π/2) gate is again used to act on the quantum stateAt this point the quantum state becomes:
for quantum stateMeasurement is performed to obtain |0>Or |1>. Theoretically, |0 is obtained>Has a probability ofTo obtain |1>Has a probability of
Step S103, parameter estimation: estimating the preparation error rate e of the superposition state in the X-base measuring result in real time according to the X-base measuring resultbxAnd according to ebxFor superimposed state system under Z baseSpare error rate ezCarrying out estimation;
specifically, in the case of a quantum computer without noise, the quantum states emitted by the random source should all be in the superposition state | + >. Under X, the measurement of | plus > is |1> and the measurement of | minus > is |0 >. Therefore, if the result of X-base measurement is |0>, it represents that there is an error in the preparation of the superposed state.
In quantum computers, readout errors for quantum states are also not negligible. Remember |0>Has a read error rate of r0Denotes that prepared is |0>But the result of the readout is |1>In a similar manner, let us say |1>Has a read error rate of r1Prepared is |1>But the result of the readout is |0>The ratio of the active ingredients to the total amount of the active ingredients. From the measurement of the X base, the following equation can be obtained:
wherein N is0And N1Respectively represent |0 in the X-base measurement results>And |1>And satisfies N0+N1=nx;n0And n1Denotes |0 in the X-base measurement in the ideal case without readout errors>And |1>The number of (2); n is0And n1Satisfies the following formula:
according to quantum stateIn the form of | ->The probability of state occurrence, so that the error rate of the preparation of the superposition state in the X-base measurement result, namely | ->The probability of occurrence is:
it is worth noting that |0 in the X-base measurement results>And |1>Number N of0And N1It is known that n can be calculated from equation (3)0And n1The value of (c). In a quantum computer, the value ranges of delta and phi areSo that 0 can be obtained<cos(φ)<1; further, according to the formula (4), aTherefore, δ satisfies the relation:
wherein the value range of delta can be determined. The value of δ, φ given a certain δ, can also be calculated according to equation (4). Thus, according to expression (5), e can be estimatedbxAnd gives the maximum value.
And then the error rate e can be prepared according to the superposition state in the X-base measurement resultbxError rate e for preparation of a superposed State in the Z basezThe estimation is performed, and the formula (7) is satisfied:
ez≤ebx+θ (7)
wherein θ represents an error caused by statistical fluctuation, and satisfies formula (8):
wherein ζ (θ) ═ H (e)bx+θ+qxθ)-qxH(ebx)-(1-qx)H(ebx+θ),qx=nxThe/n is the ratio of the selected X-based measurement, and H () represents Shannon entropy; epsiloneIs a given fixed parameter indicating the probability of failure; prob (e)z>ebx+ theta) represents the error rate e of the preparation of the superposed state in the Z radicalzGreater than ebxProbability of + θ, i.e. pair ezThe value of (c) estimates the probability of failure.
Step S104, generating randomness: generating a random number using the measurement result under the Z basis to form a random sequence in which a number 0 indicates that the measurement result is |0>The number 1 indicates that the measurement result is |1>In which the quantum wires of the Z-based measurement run in total nzThen, n can be generatedzA random bit;
step S105, randomness extraction: and (4) performing randomness extraction on the generated original data by using a Toeplitz post-processing method. The number of random bits K that can be extracted at the end is:
K=nz-nzH(ez)-te (9)
wherein t iseIs the probability of a randomness extraction failure.
To verify the effect of the present invention, the following experiment was performed:
according to the method of the invention, an experiment is carried out using the quantum computer cloud platform of IBM. To demonstrate the effectiveness of the present invention, we performed 251X-base measurements directly after 8192Z-base measurements on qubits. The quantum computer used in the experiment is IBMQ _5_ yorktown, the structural topological diagram of the quantum bit of the IBMQ _5_ yorktown quantum device is shown in figure 2, and the device has 5 quantum bits Q0、Q1、Q2、Q3、Q4Wherein, 0, 1, 2, 3, 4 respectively represent the corresponding quantum bit Q0、Q1、Q2、Q3、Q4And 0 represents a qubit Q0In qubit Q0Run a quantum program.
By repeatedly measuring and operating the quantum circuit, two groups of sequences are finally obtained, namely the measurement result l of the Z basezLength 819200; and measurement result l of X radicalxAnd the length is 25100. In the sequence lxNumber of (1) to (0) N0Is a number N equal to 2669, 11Equal to 22431. In qubit Q0For quantum state |0>Read error rate r of0Is 0.072, for quantum state |1>Read error rate r of1Is 0.0394. According to formula (3)The number n of 0's in the X-based measurement result can be calculated without readout error0Number n of 299.8557, 1124800.1443. Then according to formula (6)The deviation angle δ, which can be calculated about the Y-axis, is in the range-0.1095186<δ<0.1095186. The value of phi can also be calculated for each given determined delta, phi, according to equation (4), as shown in fig. 3. Using error rate ebxThe corresponding error rate e of the preparation of the stack state can be calculated by the expression (5)bxE can be calculated as shown in FIG. 4bxIs 0.011943.
In conclusion, the invention realizes effective estimation of the error rate of the superposition state prepared in quantum computation. And measuring the prepared superposition state | + > under an X base or a Z base by using a random selection method, wherein the measurement result of the X base is used for estimating the error rate of the prepared superposition state, and the measurement result of the Z base is used for generating a random number. With the known number of 0's and 1's in the X radical, the error rate of the prepared stacked state can be accurately estimated and its upper bound given.
In the prior art, various noises existing in a quantum computer have a large influence on the randomness of the generated random numbers, the relationship between the two has no clear quantitative description, and the randomness of the generated random numbers may become poor under the condition of large noises. In the present invention, random numbers with provable randomness can be generated even if various noises exist in a quantum computer, and the control of quantum gates and the output operation of quantum states are imperfect. By effectively estimating the error rate of the prepared superposition state in real time, the minimum entropy in the quantum computer is monitored in real time, and the randomness of the generated random number is ensured.
The above shows only the preferred embodiments of the present invention, and it should be noted that it is obvious to those skilled in the art that various modifications and improvements can be made without departing from the principle of the present invention, and these modifications and improvements should also be considered as the protection scope of the present invention.
Claims (3)
1. A random number generation method based on a superposition state preparation error rate in a real-time estimation quantum computer is characterized by comprising the following steps:
step 1: in the initial state |0>Preparing quantum bit to superposition state by applying RY (pi/2) gateAnd transmitting the prepared superposition state to a credible measuring terminal;
step 2: the superposition state is measured by randomly selecting X base or Z base by using a string of random seeds, and the quantum line runs n times in total, including nxQuantum wires for sub-X-base measurements and nzA quantum wire for sub-Z-basis measurement;
and step 3: estimating the preparation error rate e of the superposition state in the X-base measuring result in real time according to the X-base measuring resultbxAnd according to ebxError rate e for stacked state preparation under Z basezCarrying out estimation;
and 4, step 4: generating a random number using the measurement result under the Z basis to form a random sequence in which a number 0 indicates that the measurement result is |0>The number 1 indicates that the measurement result is |1>In which the quantum wires of the Z-based measurement run in total nzThen, n can be generatedzA random bit;
and 5: and (4) performing randomness extraction on the generated original data by using a Toeplitz post-processing method.
2. The method as claimed in claim 1, wherein the method for generating random number based on real-time estimation of error rate of preparation of superposition state in quantum computer is characterized in that the real-time estimation of error rate e of preparation of superposition state in X-base measurement resultbxThe method comprises the following steps:
the number of |0> and |1> without read errors is calculated from the known X-base measurements:
wherein N is0And N1Respectively represent |0 in the X-base measurement results>And |1>And satisfies N0+N1=nx;n0And n1Denotes |0 in the X-base measurement in the ideal case without readout errors>And |1>The number of (2); r is0Represents |0>Read error rate of (2), i.e. prepared is |0>But the result of the readout is |1>The proportion of the components is calculated; r is1Represents |1>Read error rate of (2), i.e. prepared is |1>But the result of the readout is |0>The proportion of the components is calculated;
n0and n1Satisfies the following formula:
the error rate of the stack preparation in the X-based measurement result, namely the probability of appearance of | - > is as follows:
3. The method of claim 1, wherein the error rate is estimated based on the randomness of the stacking state preparation in the quantum computerNumber generation method, characterized in that said basis is ebxError rate e for stacked state preparation under Z basezThe estimating includes:
error rate e of stacked state preparation under Z basezSatisfies the following formula:
ez≤ebx+θ
wherein θ represents an error caused by statistical fluctuation, and satisfies the following formula:
wherein ζ (θ) ═ H (e)bx+θ+qxθ)-qxH(ebx)-(1-qx)H(ebx+θ),qx=nxThe/n is the ratio of the selected X-based measurement, and H () represents Shannon entropy; epsiloneIs a given fixed parameter indicating the probability of failure; prob (e)z>ebx+ theta) represents the error rate e of the preparation of the superposed state in the Z radicalzGreater than ebxProbability of + θ, i.e. pair ezThe value of (c) estimates the probability of failure.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110673430.XA CN113553027B (en) | 2021-06-17 | 2021-06-17 | Random number generation method based on real-time estimation of stacking state preparation error rate in quantum computer |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110673430.XA CN113553027B (en) | 2021-06-17 | 2021-06-17 | Random number generation method based on real-time estimation of stacking state preparation error rate in quantum computer |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113553027A true CN113553027A (en) | 2021-10-26 |
CN113553027B CN113553027B (en) | 2022-10-25 |
Family
ID=78130638
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110673430.XA Active CN113553027B (en) | 2021-06-17 | 2021-06-17 | Random number generation method based on real-time estimation of stacking state preparation error rate in quantum computer |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113553027B (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104238996A (en) * | 2014-09-04 | 2014-12-24 | 清华大学 | Source irrelevant quantum random number generation method and device |
CN106209363A (en) * | 2016-08-26 | 2016-12-07 | 安徽问天量子科技股份有限公司 | Quantum key distribution system based on quantum true random number and method |
CN106708470A (en) * | 2016-12-28 | 2017-05-24 | 清华大学 | Quantum random number generator and quantum random number generation method |
US20190243611A1 (en) * | 2016-10-09 | 2019-08-08 | Université De Genève | Method and device for quantum random number generation |
WO2020261419A1 (en) * | 2019-06-26 | 2020-12-30 | 日本電信電話株式会社 | Quantum random number generation device and quantum random number generation method |
-
2021
- 2021-06-17 CN CN202110673430.XA patent/CN113553027B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104238996A (en) * | 2014-09-04 | 2014-12-24 | 清华大学 | Source irrelevant quantum random number generation method and device |
CN106209363A (en) * | 2016-08-26 | 2016-12-07 | 安徽问天量子科技股份有限公司 | Quantum key distribution system based on quantum true random number and method |
US20190243611A1 (en) * | 2016-10-09 | 2019-08-08 | Université De Genève | Method and device for quantum random number generation |
CN106708470A (en) * | 2016-12-28 | 2017-05-24 | 清华大学 | Quantum random number generator and quantum random number generation method |
WO2020261419A1 (en) * | 2019-06-26 | 2020-12-30 | 日本電信電話株式会社 | Quantum random number generation device and quantum random number generation method |
Non-Patent Citations (4)
Title |
---|
A.KHANMOHAMMADI: "A Monolithic Silicon Quantum Random Number Generator Based on Measurement of Photon Detection Time", 《IEEE PHOTONICS JOURNAL》 * |
M.S.NOBILE ET AL.: "Which random is the best random? A study on sampling methods in Fourier surrogate modeling", 《2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION》 * |
刘欣 等: "半设备无关量子随机数扩展研究", 《信息工程大学学报》 * |
李超博 等: "非完美探测效率对半设备无关量子随机数扩展的影响", 《信息工程大学学报》 * |
Also Published As
Publication number | Publication date |
---|---|
CN113553027B (en) | 2022-10-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP7033120B2 (en) | Methods and systems for quantum key distribution based on trusted computing | |
CN114462613B (en) | Quantum computer performance characterization method and device, electronic equipment and medium | |
CN108604981A (en) | Method and apparatus for estimating secret value | |
CN110399738B (en) | Distributed online optimization algorithm with privacy protection | |
US11614918B1 (en) | Generating quantum representations of hexadecimal data | |
Ablayev et al. | Computing Boolean functions via quantum hashing | |
Zhu et al. | Generative trapdoors for public key cryptography based on automatic entropy optimization | |
CN113553027B (en) | Random number generation method based on real-time estimation of stacking state preparation error rate in quantum computer | |
US20190227772A1 (en) | System and method for generating random numbers | |
Wu et al. | Privacy-Preserving Serverless Federated Learning Scheme for Internet of Things | |
CN111970130A (en) | Quantum block chain establishment method and system | |
CN116155493A (en) | Multiparty quantum key negotiation method under phase damping and depolarization noise channel | |
Doosti et al. | On the connection between quantum pseudorandomness and quantum hardware assumptions | |
CN113904780B (en) | Quantum-based batch identity authentication method, system, equipment and storage medium | |
Petrenko et al. | Universal quantum gate as a tool for modeling quantum cryptanalysis algorithms on a quantum circuit | |
CN116149604A (en) | Source-independent quantum random number generation method | |
CN115270176A (en) | Radix estimation method, system, computing device and computer storage medium | |
Kuznetsov et al. | Stream Symmetric Cipher “Strumok” | |
Takeuchi et al. | Unconditional verification of quantum computation with classical light | |
Sutradhar et al. | An efficient simulation of quantum secret sharing | |
Farooq et al. | QuantIoT Novel Quantum Resistant Cryptographic Algorithm for Securing IoT Devices: Challenges and Solution | |
Wang et al. | Quantum discord witness with uncharacterized devices | |
Peng | Efficient VSS free of computational assumption | |
Bindel et al. | Comparing apples with apples: performance analysis of lattice-based authenticated key exchange protocols | |
Garasym et al. | Key requirements for the design of robust chaotic PRNG |
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 |