Quantum version of the k-NN classifier based on a quantum sorting algorithm
arXiv:2204.03761 · doi:10.1002/andp.202100449
Abstract
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. \cite{Int13}. 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.
References in corpus (15)
- Quantum Machine Learning
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- Quantum support vector machine for big data classification
- Quantum computational chemistry
- Quantum Data Fitting
- Hybrid quantum-classical algorithms and quantum error mitigation
- Prediction by linear regression on a quantum computer
- Quantum Hopfield neural network
- Simulating a perceptron on a quantum computer
- Efficient quantum circuits for quantum computational chemistry
- Quantum Machine Learning for Finance
- A Quantum Algorithm to Calculate Band Structure at the EOM Level of Theory
- Quantum Pattern Recognition
- Finding Broken Gates in Quantum Circuits---Exploiting Hybrid Machine Learning