Abstract
K-nearest neighbor classification algorithm is one of the most basic algorithms in machine learning, which determines the sample’s category by the similarity between samples. In this paper, we propose a quantum K-nearest neighbor classification algorithm with the Hamming distance. In this algorithm, quantum computation is utilized to obtain the Hamming distance in parallel at first. Then, a core sub-algorithm for searching the minimum of unordered integer sequence is presented to find out the minimum distance. Based on these two sub-algorithms, the whole quantum frame of K-nearest neighbor classification algorithm is presented. At last, it is shown that the proposed algorithm can achieve a significant speedup by analyzing its time complexity briefly.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.