Quantum random number secure generation method and device based on quantum entanglement and medium

Abstract

The invention discloses a quantum random number secure generation method and device based on quantum entanglement and a medium, and relates to the technical field of quantum information. According to the method, quantum entanglement and quantum teleportation protocols are combined, and the VN algorithm is introduced to improve the security of the quantum random number generation process. According to the method, the randomness, the security and the quantum attack resistance of the random number generator can be improved by utilizing the unpredictability of the quantum state and the non-locality of quantum entanglement, so that higher information security requirements are met.

Description

Technical Field

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

[0002] Among 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 initial seed input to generate random number sequences. Typical PRNG algorithms include linear congruential generator (LCG) and Mersenne Twister. The advantages of this type of generator are simple implementation and fast speed, but the disadvantages are that the randomness depends on the algorithm and initial seed, and the generated sequence is periodic and can be predicted and reproduced under certain conditions, making it difficult to meet application scenarios with high security requirements.

[0004] Hardware random number generators usually use physical noise sources (such as thermal noise, electromagnetic interference, etc.) to generate random numbers. This type of generator uses the physical properties of random fluctuations in hardware devices to generate random sequences, which has a high degree of 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 is prone to instability, resulting in the generated random numbers being not completely random or biased. In addition, this generator relies on hardware devices and is easily affected by external interference, 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 resist the threat of quantum attacks, because quantum computing can greatly accelerate the cracking process of pseudo-random numbers. Quantum attacks can predict the output of pseudo-random number generators through specific algorithms, or use side channel attacks and other means to interfere with hardware random number generators, resulting in hidden dangers in the security of 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 their reliance on algorithms, the number series generated by pseudo-random number generators are periodic and can be predicted by reverse analysis of the algorithm and initial seed.

[0008] Stability issues of hardware random number generators: The output of hardware generators is easily affected by the physical environment and fluctuates, resulting in reduced randomness. In addition, the device is limited by its physical structure, making it difficult to achieve absolute randomness.

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

[0010] The purpose of the present invention is to provide a method, device and medium for securely generating 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 the random number generator to meet higher information security requirements.

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

[0012] A method for securely generating quantum random numbers based on quantum entanglement, comprising:

[0013] 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;

[0014] Based on the protocol, the states of the three qubits at the beginning are:

[0015] Among them, |π0> represents the state at the beginning of the protocol, |φ + > represents an entangled state, α|0>+β|1> represents a probabilistic correlation state;

[0016] Applying the CNOT gate transforms the state |π0> into the first execution stage:

[0017]

[0018] Apply the Hadamard gate and transform the state |π 1> Transition to the second execution stage:

[0019]

[0020] 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;

[0021] 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;

[0022] 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.

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

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

[0025]

[0026] Then use the multilinearity of the tensor product to get the state:

[0027]

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

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

[0030]

[0031] 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;

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

[0033]

[0034] 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>;

[0035] The third possible result: When the result measured by Sender is ab = 10, the probability is:

[0036]

[0037] 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>;

[0038] The fourth possible result: When the result measured by Sender is ab = 11, the probability is:

[0039]

[0040] 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>.

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

[0042]

[0043] Applying the CNOT gate transforms the state |π0> into the first execution stage:

[0044]

[0045] Applying the Hadamard gate transforms the state |π1> into the second execution stage:

[0046]

[0047] The present invention also provides an electronic device, comprising a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the above-mentioned method for securely generating quantum random numbers based on quantum entanglement.

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

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

[0050] The present invention discloses a quantum random number security generation method, device and medium based on quantum entanglement, the method combines quantum entanglement with quantum teleportation protocol, and introduces VN algorithm to improve the security of quantum random number generation process. The present invention can utilize the unpredictability of quantum state 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. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

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

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

[0054] Figure 3 is a qubit histogram in this embodiment;

[0055] Figure 4 A schematic diagram of the operation flow of the quantum random number security generation of the present invention;

[0056] Figure 5 A quantum circuit diagram with time division added to this embodiment;

[0057] Figure 6 FIG. 4 is a quantum circuit diagram in which system R is added in this embodiment. DETAILED DESCRIPTION

[0058] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0059] The purpose of the present invention is to provide a method, device and medium for securely generating 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 the random number generator to meet higher information security requirements.

[0060] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the present invention is 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 quantum entanglement and quantum teleportation protocols, the present invention is based on the application of quantum entanglement states and uses entanglement and teleportation protocols as a technical basis. The entangled state is a special quantum state, typically existing in the form of Bell states. Taking the entangled state (1) of two quantum bits 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 a probabilistic correlation state (2) in the prior art, which is used to represent the correlation between two bits, but does not have entanglement properties. Although the probabilistic correlation state is similar to the quantum entangled state to some extent, entanglement is a non-classical phenomenon unique to quantum mechanics. In short, quantum entanglement is described by non-classical quantum correlation.

