Evaluating the Performance of Some Local Optimizers for Variational Quantum Classifiers
Not on the map. Why?
Abstract (arXiv)
In this paper, we have studied the performance and role of local optimizers in quantum variational circuits. We studied the performance of the two most popular optimizers and compared their results with some popular classical machine learning algorithms. The classical algorithms we used in our study are support vector machine (SVM), gradient boosting (GB), and random forest (RF). These were compared with a variational quantum classifier (VQC) using two sets of local optimizers viz AQGD and COBYLA. For experimenting with VQC, IBM Quantum Experience and IBM Qiskit was used while for classical machine learning models, sci-kit learn was used. The results show that machine learning on noisy immediate scale quantum machines can produce comparable results as on classical machines. For our experiments, we have used a popular restaurant sentiment analysis dataset. The extracted features from this dataset and then after applying PCA reduced the feature set into 5 features. Quantum ML models were trained using 100 epochs and 150 epochs on using EfficientSU2 variational circuit. Overall, four Quantum ML models were trained and three Classical ML models were trained. The performance of the trained models was evaluated using standard evaluation measures viz, Accuracy, Precision, Recall, F-Score. In all the cases AQGD optimizer-based model with 100 Epochs performed better than all other models. It produced an accuracy of 77% and an F-Score of 0.785 which were highest across all the trained models.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 3 of its 29 references that are in the map. First posted on arXiv 17 Feb 2021.
Builds on
3 of 29 references.
References · 3
- 2019Quantum Adversarial Machine Learningcited by 64
- 2014Quantum Deep Learningcited by 31
- 2020Advances in Quantum Deep Learning: An Overviewcited by 21
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.