Deterministic secure semi-quantum communication method based on quantum data compression

Abstract

The application discloses a kind of based on quantum data compression algorithm, the determinate safety semi-quantum communication method of quantum information sequence can be safely transmitted, reduce the consumption of quantum resource in communication process, expand the use range of communication.In the application, a new random disorder arrangement method is also designed, a pseudo-random number generator is designed based on one-way hash function, so that the ordered information stream is randomly arranged, and the unpredictability and confidentiality in the information transmission process are enhanced.In addition, the application compresses and encrypts quantum secret information based on quantum data compression technology, which can effectively resist various attacks and improve the security and reliability of information transmission.The application as a whole widens the use range of quantum secure communication network, while also reducing the cost of technical implementation.

Description

Technical Field

[0001] This invention belongs to the field of quantum secure communication, specifically relating to a deterministic secure semi-quantum communication method based on quantum data compression. Background Technology

[0002] Quantum information science is mainly divided into two aspects: quantum computing and quantum communication. Various quantum algorithms in quantum computing overcome the inefficiencies and delays of classical algorithms. Quantum communication, as an intersection of information theory, quantum mechanics, and cryptography, utilizes the physical properties of microscopic particles to achieve accurate, efficient, and secure information transmission. Among the many branches of quantum communication, deterministic secure quantum communication has relatively high security because its quantum carriers are not transmitted through external channels.

[0003] In 1999, Shimizu and Imoto proposed the first deterministic secure quantum communication (DSQC) method based on EPR pairs, laying the foundation for deterministic secure quantum communication. In 2002, Beige et al. proposed a deterministic secure quantum communication scheme using a single photon as the carrier, simplifying the communication process. Then, in 2004, Yan and Zhang designed a deterministic secure quantum communication algorithm based on teleportation, which possesses high security. In 2005, Man et al. also proposed several deterministic secure quantum communication schemes based on teleportation and entanglement swapping. Later, in 2006, Li et al. designed two deterministic secure quantum communication schemes based on entangled pure states and multidimensional single-photon states, respectively, adding carrier quantum states and broadening the research ideas and directions. In 2007, Long et al. proposed a deterministic secure quantum communication scheme and pointed out its unique property: the receiver can only read the secret message after obtaining at least one classical information. Based on this, in 2014, Shukla et al. extended the deterministic secure quantum communication scheme based on orthogonal states, which does not actually transmit message qubits and has high security. In 2017, Joy et al. proposed two classes of deterministic secure quantum algorithms using different quantum states as transmission channels. Even though these proposed deterministic secure quantum communication schemes have good properties, they still require sufficient quantum resources and equipment, which is very costly.

[0004] With the development of technology, designing quantum secure communication schemes that can save quantum resources and equipment has become a research hotspot. Based on this, Boyer et al. first proposed the concept of half-quantum. Half-quantum communication refers to communication in which participants do not have the ability to prepare and measure quantum states, but can only perform related operations on quantum states based on computational basis Z-basis, thereby achieving the goal of saving quantum resources. With the application and promotion of the half-quantum concept, various branches of quantum secure communication have been proposed, such as half-quantum key distribution, half-quantum secret sharing, half-quantum secure direct communication, and half-quantum dialogue. However, research in the field of deterministic secure half-quantum communication is relatively limited. Summary of the Invention

[0005] The technical problem to be solved by this invention is to provide a deterministic secure semi-quantum communication method based on quantum data compression, which solves the problems of high quantum resource consumption and low practicality in the implementation of various existing quantum secure communication technologies.

[0006] To solve the above-mentioned technical problems, the present invention adopts the following technical solution:

[0007] The pseudo-random number generator is implemented by following these steps:

[0008] Step A: Pre-set the number of pseudo-random numbers and initialize the internal state counter with the pseudo-random number seed;

[0009] Step B: Calculate the hash value of the counter using the one-way hash function Hash;

[0010] Step C: Output the hash value as a pseudo-random number and increment the counter by 1;

[0011] Step D: Repeat steps B to C until the set number of pseudo-random numbers is reached.

