A quantum random number security generation method, device and medium based on quantum entanglement

Abstract

The present invention discloses a quantum random number security generation method, device and medium based on quantum entanglement, and relates to the field of quantum information technology. The method combines quantum entanglement with a quantum teleportation protocol, and introduces a VN algorithm to improve the security of the quantum random number generation process. The present invention can utilize the unpredictability of quantum states and the non-locality of quantum entanglement to improve the randomness, security and quantum attack resistance of the random number generator to meet higher information security requirements.

Description

Technical Field

[0001] The present invention relates to the field of quantum information technology, and particularly to a method, device, and medium for securely generating quantum random numbers based on quantum entanglement. Background Art

[0002] In traditional random number generators, there are mainly two types: pseudo-random number generators and hardware random number generators:

[0003] Pseudo-random number generators are based on mathematical algorithms and use an initial seed input to generate a random number sequence. Typical PRNG algorithms include the linear congruential generator (LCG), the Mersenne Twister, etc. The advantages of such generators are simple implementation and high speed, but the disadvantages are that the randomness depends on the algorithm and the initial seed, and the generated sequence has periodicity and may be predicted and reproduced under certain conditions, making it difficult to meet application scenarios with high security requirements.

[0004] Hardware random number generators usually utilize physical noise sources (such as thermal noise, electromagnetic interference, etc.) to generate random numbers. Such generators utilize the physical characteristics of random fluctuations in hardware devices to generate random sequences and have high unpredictability. However, the disadvantage of this method is that the physical noise source is greatly affected by external factors such as temperature, humidity, and environmental changes, and it is prone to instability, resulting in the generated random numbers not being completely random or having deviations. In addition, this type of generator depends on hardware devices and is easily interfered by the outside world, and its security and reliability are still insufficient.

[0005] With the development of quantum computing, pseudo-random number and hardware random number generators are difficult to counter the threat of quantum attacks because quantum computing can greatly accelerate the process of cracking pseudo-random numbers. Quantum attacks can predict the output of pseudo-random number generators through specific algorithms or interfere with hardware random number generators by means of side-channel attacks, etc., resulting in potential security risks in existing generators.

[0006] Therefore, the existing pseudo-random number and hardware random number generation technologies have the following deficiencies:

[0007] Periodicity and predictability of pseudo-random number generators: Due to dependence on algorithms, the sequences generated by pseudo-random number generators are periodic and may be predicted by reverse analysis of the algorithm and the initial seed.

[0008] Stability problems of hardware random number generators: The output of hardware generators is prone to fluctuations due to the influence of the physical environment, resulting in reduced randomness, and the device is limited by the physical structure and it is difficult to achieve absolute randomness.

[0009] Insufficient resistance to quantum attacks: Traditional generators are difficult to withstand the new attack methods brought by quantum computing. In particular, quantum algorithms may crack the output of pseudo-random number generators or interfere with hardware generators through quantum means. Summary of the Invention

[0010] The object of the present invention is to provide a quantum random number secure generation method, device and medium based on quantum entanglement, which can utilize the unpredictability of quantum states and the non-locality of quantum entanglement to improve the randomness, security and quantum attack resistance of random number generators to meet higher information security requirements.

[0011] To achieve the above object, the present invention provides the following solutions:

[0012] A quantum random number secure generation method based on quantum entanglement, including:

[0013] Use quantum gate operations to generate a pair of entangled quantum bits A and quantum bit B, and execute a protocol based on the situation of quantum bit Q in the state of α|0> + β|1> to construct a Bell state;

[0014] Based on the protocol, at the beginning stage, the states of the three quantum bits are:

[0015] where, |π 0 > represents the state at the beginning stage of the protocol, |φ + > represents the entangled state, and α|0> + β|1> represents the probability correlation state;

[0016] Apply the CNOT gate to convert the state |π 0 > into the first execution stage:

[0017]

