With the increasing complexity of projects and the volume of data in Software Engineering (SE), the need for efficient and accurate data analysis techniques has become crucial. Classification algorithms play a vital role in various SE tasks, such as bug detection, software quality prediction, and requirements classification. Quantum computing offers a new paradigm with the potential to overcome classical computational limitations for certain types of problems. This research proposes the design and implementation of a kernel-based quantum classification algorithm (also known as Quantum Support Vector Machine - QSVM) tailored for data analysis in the SE domain. We will discuss the fundamental principles behind quantum feature mapping and quantum kernel matrices, and demonstrate its implementation using quantum computing libraries. As a case study, the designed algorithm will be tested on a software bug detection dataset, comparing its performance with classical kernel-based classification algorithms like Support Vector Machine (SVM). The result of the comparison show that QSVM is superior in terms of accuracy, precision, recall, and F1-score compared to SVM.
Drug-induced liver injury (DILI) remains difficult to anticipate computationally because many clinically important cases are idiosyncratic and are only weakly determined by chemical structure alone. We compared a support vector quantum-kernel classifier (SVQK) with matched classical baselines for binary DILI prediction on a benchmark FDA/Therapeutics Data Commons dataset of 475 compounds. All reported models were restricted to the same 16-feature principal-component representation and evaluated with stratified 5-fold cross-validation. Under this constrained setting, the SVQK achieved a mean AUC of 0.85 ± 0.03, compared with 0.78 ± 0.04 for the strongest classical baseline, Random Forest, with corresponding accuracies of 82.0 ± 2.5% and
75.0±3.0%, respectively. We interpret this as a proof-of-concept result: the quantum-kernel model was competitive with, and slightly better than, the tested classical models under a qubit-feasible feature budget, rather than evidence of general quantum superiority. All primary quantitative results were obtained from ideal and noisy simulations; limited runs on IBM hardware were used only for minor feasibility checks because current device noise precluded stable comparative benchmarking. Interpretability was limited to exploratory post-hoc analysis. Because the study uses a single 475-compound dataset without external validation, and because idiosyncratic DILI is notoriously hard to model, the findings should be regarded as preliminary.
Static analysis is the process of analyzing software code without executing the software. It can help find bugs and potential problems in software that may only appear at runtime. Although many static analysis tools have been developed for classical software, due to the nature of quantum programs, these existing tools are unsuitable for analyzing quantum programs. This paper presents QChecker, a static analysis tool that supports finding bugs in quantum programs in Qiskit. QChecker consists of two main modules: a module for extracting program information based on abstract syntax tree (AST), and a module for detecting bugs based on patterns. We evaluate the performance of QChecker using the Bugs4Q benchmark. The evaluation results show that QChecker can effectively detect various bugs in quantum programs.