[0012] The method for randomly arranging an ordered information stream includes the following steps:

[0013] Step a: Based on the length of the information sequence, use the pseudo-random number generator to generate a pseudo-random number sequence twice the length of the sequence.

[0014] Step b: Match the information sequence with the first sequence of pseudo-random numbers of equal length in order;

[0015] Step c: Assign a new position order to each information bit in the ordered information sequence according to the value of the pseudo-random number, and arrange them in ascending order of the pseudo-random value;

[0016] Step d: Obtain a random arrangement of the ordered information stream.

[0017] Given the corresponding pseudo-random number seed, generate the corresponding pseudo-random sequence, and then recover the information sequence by reverse engineering.

[0018] A quantum secret information data encoding method is characterized by comprising two parts: three-qubit data compression and decompression. In the qubit data compression, the sender first sends the initial quantum state into a typical or atypical subspace. After obtaining the corresponding typical or atypical state, it performs a unitary transformation and re-encodes the data. Measurements are then performed on specific qubits. Based on the different results, the first two different qubits are sent into the quantum channel, i.e., the corresponding two quantum information bits are sent to the receiver.

[0019] Quantum data decompression involves the receiver recovering the information from the compressed sequence through an inverse unitary transformation, converting the data into a typical state.

[0020] The sender performs the conversion according to the following formula:

[0021]

[0022] Among them, |ψ typ > represents the typical state; |ψ Ntyp This is an atypical form;

[0023] The specific process by which the sender performs measurements on a particular qubit is as follows:

[0024] The sender performs the measurement on the third qubit of |ψ′>.

[0025] If the measurement result is 0, the input state is projected onto the typical subspace Ω, and the two qubits sent into the quantum channel are |xy>, referred to as |ψ>. c1 >;

[0026] If the measurement result is 1, the input state is projected onto the atypical subspace Ω. ⊥ The two qubits sent into the quantum channel are |mn>, and are called |ψ c2 >

[0027] A deterministic secure semi-quantum communication method includes the following steps:

[0028] Step 1: Initial state preparation. The sender prepares an N ordered quantum bit secret information stream and a sufficient number of decoy photons, and sends the decoy photons to the receiver through a quantum channel.

[0029] Step 2, eavesdropping inspection: After receiving the decoy photon sequence, the receiver selects a portion of the photons and randomly performs Z-basis measurement or reflection operations. During the measurement operation, the receiver uses the classical computational basis Z-basis to measure the particles, retains the results, and generates a state identical to the results to send back to the sender.

[0030] In a reflection operation, the receiver reflects the particles back to the sender without interference.

[0031] After the sender receives the particle, the receiver informs the sender of the particle's location and the corresponding operation, and the sender conducts an eavesdropping check.

[0032] Step 3: Random arrangement of information stream. The sender and receiver each prepare a pseudo-random number generator as described above, share a pseudo-random number seed through a classical channel, and generate 2N pseudo-random numbers. The sender rearranges the quantum secret information stream according to the random arrangement method of the ordered information stream to obtain a new sequence.

[0033] Step 4: Compression, encryption, and transmission. The new sequence obtained in Step 3 is compressed using the quantum secret information data encoding method, and the compressed sequence is sent to the receiver through a quantum channel.

[0034] Step 5: Publish the key. After the receiver receives the compressed sequence, the sender will send the key, i.e., the qubits |0> that need to be appended to the received quantum state during decompression, to the receiver.

[0035] Step 6: Decompress and restore data. The receiver decompresses the compressed data according to the key and applies the method described in claim 3 to derandomize and restore the original information stream.

[0036] The specific process of the receiver's eavesdropping inspection in step 2 is as follows:

[0037] If the receiver performs a measurement operation, the sender compares the measurement results.

[0038] If the receiver performs a reflection operation, the sender performs an X-basis measurement on the received particle and compares the measurement results.

[0039] The measurement results are then sent back to the sender, which assesses the received error rate. If the error rate exceeds a predetermined safety threshold, the communication is abandoned; otherwise, the sender discards the detected particles and proceeds to the next step.