[0064]

[0065] In the interpretation of quantum entanglement, it is often difficult to distinguish the actual difference between state (1) and state (2). If one of the two entangled bits is measured, the state of the other bit is immediately affected, or the joint state of the two quantum bits cannot be described independently; or the two bits maintain some kind of "memory" of each other. In the probabilistic state, there is a strict correlation between the two bits, that is, each bit "remembers" the other's state, but this correlation does not constitute entanglement.

[0066] In order to distinguish the differences in the characteristics of quantum entanglement and probabilistic correlation states, the prior art considers quantum entanglement to be an exploitable resource that can accomplish quantum tasks that cannot be accomplished with classical correlation states. In quantum information and computing research, entanglement is viewed as a quantum resource that can accomplish tasks that cannot be accomplished with traditional probabilistic correlations. To describe the quantitative unit of quantum entanglement, state (1) is viewed as an entanglement unit, i.e., an e-bit. Although state (1) involves two quantum bits, the amount of entanglement it represents is only one e-bit.

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

[0068] 1. Sender first performs a controlled NOT (CNOT) operation on the quantum bit pair (A, Q), where Q is the control bit and A is the target bit, and then applies a Hadamard gate operation to Q;

[0069] 2. The sender performs standard basis measurements on qubits A and Q, and transmits the obtained classical measurement results to the receiver through the classical channel. The measurement results are recorded as a and b respectively;

[0070] 3. After receiving the measurement result from the Sender, the Receiver performs conditional operations on its quantum bit B according to the values ​​of a and b to complete teleportation. Specifically:

[0071] If a=1, apply bit flip (X gate) to B;

[0072] If b=1, apply phase reversal (Z gate) to B;

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

[0074] Theoretical analysis of the teleportation protocol shows that after the protocol is executed, quantum bit B will obtain the quantum state information of the original quantum bit Q, including its correlation with other systems. This process realizes the lossless transmission of quantum information, so that the quantum state of Q is accurately transmitted to B. Because the teleportation process does not copy the initial quantum state of Q, after the protocol is completed, the state of Q has changed to due to measurement. At the same time, the e-bit is consumed during the transmission process, and the state of bit A changes to, and it is no longer entangled with bit B.

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

[0076] Von Neumann Normalization Algorithm (VN) is usually used in the process of quantum random number generation to reduce system noise and deviation, so that the output random number is closer to uniform distribution. The core idea of ​​the 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 it comes to quantum noise and non-ideal quantum states, it is used to improve the quality of random numbers.

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

[0078]

[0079] and f:B→B 2 Defined as:

[0080]

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

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

[0083] for Define the normalization function VN n,m :B n →(U k≤m B k )∪{λ} is:

[0084]

[0085] It can be further proved that for all And |y>∈B m , there exists |x>∈B n So that:

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

[0087] In addition, we need to define right inverse normalization for:

[0088]

[0089] in, For every |y>∈B m Established.

[0090] Figure 3 If we plot the corresponding histogram of the output in , we can see the statistics for all three classical bits. The bottom / leftmost bit should always be 0, indicating that qubit Q was successfully transmitted to B, while the probability of the other two bits appearing is roughly the same.

[0091] Quantum entanglement is a unique quantum phenomenon that allows two or more particles to form a strong correlation, so that when one party is measured, the state of the other party is immediately affected. Through the teleportation protocol, lossless transmission of quantum information can be achieved. The randomness in this process is based on the unpredictability of quantum mechanics. The VN algorithm provides an effective way 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 use this advanced technology to develop an efficient and reliable quantum random number generator. This generator can be widely used in cryptography, blockchain technology and other fields that require high security and high randomness. By integrating the latest achievements in quantum mechanics, our invention is not only committed to the development 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 are not only highly unpredictable, but also guarantee the quality of random numbers. The teleportation protocol is used to securely transmit information from one quantum bit to another without directly measuring the quantum state, thereby ensuring information security and privacy protection in the random number generation process. Finally, the VN algorithm further improves the effectiveness and practicality of random numbers on this basis. Its flow chart is as follows 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 bits. By applying Hadamard gates and CNOT gates, Bell states are constructed: Ensure that there is an entanglement relationship between quantum bits, providing a basis for subsequent teleportation. Quantum teleportation is implemented between the sender and the receiver. The sender applies the CNOT gate and the Hadamard gate to the quantum bit to be transmitted, then measures it, obtains the classical bit information, and sends it to the receiver. The receiver applies the appropriate quantum gate (X gate and Z gate) to its quantum bit according to the received classical bit to complete the teleportation.