[0018] Apply the Hadamard gate to convert the state |π 1> into the second execution stage:

[0019]

[0020] Based on the beginning stage, the first execution stage and the second execution stage, determine the four possible results of the Sender's standard basis measurement and the corresponding actions taken by the Recevier;

[0021] In a further generalized generalization, quantum bit Q is initially entangled with another system R. Assume that the initial forms of the states of quantum bit Q and quantum bit R are: α|0> Q |γ 0 > R +β|1> Q |γ 1 >R ; where, |γ 0 > and |γ 1 > are unit vectors, and α and β are complex numbers satisfying |α| 2 +|β| 2 = 1;

[0022] Use the mapping F: B 2 → B ∪ {λ} to perform normalization processing. Define F(|x 1 >|x 2 >), and normalize the state corresponding to the measurement result; for each pair of measurement results (|x 1 >|x 2 >), perform normalization according to the VN function. After applying the normalization algorithm to the final state of the qubit B, the interference with the initial state information is reduced, making the finally obtained random number distribution uniform and conforming to quantum characteristics.

[0023] Optionally, the calculation process of the second execution stage includes:

[0024] First, convert the state |π 1> > to:

[0025]

[0026] Then, utilize the multilinearity of the tensor product to obtain the state:

[0027]

[0028] Optionally, the four possible results and the corresponding actions taken by the Recevier are respectively:

[0029] The first possible result: When the result measured by the Sender is ab = 00, the probability is:

[0030]

[0031] In this case, the state of the three qubits becomes: (α|0> + β|1>)|00>. At this time, the Receiver does not act and takes (α|0> + β|1>)|00> as the final state of the three qubits;

[0032] The second possible result: When the result measured by the Sender is ab = 01, the probability is:

[0033]

[0034] In this case, the state of the three qubits becomes: (α|0> - β|1>)|01>. At this time, the Receiver applies the Z gate to qubit B, making the three qubits in the state: (α|0> + β|1>)|01>;

[0035] The third possible result: When the result of the Sender's measurement is ab = 10, the probability is:

[0036]

[0037] In this case, the state of the three qubits becomes: (α|1> + β|0>)|10>. At this time, the Receiver applies the X gate to qubit B, making the three qubits in the state: (α|0> + β|1>)|10>;

[0038] The fourth possible result: When the result of the Sender's measurement is ab = 11, the probability is:

[0039]

[0040] In this case, the state of the three qubits becomes: (α|1> - β|0>)|11>. At this time, the Receiver performs the operation ZX on qubit B, making the three qubits in the state: (α|0> + β|1>)|11>.

[0041] Optionally, after entangling qubit Q with another system R, at the beginning stage of the protocol, the initial state is:

[0042]

[0043] Apply the CNOT gate to convert the state |π 0 > to the first execution stage:

[0044]

[0045] Apply the Hadamard gate to convert the state |π 1 > to the second execution stage:

[0046]

[0047] The present invention also provides an electronic device, including a memory and a processor. The memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the quantum random number secure generation method based on quantum entanglement as described above.

[0048] The present invention also provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the method for secure generation of quantum random numbers based on quantum entanglement as described above.

[0049] According to the specific embodiments provided by the present invention, the following technical effects are disclosed:

[0050] The present invention discloses a method, device and medium for secure generation of quantum random numbers based on quantum entanglement. The method combines quantum entanglement with the quantum teleportation protocol and introduces the VN algorithm to improve the security of the quantum random number generation process. The present invention can utilize the unpredictability of quantum states and the non-locality of quantum entanglement to improve the randomness, security and quantum attack resistance of the random number generator, so as to meet higher information security requirements. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required in the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on these drawings.

[0052] Figure 1 It is the quantum circuit diagram of quantum entanglement and teleportation protocol in this embodiment;

[0053] Figure 2 It is the quantum circuit diagram in the VN algorithm of this embodiment;