[0040] In step 4, when the multidimensional qubit information is compressed, the sender divides the qubits in the new sequence obtained in step 3 into groups of three in the 3-dimensional tensor space for compression.

[0041] In step 5, the sender transmits the key to the receiver via a classic channel.

[0042] Compared with existing technologies, this invention utilizes the properties of quantum mechanics and, based on quantum data compression and decompression algorithms, proposes a method for effectively and securely transmitting quantum secret information sequences in the semi-quantum domain. This broadens the application scope of the overall quantum secure communication network and also reduces the cost of technology implementation. Specifically, it has the following advantages:

[0043] 1. Based on the characteristics of traditional deterministic secure quantum communication, this invention proposes a deterministic secure semi-quantum communication method based on quantum data compression, which can effectively resist various classical attacks, accurately transmit quantum secret messages, and has high transmission efficiency and strong practicality.

[0044] 2. This invention combines decoy photon technology and pseudo-random number generation technology to ensure the security and integrity of information transmission, and has high resistance to attacks.

[0045] 3. This invention designs a random arrangement rule for an ordered information flow, which increases the unpredictability and confidentiality of the information transmission process. Attached Figure Description

[0046] Figure 1 This is a flowchart illustrating the overall method of the present invention.

[0047] Figure 2 This is a schematic diagram illustrating the transformation between a typical set and a typical subspace.

[0048] Figure 3 This is a diagram illustrating data compression.

[0049] Figure 4 A pseudo-random number generator based on a one-way hash function;

[0050] Figure 5 This is a mapping diagram of random permutation rules for an ordered information flow. Detailed Implementation

[0051] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort should fall within the scope of protection of the present application.

[0052] The purpose of this invention is to overcome the shortcomings of existing methods, such as high quantum resource consumption, high application costs, limited audience reach, and low practicality in the implementation of various communication methods. Simultaneously, by combining classical encryption algorithms, a more secure encryption rule is designed, improving the overall security and reliability of communication. Based on a quantum data compression algorithm, a deterministic secure semi-quantum communication scheme is proposed, capable of securely transmitting quantum information sequences, reducing the consumption of quantum resources during communication and expanding the scope of application of this communication method.

[0053] This invention also designs a new method for randomizing and disordering sequences. Based on a one-way hash function, a pseudo-random number generator is designed to randomly and disorderly arrange ordered information streams, thereby enhancing the unpredictability and confidentiality of information transmission.

[0054] Furthermore, this invention uses quantum data compression technology to compress and encrypt quantum secret information, which can effectively resist various attacks and improve the security and reliability of information transmission.

[0055] The pseudo-random number generator is implemented by following these steps:

[0056] Step A: Pre-set the number of pseudo-random numbers and initialize the internal state counter with the pseudo-random number seed;

[0057] Step B: Calculate the hash value of the counter using the one-way hash function Hash;

[0058] Step C: Output the hash value as a pseudo-random number and increment the counter by 1;

[0059] Step D: Repeat steps B to C until the set number of pseudo-random numbers is reached.

[0060] Specific embodiments, such as Figure 4 As shown, to ensure the unpredictability of random numbers, a pseudo-random number generator based on a one-way hash function is used. The detailed execution steps are described below, and the algorithm is briefly described as follows:

[0061] (1) Initialize the internal state counter using the pseudo-random number seed;

[0062] (2) Calculate the hash value of the counter using the one-way hash function Hash;

[0063] (3) Output the hash value as a pseudo-random number;

[0064] (4) Increment the counter value by 1;

[0065] (5) Repeat steps (2) to (4) as needed for the required number of pseudo-random numbers. See the code in Table 1 below for details.

[0066] Table 1

[0067]

[0068] The method for randomly arranging an ordered information stream includes the following steps:

[0069] Step a: Based on the length of the information sequence, use the pseudo-random number generator to generate a pseudo-random number sequence twice the length of the sequence.

