mlsanityData to 7 Oct 2026

Comparative Analysis of Quantum and Classical Support Vector Classifiers for Software Bug Prediction: An Exploratory Study

arXiv 2501.04690 ↗First posted 8 Jan 2025cs.SE cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Purpose: Quantum computing promises to transform problem-solving across various domains with rapid and practical solutions. Within Software Evolution and Maintenance, Quantum Machine Learning (QML) remains mostly an underexplored domain, particularly in addressing challenges such as detecting buggy software commits from code repositories. Methods: In this study, we investigate the practical application of Quantum Support Vector Classifiers (QSVC) for detecting buggy software commits across 14 open-source software projects with diverse dataset sizes encompassing 30,924 data instances. We compare the QML algorithm PQSVC (Pegasos QSVC) and QSVC against the classical Support Vector Classifier (SVC). Our technique addresses large datasets in QSVC algorithms by dividing them into smaller subsets. We propose and evaluate an aggregation method to combine predictions from these models to detect the entire test dataset. We also introduce an incremental testing methodology to overcome the difficulties of quantum feature mapping during the testing approach. Results: The study shows the effectiveness of QSVC and PQSVC in detecting buggy software commits. The aggregation technique successfully combines predictions from smaller data subsets, enhancing the overall detection accuracy for the entire test dataset. The incremental testing methodology effectively manages the challenges associated with quantum feature mapping during the testing process. Conclusion: We contribute to the advancement of QML algorithms in defect prediction, unveiling the potential for further research in this domain. The specific scenario of the Short-Term Activity Frame (STAF) highlights the early detection of buggy software commits during the initial developmental phases of software systems, particularly when dataset sizes remain insufficient to train machine learning models.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 60 references that are in the map. First posted on arXiv 8 Jan 2025.

Builds on

20 of 60 references.

References · 20

  1. 2018Supervised learning with quantum enhanced feature spacescited by 654
  2. 2020The power of quantum neural networkscited by 377
  3. 2016Quantum Machine Learningcited by 325
  4. 2019Efficient Learning for Deep Quantum Neural Networkscited by 160
  5. 2020Quantum Long Short-Term Memorycited by 118
  6. 2017Quantum machine learning: a classical perspectivecited by 95
  7. 2016Quantum-enhanced machine learningcited by 79
  8. 2022Systematic Literature Review: Quantum Machine Learning and its applicationscited by 32
  9. 2021Quantum machine learning with differential privacycited by 30
  10. 2017Quantum autoencoders via quantum adders with genetic algorithmscited by 19
  11. 2016Supervised Quantum Learning without Measurementscited by 8
  12. 2017Basic protocols in quantum reinforcement learning with superconducting circuitscited by 8
8 more
  1. 2018Q#: Enabling scalable quantum computing and development with a high-level domain-specific languagecited by 7
  2. 2022A kernel-based quantum random forest for improved classificationcited by 7
  3. 2019SZZ Unleashed: An Open Implementation of the SZZ Algorithm -- Featuring Example Usage in a Study of Just-in-Time Bug Prediction for the Jenkins Projectcited by 5
  4. 2019Statistical Assertions for Validating Patterns and Finding Bugs in Quantum Programscited by 3
  5. 2022ApacheJIT: A Large Dataset for Just-In-Time Defect Predictioncited by 3
  6. 2022Leveraging Structural Properties of Source Code Graphs for Just-In-Time Bug Predictioncited by 2
  7. 2022Using Quantum Computers to Speed Up Dynamic Testing of Softwarecited by 2
  8. 2022Utilizing Source Code Syntax Patterns to Detect Bug Inducing Commits using Machine Learning Modelscited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.