Quantum machine learning applies principles such as superposition and entanglement to data processing and optimization. Variational quantum models operate on qubits in high-dimensional Hilbert spaces and provide an alternative approach to model expressivity. We compare classical models and a variational quantum classifier on the XOR problem. Logistic regression, a one-hidden-layer multilayer perceptron, and a two-qubit variational quantum classifier with circuit depths 1 and 2 are evaluated on synthetic XOR datasets with varying Gaussian noise and sample sizes using accuracy and binary cross-entropy.
Performance is determined primarily by model expressivity. Logistic regression and the depth-1 quantum circuit fail to represent XOR reliably, whereas the multilayer perceptron and the depth-2 quantum circuit achieve perfect test accuracy under representative conditions. Robustness analyses across noise levels, dataset sizes, and random seeds confirm that circuit depth is decisive for quantum performance on this task. Despite matching accuracy, the multilayer perceptron achieves lower binary cross-entropy and substantially shorter training time. Hardware execution preserves the global XOR structure but introduces structured deviations in the decision function. Overall, deeper variational quantum classifiers can match classical neural networks in accuracy on low-dimensional XOR benchmarks, but no clear empirical advantage in robustness or efficiency is observed in the examined settings.
Comments
32 pages, 17 figures. Code and experiment scripts available at https://github.com/mseilkhan/XOR-research-Quantum-ML-vs-Classic
Quantum machine learning applies principles such as superposition and entanglement to data processing and optimization. Variational quantum models operate on qubits in high-dimensional Hilbert spaces and provide an alternative approach to model expressivity. We compare classical models and a variational quantum classifier on the XOR problem. Logistic regression, a one-hidden-layer multilayer perceptron, and a two-qubit variational quantum classifier with circuit depths 1 and 2 are evaluated on synthetic XOR datasets with varying Gaussian noise and sample sizes using accuracy and binary cross-entropy.
Performance is determined primarily by model expressivity. Logistic regression and the depth-1 quantum circuit fail to represent XOR reliably, whereas the multilayer perceptron and the depth-2 quantum circuit achieve perfect test accuracy under representative conditions. Robustness analyses across noise levels, dataset sizes, and random seeds confirm that circuit depth is decisive for quantum performance on this task. Despite matching accuracy, the multilayer perceptron achieves lower binary cross-entropy and substantially shorter training time. Hardware execution preserves the global XOR structure but introduces structured deviations in the decision function. Overall, deeper variational quantum classifiers can match classical neural networks in accuracy on low-dimensional XOR benchmarks, but no clear empirical advantage in robustness or efficiency is observed in the examined settings.
Variational Quantum Classifiers (VQCs) are a common class of hybrid quantum-classical models developed for nearterm quantum machine learning applications. Despite growing focus, it is still unclear how circuit design choices, particularly entanglement depth, affect learning performance and optimisation stability when compared to reliable classical baselines [1]. In this research, we provide a controlled empirical analysis of entanglement depth in VQCs for medical image classification utilizing pre-extracted deep feature representations. Under a predetermined experimental design, we assessed VQCs with no entanglement, single-layer entanglement, and two-layer interleaved entanglement with different training set sizes. Our findings demonstrate that in low-data regimes, increasing entanglement could negatively impact accuracy due to optimization instability [2] and may not always enhance performance. Since classical machine learning baselines consistently match or surpass quantum models, there is no performance advantage of variational quantum classifiers was observed under the evaluated experimental conditions and preprocessing constraints. These results emphasize the significance of thorough, comparative benchmarking for real-world use and draw attention to the expressivity optimization trade-offs inherent in variational quantum learning.
A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning to enhance computing efficiency and the expressiveness of models. In this paper, two different quantum classifiers - Variational Quantum Classifier (VQC) and Quantum Kernel Support Vector Machine (QSVM) - are compared with three classical classifiers as baseline classifiers - Logistic Regression, Support Vector Machine (SVM), and a Multi-Layer Perceptron (MLP) - on the Breast Cancer Wisconsin dataset. The quantum circuits were created in the PennyLane framework and simulated on a classical backend. However, in terms of accuracy, classical Logistic Regression performed better with an accuracy of 97.8%, classical SVM and QSVM with an accuracy of 95.6% each, although the Quantum VQC achieved a lower accuracy of 88.9% and had a recall of 100% for the benign class, though it correctly identified only 12 of the 17 malignant cases (a malignant-class recall of approximately 70.6%). The drawback of quantum models is the higher training time; however, since the quantum circuit needs to be classically simulated, the quantum SVM took 23.29 seconds compared to less than 0.01 seconds for the classical linear models. These results indicate that for small structured datasets, classifiers based on quantum computing have not yet surpassed well-tuned classical counterparts. In some respects (e.g., benign-class recall), they perform competitively, though not on malignant-class recall, where the VQC in particular performed worse than the classical baselines, which is worth further investigation on real quantum computers.
This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.
Early and accurate diagnosis of breast cancer plays a critical role in improving patient survival rates and reducing treatment costs. Classical machine learning algorithms such as Logistic Regression and Support Vector Machines (SVM) have demonstrated strong performance in medical diagnosis tasks; however, their scalability and representational limits motivate the exploration of emerging paradigms. Quantum Machine Learning (QML), particularly Variational Quantum Classifiers (VQC), has recently gained attention due to its potential to model complex decision boundaries using quantum circuits. This paper presents a comparative analysis between a Variational Quantum Classifier and classical machine learning models for binary breast cancer classification. The study employs dimensionality-reduced clinical data and evaluates model performance using accuracy, confusion matrices, decision boundary visualization, Principal Component Analysis (PCA), and Receiver Operating Characteristic (ROC) curves. Experimental results indicate that the VQC achieves competitive performance with classical approaches, demonstrating its feasibility for small-scale medical datasets and highlighting the promise of quantum-enhanced learning in healthcare applications.
The increasingly complex cybersecurity landscape requires more advanced network anomaly detection systems. Although, classical machine learning models are known to be effective, they reach computational bottlenecks when processing high-dimensional data. This study investigates the potential of Quantum Machine Learning (QML) for network traffic anomaly detection by evaluating four distinct Variational Quantum Classifier (VQC) architectures. A synthetic network traffic dataset is generated for the evaluations. The VQC models systematically varied feature encoding methods, parameterized ansatz circuits, quantum neural network types, and classical optimizers. Experimental results show that a trade-off exists between circuit expressivity and optimization stability. Deeper circuits (VQC-4) achieved higher accuracy of upto 89.0\%, while simultaneously being sensitive to training conditions. A shallower variant (VQC-1) under performed, although it had consistent and stable optimization curves. Class-dependent biases were also observed such as in VQC-2, where the model struggled to find an effective decision boundary, and produced a large number of false negatives. The best performing model in this study (VQC-3) combined ZFeatureMap with RealAmplitudes ansatz, optimized using ADAM. Comparative analysis against classical machine learning models such as Support Vector Machine and Random Forest reveal a performance gap, where classical models are able to achieve perfect classification performance on the synthetic data. It is concluded that classical algorithms remain dominant in their ability to classify structured data with relatively simple class separations. However, due to the observed potential of certain VQC configurations to learn decision boundaries to classify data, their utility for future applications in noisier, higher-dimensional problems is highlighted.
Quantum Machine Learning (QML) is a newly emerging research area at the intersection of classical machine learning (CML) and quantum computing (QC). Data is becoming voluminous rapidly, so it is challenging for classical computers to train Machine Learning (ML) models over massive datasets. The hope is that quantum physics' intrinsic features, such as entanglement, superposition, and interference, could be exploited as resources for training ML models on big datasets that would otherwise be relatively impossible for classical computers. It is theoretically proven that quantum computers have an exponential-time advantage over their classical counterparts in solving several problems, e.g., complex large dimensional matrix multiplication, factorization problem, unstructured database search, etc. QML models attempt to find a quantum advantage over their classical counterparts. Variational Quantum Classifiers (VQC) are hybrid quantum neural networks to perform the task of classification using QML models. VQC models in the present NISQ (Noisy Intermediate Scale Quantum — 50 to 100 qubits) era can produce comparable and even better results than Classical models. In this article, we examined the performance of a VQC while performing a simple binary classification task. In this article, we use a VQC to evaluate this method's performance empirically. We constructed a VQC to predict the label of fresh input for the typical Iris dataset comprising pairings of target outputs and training inputs. Our quantum classifier can reasonably predict species labels using only four qubits. These levels are fairly good compared to the accuracy levels attained by classical classifiers.