[0054] Figure 3 It is the quantum bit histogram of this embodiment;

[0055] Figure 4 It is the schematic diagram of the operation process for secure generation of quantum random numbers of the present invention;

[0056] Figure 5 It is the quantum circuit diagram with time division added in this embodiment;

[0057] Figure 6 It is the quantum circuit diagram with system R added in this embodiment. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0058] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the drawings in the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, rather than all embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts fall within the protection scope of the present invention.

[0059] The object of the present invention is to provide a method, device and medium for secure generation of quantum random numbers based on quantum entanglement, which can utilize the unpredictability of quantum states and the non-locality of quantum entanglement to improve the randomness, security and quantum attack resistance of random number generators, so as to meet higher information security requirements.

[0060] In order to make the above objects, features and advantages of the present invention more obvious and understandable, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0061] The present invention combines quantum entanglement and quantum teleportation protocols and introduces the VN algorithm. Among them, for the quantum entanglement and quantum teleportation protocols, the present invention is based on the application of quantum entanglement states and uses the entanglement and teleportation protocols as the technical basis. Entangled states are a special type of quantum state, typically existing in the form of Bell states. Taking the entangled state of two qubits (1) as an example, this state belongs to one of the Bell states and is often regarded as a standard example of quantum entanglement:

[0062]

[0063] In addition, there is also a probability correlation state (2) in the prior art, which is used to represent the correlation of two bits but does not have the property of entanglement. Although the probability correlation state is somewhat similar to the quantum entanglement state in a certain sense, entanglement is a non-classical phenomenon unique to quantum mechanics. In short, quantum entanglement is described by non-classical quantum correlations.

[0064]

[0065] Usually, in the interpretation of quantum entanglement, it is difficult to distinguish the actual differences between state (1) and state (2). If one of the two entangled qubits is measured, the state of the other qubit will be immediately affected, or the joint state of the two qubits cannot be independently described; or the two bits maintain a certain mutual "memory" of correlation. In the probability state, there is a strict correlation between the two bits, that is, each bit "remembers" the state of the other, but this correlation does not constitute entanglement.

[0066] In order to distinguish the characteristic differences between quantum entanglement and probability correlation states, it is considered in the prior art that quantum entanglement is a resource that can be utilized, and through this resource, quantum tasks that cannot be achieved by classical correlation states can be completed. In the research of quantum information and computing, entanglement is regarded as a quantum resource that can complete tasks that cannot be achieved by traditional probability correlations. To describe the quantization unit of quantum entanglement, state (1) is regarded as an entanglement unit, that is, one e-bit. Although state (1) involves two qubits, the amount of entanglement it represents is only one e-bit.

[0067] Such as Figure 1As shown, it includes the following steps:

[0068] 1. The Sender first performs a Controlled-NOT (CNOT) operation on the qubit pair (A, Q), where Q serves as the control qubit and A as the target qubit. Subsequently, a Hadamard gate operation is applied to Q.

[0069] 2. The Sender measures the qubits A and Q in the standard basis and transmits the resulting classical measurement results to the Receiver via the classical channel. The measurement results are denoted as a and b respectively.

[0070] 3. After receiving the Sender's measurement results, the Receiver performs conditional operations on its qubit B based on the values of a and b to complete the teleportation. Specifically:

[0071] · If a = 1, a bit-flip (X gate) is applied to B.

[0072] · If b = 1, a phase-flip (Z gate) is applied to B.

[0073] · Depending on the combined value of ab being 00, 01, 10, or 11, the Receiver performs I, Z, X, or ZX operations on qubit B respectively.

[0074] The theoretical analysis of this teleportation protocol shows that qubit B will acquire the quantum state information of the original qubit Q after the protocol execution, including its correlation with other systems. This process achieves lossless transmission of quantum information, enabling the quantum state of Q to be precisely transmitted to B. Since the process of teleportation does not copy the initial quantum state of Q, after the protocol is completed, the state of Q has changed due to the measurement. Meanwhile, the e-bit is consumed during the transmission, and the state of qubit A has changed to, no longer being entangled with qubit B.

