Quantum-inspired machine learning (QiML) leverages mathematical frameworks from quantum theory to enhance classical algorithms, with particular emphasis on inner product structures in high-dimensional feature spaces. Among the prominent approaches, the Kernel Trick, widely used in support vector machines, provides efficient similarity computation, while the Pretty Good Measurement (PGM), originating from quantum state discrimination, enables classification grounded in Hilbert space geometry. Building on recent developments in kernelized PGM (KPGM) and direct PGM-based classifiers, this work presents a unified theoretical and empirical comparison of these paradigms. We analyze their performance across synthetic oversampling scenarios using Quantum SMOTE (QSMOTE) variants. Experimental results show that both PGM and KPGM classifiers consistently outperform a classical random forest baseline, particularly when multiple quantum copies are employed. Notably, PGM with stereo encoding and n_copies=2 achieves the highest overall accuracy (0.8512) and F1-score (0.8234), while KPGM demonstrates competitive and more stable behavior across QSMOTE variants, with top scores of 0.8511 (stereo) and 0.8483 (amplitude). These findings highlight that quantum-inspired classifiers not only provide tangible gains in recall and balanced performance but also offer complementary strengths: PGM benefits from encoding-specific enhancements, whereas KPGM ensures robustness across sampling strategies. Our results advance the understanding of kernel-based and measurement-based QiML methods, offering practical guidance on their applicability under varying data characteristics and computational constraints.
Quantum-inspired machine learning (QiML) leverages mathematical frameworks from quantum theory to enhance classical algorithms, with particular emphasis on inner product structures in high-dimensional feature spaces. Among the prominent approaches, the Kernel Trick, widely used in support vector machines, provides efficient similarity computation, while the Pretty Good Measurement (PGM), originating from quantum state discrimination, enables classification grounded in Hilbert space geometry. Building on recent developments in kernelized PGM (KPGM) and direct PGM-based classifiers, this work presents a unified theoretical and empirical comparison of these paradigms. We analyze their performance across synthetic oversampling scenarios using Quantum SMOTE (QSMOTE) variants. Experimental results show that both PGM and KPGM classifiers consistently outperform a classical random forest baseline, particularly when multiple quantum copies are employed. Notably, PGM with stereo encoding and n_copies=2 achieves the highest overall accuracy (0.8512) and F1-score (0.8234), while KPGM demonstrates competitive and more stable behavior across QSMOTE variants, with top scores of 0.8511 (stereo) and 0.8483 (amplitude). These findings highlight that quantum-inspired classifiers not only provide tangible gains in recall and balanced performance but also offer complementary strengths: PGM benefits from encoding-specific enhancements, whereas KPGM ensures robustness across sampling strategies. Our results advance the understanding of kernel-based and measurement-based QiML methods, offering practical guidance on their applicability under varying data characteristics and computational constraints.
Class imbalance remains a major challenge in industrial condition monitoring and fault classification, where minority fault patterns can be poorly represented during machine learning. This work develops a noise-aware quantum-inspired oversampling framework and systematically evaluates its effectiveness and robustness for industrial and energy-system fault diagnosis. The principal artificial-intelligence contribution is a noise-aware extension of the Quantum Synthetic Minority Oversampling Technique (QSMOTE), in which quantum-inspired perturbations are introduced directly into the compact-swap-test-based similarity estimation used during synthetic minority-sample generation. Consequently, noise propagates through overlap estimation and angle computation to the generated samples, enabling direct assessment of the robustness of the oversampling mechanism rather than perturbing only the downstream classifier. The engineering application is evaluated on four public datasets covering solar-panel faults, bearing condition monitoring, engine failures, and industrial fault detection. Five classical classifiers are used to compare performance on the original imbalanced data, after QSMOTE-based balancing, and under noisy-QSMOTE. The results show substantial classifier-dependent benefits from QSMOTE, including improvements of up to 170% on the engine-failure dataset and accuracy exceeding 0.99 on the industrial fault-detection dataset. Robustness experiments across six quantum-inspired noise channels further demonstrate that perturbations in similarity estimation can produce markedly different downstream effects depending on the noise model and classifier. The proposed framework therefore provides a reproducible approach for jointly assessing class-imbalance mitigation and noise robustness of quantum-inspired oversampling in practical industrial artificial-intelligence applications.
We investigate a quantum-inspired approach to supervised multi-class classification based on the Pretty Good Measurement (PGM), viewed as an operator-valued decision rule derived from quantum state discrimination. The method associates each class with an encoded mixed state and performs classification through a single POVM construction, thus providing a genuinely multi-class strategy without reduction to pairwise or one-vs-rest schemes. In this perspective, classification is reformulated as the discrimination of a finite ensemble of class-dependent density operators, with performance governed by the geometry induced by the encoding map and by the overlap structure among classes.
To assess the practical scope of this framework, we apply the PGM-based classifier to two biomedical radiomics case studies: histopathological subtyping of non-small-cell lung carcinoma (NSCLC) and prostate cancer (PCa) risk stratification. The evaluation is conducted under protocols aligned with previously reported radiomics studies, enabling direct comparison with established classical baselines. The results show that the PGM-based classifier is consistently competitive and, in several settings, improves upon standard methods. In particular, the method performs especially well in the NSCLC binary and three-class tasks, while remaining competitive in the four-class case, where increased class overlap yields a more demanding discrimination geometry. In the PCa study, the PGM classifier remains close to the strongest ensemble baseline and exhibits clinically relevant sensitivity--specificity trade-offs across feature-selection scenarios.
Data scarcity and class imbalance are persistent challenges in machine learning that degrade model generalization and introduce predictive bias. We present a hybrid quantum-classical framework for synthetic data generation using a Quantum Circuit Born Machine (QCBM) to address these limitations. The proposed approach exploits quantum mechanical properties -- superposition and entanglement -- within a parameterized variational quantum circuit to model complex probability distributions that are difficult for classical generative methods to capture. Experiments are conducted on two tabular benchmark datasets: the Iris dataset and the Telco Customer Churn dataset. Preprocessing includes normalization and PCA-based dimensionality reduction to enable efficient basis encoding for quantum circuits. The QCBM is trained by minimizing Kullback-Leibler (KL) divergence between real and generated data distributions using a gradient-based parameter-shift optimization rule. Augmenting training data with QCBM-generated synthetic samples at 40-50% of the minority class improves F1-score by approximately 5-15% and minority-class recall by 10-25%. Cross-domain evaluations (Train on Synthetic, Test on Real; and Train on Real, Test on Synthetic) reveal a performance gap of only 3-10%, indicating strong distributional fidelity. Comparative analysis against classical oversampling methods -- SMOTE, Borderline-SMOTE, KMeansSMOTE, and SVM-SMOTE -- shows that QCBM achieves competitive classification performance and produces lower Maximum Mean Discrepancy (MMD) on the Telco dataset, suggesting superior structural similarity in certain imbalanced settings. These findings establish QCBM as a viable complementary tool for data augmentation, particularly for low-dimensional structured tabular data with class imbalance.
One of the biggest problems is imbalanced data classification in machine learning. The minority class is usually represented less often, causing biased predictions and a lack of generalizability. The traditional machine learning models and deep learning models maximize the overall accuracy, which results in the accuracy paradox, and the minority class detection is weak in applications like fraud detection, medical diagnosis, or anomaly detection. In order to overcome the above drawbacks, the hybrid Quantum Neural Network (QNN) learning system for imbalanced data is suggested in this paper. The proposed framework is a hybrid between classical data preprocessing and a variational quantum circuit architecture, in which the input features are encoded into qubits via angle encoding, and then processed within a layer of parameterized quantum circuits, and the output features are mapped by measurement. To enhance minority class learning in optimization, a weighted cross-entropy loss function is used. The model is tested on an imbalanced dataset and compared with several basic models, including Artificial Neural Networks (ANN), Support Vector Machines (SVM), Random Forest, XGBoost, and LightGBM. The experimental results show the improvements in minority class recall and F1-scores, achieving an overall accuracy of 94.3%, and a 7%-10% higher F1-score than baseline approaches. The results suggest that QNN-based architectures may be a suitable solution to improve the classification performance in imbalanced learning environments.
Imbalanced datasets in machine learning often result in biased models, particularly in classification problems when certain classes are under-represented. Traditional oversampling techniques like Synthetic Minority Over-sampling Technique (SMOTE), although popular, have difficulty producing synthetic samples of high quality when working in high-dimensional spaces or non-linear feature spaces. Existing techniques, such as SMOTE, do not fully account for the inherent complexity of non-linear structures of a minority class's distribution, which can produce negatively biased classifiers with poor generalization and the risk of overfitting to the minority class. This is further complicated by the reliance of traditional oversampling techniques on linear interpolation, which limits the possibilities of generating realistic or diverse and non-redundant synthetic samples. The proposed technique, QGOPQC, describes Quantum Generative Oversampling using Parameterized Quantum Circuits (PQCs). This approach describes using a quantum circuit, utilizing a novel implementation of a PQCs to overcome the non-linear problem. The development of synthetic samples of high fidelity using parameterized quantum circuits would better reflect the true data manifold of the generated class, allowing for a better learning process in a quantum training process, and using quantum state encoding, quantum circuit training, and classical optimization to produce diverse samples of synthetic classes while not compromising on information that maintains feature correlations. Demonstrated through a variety of results, the method achieved consistently higher AUC scores, reaching up to 0.92 compared to SMOTE’s 0.53, especially in high-dimensional scenarios. The proposed process of using QGOPQC has had a related beneficial effect on classifier performance when trained on imbalanced data, allowing for the process of generating non-redundant high-quality samples through a quantum method of sampling.
Abstract Quantum information theory, and in particular, the theory of quantum state discrimination, has enabled the development of a supervised multi-class classification algorithm. Inspired by the Pretty Good Measurement (PGM), a quantum-inspired classifier named the PGM Classifier has been designed, capable of classifying among multiple classes without resorting to the One versus One or One versus Rest strategy. In the recent past, several approaches of quantum machine learning have been introduced to classify entangled and separable states. In this article, we apply the PGM Classifier to discriminate among factorized states, separable states, and entangled states. We analyze from the simplest case ( 2 qubits) up to a system of ( 5 qubits) and offer a comparison between our quantum-inspired classifier and other classical classifiers. Finally, we propose a refined classification of non-locality based on the violation of the Mermin and Svetlichny inequalities.