Search

Relief algorithm is a feature selection algorithm used in binary classification proposed by Kira and Rendell, and its computational complexity remarkable increases with both the scale of samples and the number of features. In order to reduce the complexity, a quantum feature selection algorithm based on Relief algorithm, also called quantum Relief algorithm, is proposed. In the algorithm, all features of each sample are superposed by a certain quantum state through the \emph{CMP} and \emph{rotation} operations, then the \emph{swap test} and measurement are applied on this state to get the similarity between two samples. After that, \emph{Near-hit} and \emph{Near-miss} are obtained by calculating the maximal similarity, and further applied to update the feature weight vector $WT$ to get $WT'$ that determine the relevant features with the threshold $\tau$. In order to verify our algorithm, a simulation experiment based on IBM Q with a simple example is performed. Efficiency analysis shows the computational complexity of our proposed algorithm is \emph{O(M)}, while the complexity of the original Relief algorithm is \emph{O(NM)}, where $N$ is the number of features for each sample, and $M$ is the size of the sample set. Obviously, our quantum Relief algorithm has superior acceleration than the classical one., Comment: 15 pges, 6 gigures

Quantum secure communication provides a new way for protecting the security of information. As an important component of quantum secure communication, remote state preparation (RSP) can securely transmit a quantum state from a sender to a remote receiver. The existence of quantum noise severely affects the security and reliability of quantum communication system. In this paper, we study the method for improving the efficiency of joint RSP (JRSP) subjected to noise with the help of weak measurement and its reversal measurement. Taking a GHZ based deterministic JRSP as an example, we utilize the technique of weak measurement and its reversal to suppress the effect of the amplitude-damping noise firstly. Our study shows that the fidelity of the output state can be improved in the amplitude-damping noise. We also study the effect of weak measurement and its reversal in other three types of noise usually encountered in real-world, namely, the bit-flip, phase-flip (phase-damping) and depolarizing noise. Our results show that the weak measurement has no effect for suppressing the bit-flip and phase-flip (phase-damping) noise, while has slight effect for suppressing the depolarizing noise. Our study is suitable for JRSP and RSP, and will be helpful for improving the efficiency of multiparticle entanglement based quantum secure communication in real implementation.

Quantum secure communication brings a new direction for information security. As an important component of quantum secure communication, deterministic joint remote state preparation (DJRSP) could securely transmit a quantum state with 100\% success probability. In this paper, we study how the efficiency of DJRSP is affected when qubits involved in the protocol are subjected to noise or decoherence. Taking a GHZ based DJRSP scheme as an example, we study all types of noise usually encountered in real-world implementations of quantum communication protocols, i.e., the bit-flip, phase-flip (phase-damping), depolarizing, and amplitude-damping noise. Our study shows that the fidelity of the output state depends on the phase factor, the amplitude factor and the noise parameter in the bit-flip noise, while the fidelity only depends on the amplitude factor and the noise parameter in the other three types of noise. And the receiver will get different output states depending on the first preparer's measurement result in the amplitude-damping noise. Our results will be helpful for improving quantum secure communication in real implementation.