The paper introduces Hybrid Quantum Root Cause Analysis (HQ‑RCA), a workflow that applies a hybrid Quantum Graph Neural Network (QGNN) to banking IT operations. HQ‑RCA replaces the classification head of the classical DynEdge GNN with a Variational Quantum Circuit, achieving comparable F1 performance to the strongest classical baseline while simplifying the quantum readout to a single Pauli‑Z expectation. Experiments on 13 k anonymised alarm clusters from a major European bank demonstrate that the quantum component can be executed on NISQ hardware without error mitigation, using a gradient‑free grid scan for optimisation.
arXiv:2607. 20377v1 Announce Type: cross Abstract: Quantum-kernel methods encode a dataset's geometry in a Gram matrix, so learning claims on hardware kernels assume the intended geometry survives execution.
The study evaluates quantum machine learning (QML) models for network intrusion detection against well-tuned classical baselines across four standard datasets, using a leakage-controlled protocol and noise simulation. It introduces a quantum-attribution audit to determine whether any performance gains are truly due to quantum effects. While most tuned classical models match or surpass QML, two quantum approaches— a quantum-kernel SVM and a small hybrid circuit—show statistically significant advantages on specific metrics and tasks.
Quantum Neural Networks (QNNs) are a promising framework for quantum machine learning on near-term quantum devices, but their security risks remain insufficiently understood. Studies have shown that QNNs are vulnerable to backdoor attacks, yet existing quantum backdoors mostly rely on a fixed trigger shared by all poisoned inputs.
arXiv:2607. 11843v1 Announce Type: cross Abstract: Quantum Neural Networks (QNNs) are a promising framework for quantum machine learning on near-term quantum devices, but their security risks remain insufficiently understood.
arXiv:2606. 26873v1 Announce Type: cross Abstract: Graphs provide a natural language for relational data in chemistry, biology and optimisation.
The paper proposes Entanglement-Weighted Pruning (EWP), a method for unlearning a client’s contribution from a federated quantum classifier without retraining from scratch. EWP scores each trainable circuit parameter by combining a Fisher‑information estimate on the target client’s data with a structural entanglement weight, pruning the lowest‑scoring parameters and optionally fine‑tuning the remaining ones. Experiments on a four‑qubit data‑re‑uploading ansatz trained with FedAvg across five simulated supply‑chain‑risk clients show that EWP achieves accuracy comparable to full retraining while reducing forgetting and wall‑clock time by about sixteenfold, outperforming random, Fisher‑only, or entanglement‑only pruning.
arXiv:2510. 03389v2 Announce Type: replace-cross Abstract: Current quantum computers require algorithms that use limited resources economically.
arXiv:2512. 09586v2 Announce Type: replace-cross Abstract: Quantum circuit design is a key bottleneck for practical quantum machine learning on complex, real-world data.
arXiv:2607. 01329v1 Announce Type: cross Abstract: The geometric and topological structure of quantum cost landscapes (QCLs) governs the optimization and thus the predictive power of variational quantum algorithms (VQAs).
The paper compares classical and hybrid quantum machine learning models for a trigger-like binary classification task using CMS open data. Eight classical models (SVM, ANN, CNN, LSTM) and eight quantum counterparts are evaluated under identical preprocessing, data splits, and decision thresholds, with performance measured by accuracy, ROC‑AUC, F1‑score, precision, and recall. The best classical model is an artificial neural network (93.53 % accuracy, 0.9819 ROC‑AUC), while the best quantum model is a quantum convolutional network (90.89 % accuracy, 0.9731 ROC‑AUC), indicating that within an eight‑qubit budget the quantum models do not surpass the classical ones.
arXiv:2602. 16018v2 Announce Type: replace-cross Abstract: Graph neural networks (GNNs) are a powerful framework for learning representations from graph-structured data, but their direct implementation on near-term quantum hardware remains challenging due to circuit depth, multi-qubit interactions, and qubit scalability constraints.
arXiv:2606. 01291v1 Announce Type: cross Abstract: Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations: classical statevector simulation memory scales exponentially ($\mathcal{O}(2^n)$), and global cost functions suffer from barren plateaus where gradient variance decays exponentially ($\mathcal{O}(1/2^n)$).