Fundamental Machine Learning Routines as Quantum Algorithms on a Superconducting Quantum Computer
arXiv:2109.09522
Abstract
The Harrow-Hassidim-Lloyd algorithm is intended for solving the system of linear equations on quantum devices. The exponential advantage of the algorithm comes with four caveats. We present a numerical study of the performance of the algorithm when these caveats are not perfectly matched. We observe that, between diagonal and non-diagonal matrices, the algorithm performs with higher success probability for the diagonal matrices. At the same time, it fails to perform well on lower or higher density sparse Hermitian matrices. Again, Quantum Support Vector Machine algorithm is a promising algorithm for classification problem. We have found out that it works better with binary classification problem than multi-label classification problem. And there are many opportunities left for improving the performance.
References in corpus (18)
- Quantum Machine Learning
- Quantum algorithm for solving linear systems of equations
- Quantum support vector machine for big data classification
- Quantum Convolutional Neural Networks
- Quantum Algorithms Revisited
- Quantum algorithms for supervised and unsupervised machine learning
- Quantum Data Fitting
- On the relationship between continuous- and discrete-time quantum walk
- A generative modeling approach for benchmarking and training shallow quantum circuits
- Preconditioned quantum linear system algorithm
- Prediction by linear regression on a quantum computer
- Optimal Quantum Clocks
- Quantum Hopfield neural network
- Optimal quantum learning of a unitary transformation
- Quantum linear systems algorithms: a primer
- Generative model benchmarks for superconducting qubits
- Machine learning \& artificial intelligence in the quantum domain
- Reconsider HHL algorithm and its related quantum machine learning algorithms