[0070] Step b: Match the information sequence with the first sequence of pseudo-random numbers of equal length in order;

[0071] Step c: Assign a new position order to each information bit in the ordered information sequence according to the value of the pseudo-random number, and arrange them in ascending order of the pseudo-random value;

[0072] Step d: Obtain a random arrangement of the ordered information stream.

[0073] Specific embodiments, such as Figure 5 As shown in the figure, for an ordered information sequence I, assume its length is I. N =4, where N represents the sequence length. The sequence is then randomly rearranged according to the following steps:

[0074] (1) Based on the length I of the information sequence N =4. To avoid repetition in the generated pseudo-random numbers, a pseudo-random number generator based on a one-way hash function is used to generate a pseudo-random number sequence P that is twice the length of I, i.e., P... N =8;

[0075] (2) Match the information sequence I with the first batch of 4-bit sequences of the pseudo-random number sequence P in order;

[0076] (3) Based on the value P of the pseudo-random number i Let i = 1, ..., N, and assign a new position order to each information bit in I, and then proceed according to P. i Arranged from smallest to largest;

[0077] (4) Obtain the random permutation sequence of the ordered information flow.

[0078] According to the rules of random rearrangement, if we have the corresponding pseudo-random number seed and generate the corresponding pseudo-random sequence, we can recover the information sequence by reverse reasoning.

[0079] The quantum secret information data encoding method includes two parts: three-qubit data compression and decompression. In the qubit data compression, the sender first sends the initial quantum state into a typical or atypical subspace. After obtaining the corresponding typical or atypical state, it performs a unitary transformation and re-encodes the data. Measurements are then performed on specific qubits. Based on the different results, the first two different qubits are sent into the quantum channel, that is, the corresponding two quantum information bits are sent to the receiver.

[0080] Quantum data decompression involves the receiver recovering the information from the compressed sequence through an inverse unitary transformation, converting the data into a typical state.

[0081] Specific embodiments, such as Figure 2 , Figure 3 As shown,

[0082] The transformation diagram between typical sets and typical subspaces involved in this method is shown in the figure below. Figure 2 As shown, its principle is as follows:

[0083] According to the optimal compression theory in Schumacher quantum coding:

[0084] As n→∞, the optimal compression that is compatible with arbitrarily high fidelity is compression that satisfies log(dimH)=nS(ρ) (i.e., dimH=2). nS(ρ) In the Hilbert space of ), where n is the length of the character information, H is the dimension of the Hilbert space, and S(ρ) is the von Neumann entropy.

[0085] Based on long character information of length n, assuming each character is randomly selected from a pure-state ensemble... Select from the given information, where x = 1, ..., n, p x For the corresponding quantum state If the probability is such that the density matrix ρ of each character is...

[0086]

[0087] The density matrix ρ of the entire character information n yes

[0088]

[0089] At this point, it is concluded that as n increases, this density matrix becomes closer to a subspace of the entire Hilbert space of the character information, and the dimension of this subspace asymptotically approaches 2. nS(ρ) .

[0090] Using the theoretical support of classical information theory, we select an orthogonal basis that diagonalizes ρ.

[0091] Definition: For a specific n and an infinitesimal ε, the typical subspace Ω is a subspace whose eigenvalues ​​λ satisfy the following equation: ρ n The space occupied by the eigenvectors

[0092] 2 -n(S(ρ)+ε) ≤λ≤2 -n(S(ρ)-ε)

[0093] Then for δ is an infinitesimal value; when n is sufficiently large, ρ follows this condition. n Sum of eigenvalues ​​tr(ρ) n E) will satisfy (where E is the projection operator to the typical subspace Ω, POVM)

[0094] tr(ρ n E)>1-δ

[0095] Furthermore, the dimension of the eigenvalues ​​dim(Ω) satisfies

[0096] (1-δ)2 n(S(ρ)-ε) ≤dim(Ω)≤2 n(S(ρ)+ε)

[0097] The schematic diagram of its transformation from a typical set to a typical subspace is as follows: Figure 2 As shown.

