.png){kind=icon}
.png){kind=icon}
Return
Quantum algorithms for SVD-based data representation and analysis
.png){kind=icon}
OA
AI
DOI：10.1007/s42484-022-00076-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper narrows the gap between previous literature on quantum linear algebra and practical data analysis on a quantum computer, formalizing quantum procedures that speed-up the solution of eigenproblems for data representations in machine learning. The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis. We provide a theoretical analysis of the run-time and prove tight bounds on the randomized algorithms' error. We run experiments on multiple datasets, simulating PCA's dimensionality reduction for image classification with the novel routines. The results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
Keywords:
Quantum computing
machine learning
Data analysis
Data representations
Singular value decomposition
Principal component analysis
Correspondence analysis
Latent semantic analysis
Journal
Q
IF:
4.4
Papers:
431
Citations:
796