[0075] For the VN algorithm, as Figure 2 shown:

[0076] The Von Neumann Normalization Algorithm (VN) is typically used in the process of quantum random number generation to reduce system noise and bias, making the output random numbers closer to a uniform distribution. The core idea of this algorithm is to screen out ideal random bits by comparing a pair of adjacent bits. This method is very important in fields such as quantum computing and cryptography, especially when dealing with quantum noise and non-ideal quantum states, for improving the quality of random numbers.

[0077] First, the mapping F: B 2 → B ∪ {λ} is defined as:

[0078]

[0079] and f: B → B 2 is defined as:

[0080]

[0081] where |x> = |1 - x>.

[0082] For all |x> ∈ B, F(f(|x>)) = |x>, and for all |x 1 >>, |x 2 >> ∈ B, where |x 1 > ≠ |x 2 >> then f(F(|x 1 >>|x 2 >>)) = |x 1 >>|x 2 >>.

[0083] For define the normalization function VN n,m : B n → (U k≤m B k ) ∪ {λ} as:

[0084]

[0085] Furthermore, it can be proved that for all and |y> ∈ B m , there exists |x> ∈ B n such that:

[0086] |y> = VN n,m (|x>)

[0087] In addition, the right - inverse normalization is defined as:

[0088]

[0089] where, for each |y> ∈ B m holds.

[0090] Figure 3 Drawing the corresponding histogram of the output in it, one can see the statistical data of all three classical bits. The bottom - most / left - most bit should always be 0, indicating that the qubit Q has been successfully transmitted to B, while the occurrence probabilities of the other two bits are roughly the same.

[0091] Quantum entanglement is a unique quantum phenomenon that enables strong correlations to form between two or more particles, such that when a measurement is made on one side, the state of the other side is immediately affected. Through the teleportation protocol, lossless transmission of quantum information can be achieved, and the randomness in this process is based on the unpredictability of quantum mechanics. The VN algorithm provides an effective method to extract and enhance this randomness, ensuring that the generated random numbers have higher uniformity and reliability.

[0092] The goal of this embodiment is to utilize this advanced technology to develop an efficient and reliable quantum random number generator. This generator can be widely applied in cryptography, blockchain technology, and other fields that require high security and high randomness. By integrating the latest achievements in quantum mechanics, our invention not only contributes to the development of the fields of quantum computing and quantum information but also provides new solutions for secure communication and data encryption.

[0093] Therefore, as a method for securely generating quantum random numbers based on quantum entanglement, its main idea is: through the characteristics of quantum entanglement, the generated random numbers not only have a high degree of unpredictability but also can ensure the quality of the random numbers. The teleportation protocol is used to securely transfer information from one qubit to another without directly measuring the quantum state, thus ensuring information security and privacy protection during the random number generation process. Finally, the VN algorithm further enhances the effectiveness and practicality of the random numbers on this basis. Its flowchart is as Figure 4 shown.

[0094] Figure 4 The framework diagram of the quantum random number generator is given in The main steps are: First, use quantum gate operations to generate a pair of entangled qubits. By applying the Hadamard gate and the CNOT gate, construct the Bell state:

[0095] Ensure that there is an entanglement relationship between the qubits, providing a basis for subsequent teleportation. Implement quantum teleportation between the Sender and the Receiver. The Sender applies the CNOT gate and the Hadamard gate to the qubit to be transmitted, then makes a measurement to obtain classical bit information and sends it to the Receiver. The Receiver then applies appropriate quantum gates (X gate and Z gate) to its qubit according to the received classical bit to complete the teleportation.

[0096]

[0097] Finally, the quantum bit after teleportation and VN normalization are combined to generate the final random number. This random number can be used in applications such as quantum communication and encryption to ensure high security and efficiency.