[0098] The main idea of ​​encoding is to reliably feed the quantum state into the typical subspace. At this point, a fuzzy measurement can be performed to project the input information into either the typical subspace Ω or the atypical subspace Ω. ⊥ The probability that the result is a typical subspace Ω is P. Ω =tr(ρ n E)>1-δ.

[0099] like Figure 3 The diagram shown illustrates data compression, and the principle is as follows:

[0100] Quantum data compression refers to the technique of compressing information containing a large number of qubits under the premise of reasonable photon transmission, so that it can be represented by a small number of qubits and transmitted in a quantum channel, and finally recovered with a certain degree of fidelity.

[0101] 1. Three-particle quantum data compression algorithm

[0102] The sender first sends the initial quantum state into a typical Ω or an atypical Ω. ⊥ Subspace, in order to obtain the corresponding canonical state |ψ typ >or atypical state|ψ Ntyp Next, it is compressed, following the process:

[0103] (1) During quantum compression, the sender uses a unitary transformation U for conversion.

[0104]

[0105] Then |ψ′>=U|ψ> is the result of recoding.

[0106] (2) The sender performs the measurement on the 3rd qubit of |ψ′>:

[0107] 1) If the measurement result is 0, the input state is projected onto the typical subspace Ω, and the two qubits sent into the quantum channel are |xy>, called |ψ>. c1 >;

[0108] 2) If the measurement result is 1, the input state is projected onto the atypical subspace Ω. ⊥ The two qubits sent into the quantum channel are |mn>, and are called |ψ c2 >

[0109] (3) Regardless of the outcome, the sender only sends the first two quantum information bits to the receiver, i.e., |ψ c1 > and |ψ c2 >, to achieve compressed transmission of quantum information.

[0110] 2. Three-particle quantum data decompression algorithm

[0111] After receiving the compressed sequence, the receiver will perform the following transformation:

[0112] (1) During quantum decompression, the receiver adds the qubit |0> to the received quantum state and performs an inverse unitary transformation U -1 Restore information, execute.

[0113]

[0114] (2) During decompression, the original state |ψ is restored. typ When >, the atypical state also transforms into the typical state, but because any measurement of the state obtained from the characteristic state basis vectors is mapped onto the atypical subspace Ω, the measurement result is not reflected in the typical subspace Ω. ⊥ The probability of obtaining a typical state from an atypical state is only 0.058, so the number of typical states obtained from the atypical state is very small.

[0115] A deterministic secure semi-quantum communication method includes the following steps:

[0116] Step 1: Initial state preparation. The sender prepares an N ordered quantum bit secret information stream and a sufficient number of decoy photons, and sends the decoy photons to the receiver through a quantum channel.

[0117] Step 2: Eavesdropping inspection. After receiving the decoy photon sequence, the receiver selects a portion of the photons and randomly performs Z-basis measurement or reflection operation.

[0118] In the measurement operation, the receiver uses the classical computational basis Z basis to measure the particle, retains the result and generates a state that is the same as the result and sends it back to the sender;

[0119] In a reflection operation, the receiver reflects the particles back to the sender without interference.

[0120] After the sender receives the particle, the receiver informs the sender of the particle's location and the corresponding operation, and the sender conducts an eavesdropping check.

[0121] Step 3: Random arrangement of information flow. The sender and receiver each prepare a pseudo-random number generator, share a pseudo-random number seed through a classical channel, and generate 2N pseudo-random numbers. The sender rearranges the quantum secret information flow according to the random arrangement method of ordered information flow to obtain a new sequence.

[0122] Step 4: Compression, encryption, and transmission. The new sequence obtained in Step 3 is compressed using the quantum secret information data encoding method, and the compressed sequence is sent to the receiver through a quantum channel.

[0123] Step 5: Publish the key. After the receiver receives the compressed sequence, the sender will attach the key (i.e., the qubits |0> that need to be appended to the received quantum state during decompression) to the received quantum state in sequence and send it to the receiver through a classical channel.

