DeepAI AI Chat
Log In Sign Up

Quantum version of the k-NN classifier based on a quantum sorting algorithm

by   L. F. Quezada, et al.
Universidad Nacional Autonoma de Mexico

In this work we introduce a quantum sorting algorithm with adaptable requirements of memory and circuit depth, and then use it to develop a new quantum version of the classical machine learning algorithm known as k-nearest neighbors (k-NN). Both the efficiency and performance of this new quantum version of the k-NN algorithm are compared to those of the classical k-NN and another quantum version proposed by Schuld et al. <cit.>. Results show that the efficiency of both quantum algorithms is similar to each other and superior to that of the classical algorithm. On the other hand, the performance of our proposed quantum k-NN algorithm is superior to the one proposed by Schuld et al. and similar to that of the classical k-NN.


Hybrid Quantum-Classical Neural Network for Cloud-supported In-Vehicle Cyberattack Detection

A classical computer works with ones and zeros, whereas a quantum comput...

Recommendation systems with quantum k-NN and Grover's algorithms for data processing

In this article, we discuss the implementation of a quantum recommendati...

Predictive Power of Nearest Neighbors Algorithm under Random Perturbation

We consider a data corruption scenario in the classical k Nearest Neighb...

Tamper Detection against Unitary Operators

We consider (Enc, Dec) schemes which are used to encode a classical/quan...

Residual Matrix Product State for Machine Learning

Tensor network (TN), which originates from quantum physics, shows broad ...

Quantum Inspired Adaptive Boosting

Building on the quantum ensemble based classifier algorithm of Schuld an...