[0098] The overall steps are as Figure 5 shown:

[0099] Step 1: Use quantum gate operations to generate a pair of entangled qubits. Starting from the case where the quantum bit Q is initially in the state α|0> + β|1>, the construction of the Bell state begins. Now, a quantum circuit diagram with time division is added for illustration.

[0100] Step 2: If the protocol starts with the quantum bit Q in the state α|0> + β|1>, then the state of the three quantum bits (B, A, Q) at the start of the protocol is:

[0101]

[0102] Step 3: The first gate to be executed is the Controlled-NOT, which transforms the state |π 0 > into:

[0103]

[0104] Step 4: Apply the Hadamard gate, which transforms the state |π 1> into:

[0105]

[0106] Using the multilinearity of the tensor product, this state can be written as follows:

[0107]

[0108] Since scalars float freely in the tensor product, the correlation of α and β with the leftmost qubit is less related to that of other qubits.

[0109] Step 5: From this, the four possible results of the Sender's standard basis measurement and the actions taken by the Recevier can be obtained.

[0110] Step 5-1: The probability that the result of the Sender's measurement is ab = 00 is:

[0111]

[0112] In this case, the state of (B, A, Q) becomes:

[0113] (α|0> + β|1>)|00>

[0114] The Receiver does nothing in this case, so this is the final state of the three qubits.

[0115] Step 5-2: The probability that the result of the Sender's measurement is ab = 01 is:

[0116]

[0117] In this case, the state of (B, A, Q) becomes:

[0118] (α|0> - β|1>)|01>

[0119] In this case, the Receiver applies the Z gate to B, putting (B, A, Q) in the state:

[0120] (α|0> + β|1>)|01>

[0121] Step 5-3: The probability that the result of the Sender's measurement is ab = 10 is:

[0122]

[0123] In this case, the state of (B, A, Q) becomes:

[0124] (α|1> + β|0>)|10>

[0125] In this case, the Receiver applies the X gate to qubit B, putting (B, A, Q) in the state:

[0126] (α|0> + β|1>)|10>

[0127] Step 5-4: The probability that the result of the Sender's measurement is ab = 11 is:

[0128]

[0129] In this case, the state of (B, A, Q) becomes:

[0130] (α|1> - β|0>)|11>

[0131] In this case, the Receiver performs the operation ZX on qubit B, putting (B, A, Q) in the state:

[0132] (α|0> + β|1>)|11>

[0133] In the above four cases, the qubit B of the Receiver is in the state α|0> + β|1> at the end of the protocol, which is the initial state of the qubit Q. This result proves the effectiveness of the teleportation protocol under the current conditions.

[0134] In addition, the states of qubits A and Q can be any one of |00>, |01>, |10>, or |11>, and the probability of each state occurring is This depends on the measurement results obtained by the Sender. Therefore, as mentioned before, after the protocol is completed, the Sender no longer holds the state α|0 > +β|1 > , which is in line with the expectations of the no-cloning theorem.

[0135] Step 6: This step is a generalization of Step 1 - 5. For a more general case, where the qubit Q is initially entangled with another system R. An analysis similar to the above analysis shows that in this more general case, the teleportation protocol can still work properly. Assume that the state of (Q, R) is initially in the form of:

[0136] α|0> Q |γ 0 > R +β|1> Q |γ 1 > R

[0137] where |γ 0 > and |γ 1 > are unit vectors, and α and β are complex numbers satisfying |α| 2 +|β| 2 =1. Any quantum state vector of (Q, R) can be represented in this way. The following figure depicts the same quantum circuit as above, but with the addition of system R, as Figure 6 shown.

[0138] At the start of the protocol, the initial state is as follows:

[0139]

[0140] First, through the Controlled-NOT gate, this state is transformed into:

[0141]

[0142] Then, applying the Hadamard gate, after expanding and simplifying the resulting state, following a similar line of thought as the above analysis, the expression for the resulting state can be obtained:

[0143]

[0144] According to the analysis in Step 1 - 5, there are four possible results for the measurement result of the Sender and the corresponding operations performed by the Receiver. And at the end of the protocol, the state of (B, R) is always α|0>|γ 0 >+β|1>|γ 1 >. Compared with the simpler case above, |γ 0 > and |γ 1 > actually have no impact. Therefore, teleportation successfully creates a perfect quantum communication channel, effectively transmitting the content of the qubit Q to B and preserving all correlations with any other system. It can be concluded that it can work properly even if the input qubit is entangled with another system.

[0145] Step 7: Implement normalization using the mapping F: B 2 →B∪{λ}, define F(|x 1 >|x 2 >), and normalize the state corresponding to the measurement result. For each pair of measurement results (|x 1 >|x 2 >), perform normalization according to the VN function. After applying the normalization algorithm, the final state of qubit B will significantly reduce the interference to the initial state information, making the finally obtained random numbers uniformly distributed and conforming to quantum characteristics.

[0146] Therefore, this embodiment has the following beneficial effects:

[0147] 1. Efficient quantum random number generation: Through quantum entanglement and teleportation protocols, this system can efficiently generate random numbers. In traditional random number generators, randomness often depends on physical noise or algorithms, and these methods are vulnerable to the influence of the external environment. While the random number generation method based on quantum mechanics utilizes the entanglement relationship between qubits, making each generated random number have quantum properties. This property ensures that the generated random numbers are unpredictable and have higher randomness.

[0148] 2. Security and privacy protection: The natural security characteristics of quantum technology give this random number generator significant advantages in information security. During the information transmission process, the quantum teleportation protocol ensures the security of information because any measurement of the quantum state will interfere with its state, thus exposing potential eavesdropping behaviors. This feature enables the system to effectively prevent man-in-the-middle attacks and other network security threats.

[0149] 3. Application of the VN algorithm: The introduction of the VN algorithm provides a more rigorous mathematical basis for random number generation. Through this algorithm, the quantum state can be effectively normalized to ensure that the generated random numbers conform to a uniform distribution. The normalization process can eliminate the bias caused by quantum state measurement, thereby enhancing the reliability of random number generation. The mathematical rigor of this process makes the generated random numbers not only theoretically reliable but also perform excellently in practical applications.

[0150] 4. Fidelity and repeatability of quantum states: In the quantum random number generator designed in this patent, the fidelity of the quantum state is crucial. Through the quantum teleportation protocol, the system can maintain a high fidelity of the quantum state, thereby ensuring the repeatability and effectiveness of the generated random numbers. The high-fidelity quantum state enables the random number generation process to be repeated, and the results generated each time have a similar randomness distribution. This is particularly important in application scenarios that require high-quality random numbers, such as encryption and digital signatures.

[0151] 5. Scalability and applicability: The design of this patent is not only applicable to basic random number generation tasks but can also be extended to more complex quantum computing applications. Since the core building blocks of the quantum random number generator are based on qubit operations, its scope of application covers fields such as quantum communication, quantum key distribution, and quantum computing. This scalability enables this technology to have broad application potential and play an important role in the future development of quantum technologies.

[0152] 6. Practical application prospects: With the rapid development of information technology, traditional random number generators face challenges in terms of security and efficiency. The quantum random number generator proposed in this patent provides a practical solution. Its high efficiency, security, and randomness based on quantum mechanics show broad application prospects in multiple fields such as finance, network security, and the Internet of Things. For example, in cryptocurrency transactions, the random number generator can provide a more secure key for transactions, thereby protecting user assets; in network security, random numbers generated based on quantum mechanics can provide stronger protection for system security.

[0153] The various embodiments in this specification are described in a progressive manner. Each embodiment focuses on the differences from other embodiments. The same or similar parts among the various embodiments can be referred to each other.