[0124] Step 6: Decompress and restore data. The receiver decompresses the compressed data according to the key and applies the method described in claim 3 to derandomize and restore the original information stream.

[0125] Specific embodiments, such as Figure 1 As shown,

[0126] The message sender (Alice) possesses quantum capabilities and can perform relevant quantum operations, while the message receiver (Bob) possesses classical capabilities, and its quantum operations are restricted to: (1) accessing quantum channels; (2) measuring quantum states on a Z-basis; (3) preparing quantum states based on the Z-basis; and (4) rearranging qubits using quantum delay lines. The overall implementation principle can be roughly divided into the following steps:

[0127] Step 1: Initial state preparation; Alice prepares N ordered qubit secret information streams Q and enough decoy photons {|0>,|1>,|+>,|->}, and sends the decoy photons to Bob through a quantum channel.

[0128] Step 2: Eavesdropping inspection; After Bob receives the decoy photon sequence, he selects a portion of the photons and randomly performs Z-basis measurement or reflection operation.

[0129] In the measurement operation, Bob uses the classical computational basis Z basis {|0>,|1>} to measure the particle, retains the results and generates a state that is the same as the results and sends it back to Alice;

[0130] In the reflection operation, Bob reflects the particles back to Alice without being disturbed.

[0131] After Alice receives the particles, Bob informs her of the particle's location and the corresponding operation, and Alice conducts an eavesdropping investigation:

[0132] 2-1: If Bob performs a measurement operation, Alice compares the measurement results;

[0133] 2-2: If Bob performs a reflection operation, Alice performs an X-basis {|+>,|->} measurement on the received particle and compares the measurement results.

[0134] Alice will receive an error rate. If the error rate is higher than a predetermined safety threshold, she will abandon the communication; otherwise, Alice will discard the detected particles and proceed to the next step.

[0135] Step 3: Random permutation of the information flow; Alice and Bob each prepare a pseudo-random number generator based on a one-way hash function, share a pseudo-random number seed through a classical channel, and generate 2N pseudo-random numbers. Alice rearranges the quantum secret information flow according to the random permutation rules of the ordered information flow to obtain a new sequence Q'.

[0136] Step 4: Compression, encryption, and transmission; When multidimensional qubit information is compressed, the complexity becomes very high. Therefore, Alice divides the qubits in the sequence Q' into groups of three for compression (in 3-dimensional tensor space):

[0137] |Q'>={|aaa>,|aab>,|aba>,|abb>,|baa>,|bab>,|bba>,|bbb>}

[0138] The specific compression process is detailed in the quantum data compression algorithm. After compression, Alice sends the resulting compressed sequence Q” to Bob via a quantum channel.

[0139] Step 5: Public Key; After Bob receives Q”, Alice sends the key required for decompression (that is, appending the qubits |0> to the received quantum state in sequence) to Bob through a classical channel.

[0140] Step 6: Decompression; Bob decompresses the secret information using the key and Q” to obtain Q’. For details, please refer to the quantum data decompression process.

[0141] Step 7: Derandomize and Recover; Bob derandomizes the decompressed sequence Q' based on the generated pseudo-random number sequence to obtain sequence Q, accurately recovering the secret information, and the communication is successful.

[0142] It should be noted that the terms "comprising" and "having" and any variations thereof in the specification, claims and accompanying drawings of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are explicitly listed, but may include other steps or units that are not explicitly listed or that are inherent to such process, method, product or device.

[0143] Those skilled in the art should understand that variations can be implemented by combining existing technology and the above embodiments. Such variations do not affect the substantive content of this solution and will not be elaborated here.

[0144] It should be understood that this solution is not limited to the specific embodiments described above. Devices and structures not described in detail herein should be understood as being implemented in a manner common to the art. Any person skilled in the art can make many possible variations and modifications to this solution, or modify it into equivalent embodiments, without departing from the scope of this solution, using the methods and techniques disclosed above. This does not affect the substantive content of this solution. Therefore, any simple modifications, equivalent changes, and alterations made to the above embodiments based on the technical essence of this solution, without departing from its scope, still fall within the protection scope of this solution.

