Abstract: The invention discloses a Raman spectrum classification method, a species blood and semen classification method and a species classification method. The Raman spectrum classification method comprises: first, acquiring Raman spectrum data as a training set and a test set; second, acquiring Raman spectrum data with obvious spectral peak information; then, inputting the spectrum data with the spectral peak information into a one-dimensional convolution and multi-head self-attention mechanism combined neural network model to train a classification model; and finally, inputting the Raman spectrum test set data to the trained classification model to obtain a classification result.

Abstract: The present invention discloses a high-fidelity entangled link generation method based on quantum time-space, the method comprising: directing, by a communication provider, a laser beam to a nonlinear crystal, thereby enabling probabilistically bursting out of a photon beam, and polarizing the photon beam to be in an entangled state; at an entanglement distribution stage, enabling entangled photons to traverse through quantum trajectories, and generating a distributed entangled photon state between a first communication node and a second communication node to construct an elementary entangled link; the first communication node or the second communication node is required to select the same measurement basis for m control qubits when m copies of entangled photon pairs from entanglement source are assumed to be distributed through quantum trajectories to communication nodes with the time interval ?, such that 2m memory qubits of two adjacent nodes may store m exactly the same distributed entangled states.

Abstract: The present invention discloses a high-fidelity entangled link generation method based on quantum time-space, the method comprising: directing, by a communication provider, a laser beam to a nonlinear crystal, thereby enabling probabilistically bursting out of a photon beam, and polarizing the photon beam to be in an entangled state; at an entanglement distribution stage, enabling entangled photons to traverse through quantum trajectories, and generating a distributed entangled photon state between a first communication node and a second communication node to construct an elementary entangled link; the first communication node or the second communication node is required to select the same measurement basis for m control qubits when m copies of entangled photon pairs from entanglement source are assumed to be distributed through quantum trajectories to communication nodes with the time interval ?, such that 2 m memory qubits of two adjacent nodes may store m exactly the same distributed entangled states.

Abstract: Disclosed are a quantum color image encrypting method based on modification direction and corresponding circuit, respectively providing quantum modular circuits design for a parallel adder, a parallel subtractor, a comparator, a cyclic shift add 1, and a cyclic shift subtract 1; and based on these modular circuits, circuit for implementing quantum color image steganography is provided. From the complexity analysis of implementing quantum circuit for color image steganography, it is seen that for a two-dimensional quantum color image with 22n pixels and the R, G, and B channels of which are respectively represented by q number of quantum bits, the steganography algorithm is an efficient transformation method, and the circuit complexity is O(q2+n), which can hardly be achieved by classical geometric transformation. The disclosure is applicable for many practical image processing applications, e.g.

Abstract: Disclosed are a quantum color image encrypting method based on modification direction and corresponding circuit, respectively providing quantum modular circuits design for a parallel adder, a parallel subtractor, a comparator, a cyclic shift add 1, and a cyclic shift subtract 1; and based on these modular circuits, circuit for implementing quantum color image steganography is provided. From the complexity analysis of implementing quantum circuit for color image steganography, it is seen that for a two-dimensional quantum color image with 22n pixels and the R, G, and B channels of which are respectively represented by q number of quantum bits, the steganography algorithm is an efficient transformation method, and the circuit complexity is O(q2+n), which can hardly be achieved by classical geometric transformation. The disclosure is applicable for many practical image processing applications, e.g.