Handwritten numeral recognition is a technology for automatic recognition and classification of handwritten numeral input through machine learning model. This is widely used in postal code digital automatic system to sort letters. The classical k-nearest neighbor algorithm is used in the traditional digital recognition training model. The recognized digital image classification is obtained through similarity measure or calculation and K value selection. Nonetheless, as the applied data volume exceeds a certain threshold, the time complexity of the model increases exponentially upon the similarity measure and K value search. This condition makes it hard to apply the model universally. In this paper, we introduce quantum computing, that is where digital image information is stored in the quantum state, and its similarity is calculated in parallel. Also, the most similar K points are obtained through the Grover algorithm. The theoretical analysis of the proposed improved algorithm shows that, handwritten numeral recognition based on quantum k-neighbor algorithm can improved upon time complexity of \( \mathrm{O}\left(\mathrm{R}\sqrt{kM}\right) \) of the existing algorithm.
相似文献With the rapid development of the Internet, e-commerce plays an important role in people’s lives, and the recommendation system is one of the most critical technologies. However, as the number of users and the scale of goods increase sharply, the traditional collaborative filtering recommendation algorithm has a large computational complexity in the part of calculating the user similarity, which leads to a low recommendation efficiency. In response to the above problems, this paper introduces the concept of quantum computing theory. The user score vector is first prepared into a quantum state, the similarity score is calculated in parallel, then the similarity information is saved into the quantum bit, and finally the similar user is searched by the Grover search algorithm. Compared with the traditional collaborative filtering recommendation algorithm, the time complexity of the collaborative filtering recommendation algorithm based on Grover algorithm can be effectively reduced under certain conditions.
相似文献