Claims

1. A deterministic secure semi-quantum communication method, characterized in that: Includes the following steps: Step 1: Initial state preparation. The sender prepares an N ordered quantum bit secret information stream and a sufficient number of decoy photons, and sends the decoy photons to the receiver through a quantum channel. Step 2, eavesdropping inspection: After receiving the decoy photon sequence, the receiver selects a portion of the photons and randomly performs Z-basis measurement or reflection operations. During the measurement operation, the receiver uses the classical computational basis Z-basis to measure the particles, retains the results, and generates a state identical to the results to send back to the sender. In a reflection operation, the receiver reflects the particles back to the sender without interference. After the sender receives the particle, the receiver informs the sender of the particle's location and the corresponding operation, and the sender conducts an eavesdropping check. Step 3: Random arrangement of information flow. The sender and receiver each prepare a pseudo-random number generator, share a pseudo-random number seed through a classical channel, and generate 2N pseudo-random numbers. The sender rearranges the quantum secret information flow according to the random arrangement method of ordered information flow to obtain a new sequence. Step 4: Compression, encryption, and transmission. The new sequence obtained in Step 3 is compressed using the quantum secret information data encoding method, and the compressed sequence is sent to the receiver through a quantum channel. Step 5: Publish the key. After the receiver receives the compressed sequence, the sender will publish the key, which is the qubit used for decompression. It needs to be appended sequentially to the received quantum state and sent to the receiver; Step 6: Decompress and recover data. The receiver decompresses the compressed data according to the key, generates a corresponding pseudo-random sequence based on the known pseudo-random number seed, and recovers the original information stream by reverse engineering the information sequence. The pseudo-random number generator is specifically implemented through the following steps: Step A: Pre-set the number of pseudo-random numbers and initialize the internal state counter with the pseudo-random number seed; Step B: Calculate the hash value of the counter using the one-way hash function Hash; Step C: Output the hash value as a pseudo-random number and increment the counter by 1; Step D: Repeat steps B to C until the set number of pseudo-random numbers is reached; The method for randomly arranging the ordered information stream includes the following steps: Step a: Based on the length of the information sequence, use the pseudo-random number generator to generate a pseudo-random number sequence twice the length of the sequence. Step b: Match the information sequence with the first sequence of pseudo-random numbers of equal length in order; Step c: Assign a new position order to each information bit in the ordered information sequence according to the value of the pseudo-random number, and arrange them in ascending order of the pseudo-random value; Step d: Obtain a random arrangement of the ordered information stream; The quantum secret information data encoding method includes two parts: three-qubit data compression and decompression. In the qubit data compression, the sender first sends the initial quantum state into a typical or atypical subspace. After obtaining the corresponding typical or atypical state, it performs a unitary transformation and re-encodes the data. Measurements are then performed on specific qubits. Based on the different results, the first two different qubits are sent into the quantum channel, that is, the corresponding two quantum information bits are sent to the receiver. Quantum data decompression involves the receiver recovering the information from the compressed sequence through an inverse unitary transformation, converting the data into a typical state.

2. The deterministic secure semi-quantum communication method according to claim 1, characterized in that: The specific process of the receiver's eavesdropping inspection in step 2 is as follows: If the receiver performs a measurement operation, the sender compares the measurement results. If the receiver performs a reflection operation, the sender performs an X-basis measurement on the received particle and compares the measurement results. The measurement results are then sent back to the sender, which assesses the received error rate. If the error rate exceeds a predetermined safety threshold, the communication is abandoned; otherwise, the sender discards the detected particles and proceeds to the next step.

3. The deterministic secure semi-quantum communication method according to claim 1, characterized in that: In step 4, when the multidimensional qubit information is compressed, the sender divides the qubits in the new sequence obtained in step 3 into groups of three in the 3-dimensional tensor space for compression.

4. The deterministic secure semi-quantum communication method according to claim 1, characterized in that: In step 5, the sender transmits the key to the receiver via a classic channel.

Images