[0095] After teleportation is completed, the transmitted bits are processed using the VN algorithm. The bits are converted into a format that meets the requirements of random number generation through a normalization function to ensure that the generated random numbers have good randomness and uniformity. The normalization process can be expressed as:

[0096]

[0097] Finally, the final random number is generated by combining the teleported quantum bits and VN normalization. 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 follows Figure 5 As shown:

[0099] Step 1: Use quantum gate operations to generate a pair of entangled bits, and start constructing the Bell state by adding the situation where the quantum bit Q is initially in the α|0>+β|1> state. Now add the quantum circuit diagram for time division.

[0100] Step 2: The qubit Q starts executing the protocol in the state of α|0>+β|1>. The states of the three qubits (B, A, Q) at the beginning of the protocol are:

[0101]

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

[0103]

[0104] Step 4: Apply the Hadamard gate to transform the state |π 1> Converts to:

[0105]

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

[0107]

[0108] Since scalars float freely in the tensor product, α and β are less correlated with the leftmost qubit than with the other qubits.

[0109] Step 5: This gives the four possible outcomes of the Sender's standard base measurement and the actions taken by the Recevier as a result.

[0110] Step 5-1: The probability that the result of 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 these three qubits.

[0115] Step 5-2: The probability that the result of 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, Receiver applies the Z gate to B, leaving (B,A,Q) in the state:

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

[0121] Step 5-3: The probability that the result of 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, Receiver applies the X gate to qubit B, leaving (B,A,Q) in the state:

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

[0127] Step 5-4: The probability that the result of 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, Receiver performs operation ZX on qubit B, leaving (B,A,Q) in the state:

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

[0133] In the above four cases, the receiver's quantum bit B is in the state α|0>+β|1> at the end of the protocol, which is the initial state of the quantum bit Q. This result proves the effectiveness of the transmission protocol under the current conditions.

[0134] In addition, the states of quantum bits 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 consistent with the expectation of the no-cloning theorem.

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

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

[0137] where |γ0〉 and |γ1〉 are unit vectors, and α and β satisfy |α| 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, such as Figure 6 shown.

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

[0139]

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

[0141]

[0142] Then the Hadamard gate is applied, and after expanding and simplifying the resulting state, the expression of the resulting state can be obtained by following a similar idea to the above analysis:

[0143]

[0144] According to the analysis of Step 1-5, there are four possible results of the measurement results 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 mentioned above, |γ0> and |γ1> actually have no effect. Therefore, teleportation successfully creates a perfect quantum communication channel, effectively transmitting the contents of the quantum bit Q to B and retaining all correlations with any other system. It can be concluded that it can work properly even if the input quantum bit is entangled with another system.

[0145] Step 7: Use the mapping F:B 2 →B∪{λ} implements normalization, 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 will significantly reduce the interference with the initial state information, so that the final random number distribution is uniform and conforms to the 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 relies on physical noise or algorithms, which are easily affected by the external environment. The random number generation method based on quantum mechanics uses the entanglement relationship between quantum bits to make 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 inherent security features of quantum technology give this random number generator a significant advantage in information security. During information transmission, the quantum teleportation protocol ensures the security of information, because any measurement of the quantum state will interfere with its state, thereby exposing potential eavesdropping. This feature enables the system to effectively prevent man-in-the-middle attacks and other network security threats.

[0149] 3. Application of VN algorithm: The introduction of 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 the uniform distribution. Normalization can eliminate the deviation 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 reliable in theory, but also excellent in practical applications.

[0150] 4. Fidelity and repeatability of quantum states: In the quantum random number generator designed by 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 validity 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 random distribution. This is especially important in application scenarios such as encryption and digital signatures that require high-quality random numbers.

[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 block of the quantum random number generator is based on quantum bit operations, its scope of application covers quantum communication, quantum key distribution, and quantum computing. This scalability gives the technology a wide range of application potential and can play an important role in the future development of quantum technology.

[0152] 6. Practical application prospects: With the rapid development of information technology, traditional random number generators are facing challenges in 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 make it have broad application prospects in many fields such as finance, network security, and the Internet of Things. For example, in cryptocurrency transactions, random number generators can provide more secure keys for transactions, thereby protecting user assets; in network security, random numbers generated based on quantum can provide stronger protection for system security.

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

[0154] This article uses specific examples to illustrate the principles and implementation methods of the present invention. The above examples are only used to help understand the core idea of ​​the present invention. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting 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