Quantum Machine Learning: Enhancing Algorithms through Quantum Neural Networks and Data Analysis
This paper evaluates the performance of two quantum machine learning algorithms: Quantum Support Vector Machine (QSVM) and Quantum Principal Component Analysis (Q-PCA). The scalability of QSVM is analyzed across increasing dataset sizes and feature dimensions, revealing faster-than-linear growth in kernel evaluation and SVM training times. However, this computational overhead is accompanied by a notable decline in classification accuracy, highlighting challenges in applying QSVM to larger or more complex datasets. In contrast, Q-PCA demonstrates near-linear scalability with dataset size and qubit count, leveraging the independence of quantum circuit execution and structured operations to maintain efficiency. A QNN-based implementation of Q-PCA further validates its ability to align data with principal components, maximize variance, and enable effective dimensionality reduction. These findings emphasize the potential of Q-PCA for efficient quantum-enhanced data analysis while underscoring the need for optimization in QSVM and further exploration of Q-PCA’s capabilities for real-world quantum computing applications.
Authors
- Princy Randhawa (ORCID: https://orcid.org/0000-0001-6356-8718)
- S. B. Goyal (ORCID: https://orcid.org/0000-0002-8411-7630)
- Anand Singh Rajawat (ORCID: https://orcid.org/0000-0001-5940-5799)
- Rakesh Sengupta (ORCID: https://orcid.org/0000-0003-1768-0551)
- Usha Desai (ORCID: https://orcid.org/0000-0002-2267-2567)
- Madhu Bala
Institutions
- National Institute of Technology Warangal (IN)
- Vels University (IN)
- Manipal Academy of Higher Education (IN)
- Center for Study of Science Technology and Policy (IN)
- Sandip Foundation (IN)
- Manipal Hospital (IN)
Publication Details
- Published
- 2024-12-20
- DOI
- https://doi.org/10.1109/ariia63345.2024.11051521
- Citations
- 1
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.35