[0154] Specific examples are used in this article to elaborate on the principles and implementation methods of the present invention. The descriptions of the above embodiments are only used to help understand the core idea of the present invention; at the same time, for those of ordinary skill in the art, based on the idea of the present invention, there will be changes in the specific implementation methods and application scopes. In summary, the content of this specification should not be construed as a limitation on the present invention.

Claims

1. A method for securely generating quantum random numbers based on quantum entanglement, characterized in that: include: Use quantum gate operations to generate a pair of entangled qubits A and B, execute the protocol based on the state of qubit Q in α|0>+β|1>, and construct a Bell state; Based on the protocol, the states of the three qubits at the beginning are: The state of the protocol start phase, |φ + > represents an entangled state, α|0>+β|1> represents a probabilistic correlation state; Applying the CNOT gate transforms the state |π0> into the first execution stage: Applying the Hadamard gate transforms the state |π1> into the second execution stage: Based on the start phase, the first execution phase, and the second execution phase, determine the four possible outcomes of the Sender's standard base measurement and the corresponding actions taken by the Recevier; In a further generalization, qubit Q is initially entangled with another system R. Assume that the states of qubit Q and qubit R are initially of the form: α|0> Q |γ0> R +β|1> Q |γ1> R ; where |γ0> and |γ1> are unit vectors, and α and β satisfy |α| 2 +|β| 2 = 1 complex number; Use the mapping F:B 2 →B∪{λ} implements normalization processing, defines F(|x1>|x2>), and normalizes the state corresponding to the measurement result; for each pair of measurement results (|x1>|x2>), normalization is performed according to the VN function. After applying the normalization algorithm, the final state of the quantum bit B reduces the interference with the initial state information, so that the final random number distribution is uniform and conforms to the quantum characteristics.

2. The method for securely generating quantum random numbers based on quantum entanglement according to claim 1, characterized in that: The calculation process of the second execution stage includes: First convert the state |π1> to: Then use the multilinearity of the tensor product to get the state:

3. The method for securely generating quantum random numbers based on quantum entanglement according to claim 1, characterized in that: The four possible outcomes and the corresponding actions taken by the Recevier are: The first possible result: When the result measured by Sender is ab = 00, the probability is: In this case, the state of the three qubits becomes: (α|0>+β|1>)|00>, at which point the Receiver does not take any action and takes (α|0>+β|1>)|00> as the final state of the three qubits; The second possible result: When the result measured by Sender is ab = 01, the probability is: In this case, the state of the three qubits becomes: (α|0>-β|1>)|01>, at which point the Receiver applies the Z gate to qubit B, leaving the three qubits in the state: (α|0>+β|1>)|01>; The third possible result: When the result measured by Sender is ab = 10, the probability is: In this case, the state of the three qubits becomes: (α|1>+β|0>)|10>, at which point the Receiver applies the X gate to qubit B, leaving the three qubits in the state: (α|0>+β|1>)|10>; The fourth possible result: When the result measured by Sender is ab = 11, the probability is: In this case, the state of the three quantum bits becomes: (α|1>-β|0>)|11>. At this time, the Receiver performs operation ZX on quantum bit B, so that the three quantum bits are in the state: (α|0>+β|1>)|11>.

4. The method for securely generating quantum random numbers based on quantum entanglement according to claim 1, characterized in that: After entanglement of the quantum bit Q with another system R, at the beginning of the protocol, the initial state is: Applying the CNOT gate transforms the state |π0> into the first execution stage: Applying the Hadamard gate transforms the state |π1> into the second execution stage:

5. An electronic device, characterized in that: It comprises a memory and a processor, the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the quantum random number security generation method based on quantum entanglement according to any one of claims 1 to 4.

6. A computer-readable storage medium, characterized in that: It stores a computer program, which, when executed by a processor, implements the quantum random number security generation method based on quantum entanglement as described in any one of claims 1 to 4.

Images