Tactile Internet (TI) security analytics must balance reliable thresholded decisions with constrained computational and measurement resources. We study this tension for finite-shot hybrid quantum anomaly inference and introduce the Adaptive-Shot Variational Quantum Circuit (AS-VQC) policy. This validation-calibrated policy begins each record at 128 shots and cumulatively escalates through 256, 512, and 1024 shots only when the finite-shot anomaly score remains close to a validation-selected security threshold. The quantum scorer is evaluated as an off-path security analytics component rather than part of the haptic critical path. Using a 4,875-record CESNET-TimeSeries24-derived aggregate-flow benchmark, leakage-safe random, entity-group-disjoint, and temporal holdouts, and five trained quantum neural network (QNN) checkpoints per holdout, the primary AS-VQC-95 (beta = 0.95) policy averages 129.2, 276.9, and 131.2 shots per record, saving 87.4%, 73.0%, and 87.2% of the uniform 1024-shot baseline (Fixed-1024), respectively. The decision disagreement with analytic (exact-expectation) inference is 0.771%, 0.409%, and 0.635%, lower than both the uniform 128-shot baseline (Fixed-128) and a matched-budget shuffled-allocation control. Fixed-1024 remains more decision-stable, establishing a measurable reliability-resource trade-off rather than cost-free equivalence. A more conservative AS-VQC-99 (beta = 0.99) further reduces disagreement while using fewer than 512 average shots across all holdouts. These results show that finite quantum measurements can be treated as an inference resource and concentrated on boundary-sensitive TI-security decisions while exposing checkpoint-dependent escalation under unseen-entity conditions.
Tactile Internet (TI) security analytics must balance reliable thresholded decisions with constrained computational and measurement resources. We study this tension for finite-shot hybrid quantum anomaly inference and introduce the Adaptive-Shot Variational Quantum Circuit (AS-VQC) policy. This validation-calibrated policy begins each record at 128 shots and cumulatively escalates through 256, 512, and 1024 shots only when the finite-shot anomaly score remains close to a validation-selected security threshold. The quantum scorer is evaluated as an off-path security analytics component rather than part of the haptic critical path. Using a 4,875-record CESNET-TimeSeries24-derived aggregate-flow benchmark, leakage-safe random, entity-group-disjoint, and temporal holdouts, and five trained quantum neural network (QNN) checkpoints per holdout, the primary AS-VQC-95 (beta = 0.95) policy averages 129.2, 276.9, and 131.2 shots per record, saving 87.4%, 73.0%, and 87.2% of the uniform 1024-shot baseline (Fixed-1024), respectively. The decision disagreement with analytic (exact-expectation) inference is 0.771%, 0.409%, and 0.635%, lower than both the uniform 128-shot baseline (Fixed-128) and a matched-budget shuffled-allocation control. Fixed-1024 remains more decision-stable, establishing a measurable reliability-resource trade-off rather than cost-free equivalence. A more conservative AS-VQC-99 (beta = 0.99) further reduces disagreement while using fewer than 512 average shots across all holdouts. These results show that finite quantum measurements can be treated as an inference resource and concentrated on boundary-sensitive TI-security decisions while exposing checkpoint-dependent escalation under unseen-entity conditions.
Network intrusion detection systems (NIDS) must classify high-dimensional, heavily imbalanced traffic flows under tight operational constraints, and the flow features produced by modern capture tools routinely exceed the qubit budgets available on today’s noisy intermediate-scale quantum (NISQ) hardware. Existing quantum machine-learning (QML) detectors typically either assume that every extracted feature can be encoded on a dedicated qubit or apply generic dimensionality reduction that is blind to the downstream quantum encoder; in both cases the qubit budget — the binding constraint on real devices — never drives which features are encoded, and evaluation is frequently confined to ideal statevector simulation that omits shot noise, depolarizing error, and readout confusion. This paper presents ANHQ-IDS, an adaptive, noise aware hybrid quantum intrusion-detection framework that makes the qubit budget a first-class design constraint. A resource-constrained feature-selection stage scores candidate features through a composite objective jointly balancing mutual-information relevance, inter-feature redundancy, cross-split stability, and an explicit quantum-encoding cost, and greedily selects a subset sized to a target qubit budget rather than fixed a priori. The retained features are embedded through parameterized angle and second-order (ZZ) feature maps and classified by a hardware-efficient variational quantum classifier (VQC) trained with gradient-free optimizers (COBYLA and SPSA) under finite-shot sampling. To characterize behaviour under realistic hardware conditions, the classifier is evaluated on a statevector reference and under synthetic depolarizing and readout-error models, and benchmarked on CIC-IDS2017 against classical baselines (logistic regression, random forest, support vector machine) using a leakage-resistant train/validation/test protocol. On a class-balanced CIC-IDS2017 benchmark, the ZZ-encoded VQC attains macro-F1 0.766 and ROC-AUC 0.853 under exact simulation — exceeding logistic regression (0.502) and approaching a support-vector baseline, while a random forest remains strongest (0.964); performance degrades gracefully under depolarizing and readout noise, consistent with the predicted (1−p) contraction. All preprocessing, feature-selection, and quantum-training components are released as a reproducible Qiskit package with fixed seeds and recorded circuit-resource metadata (qubits, depth, gate and parameter counts).
Variational quantum algorithms (VQAs) are promising for near-term noisy intermediate-scale quantum (NISQ) devices, but their performance is often limited by device noise, finite-shot uncertainty, and nonstationary behavior that destabilize optimization. This paper proposes a cost-aware closed-loop hybrid framework (Adaptive V16) that augments a standard VQA loop with an online decision policy to adapt measurement effort and mitigation actions during execution. At each iteration, the controller uses runtime signals such as objective progress and uncertainty to select an action comprising the shot budget, mitigation mode, and step-scaling factor, explicitly trading solution improvement against resource overhead under a fixed budget. Experimental evaluation on a representative molecular Hamiltonian optimization task shows that Adaptive V16 achieves a lower final energy than a static VQE baseline and reduces the absolute error from 0.1391 to 0.0657. The controller’s decision module also demonstrates strong predictive performance with 0.9700 accuracy, 0.9595 F1-score, and 0.9951 ROC–AUC, indicating reliable adaptive behavior across thresholds. These results suggest that policy-driven adaptation can improve robustness and budget efficiency for hybrid quantum–classical optimization in realistic NISQ settings.
Quantum machine learning (QML) is increasingly investigated for network intrusion detection, but the practical value of current quantum models remains uncertain because many studies rely on small simulated data sets, idealized execution, weak classical baselines, or isolated accuracy comparisons. This study develops and evaluates a resource-aware hybrid quantum-classical intrusion detection framework that combines fixed fidelity quantum kernels, repaired Quantum Kernel Alignment (QKA), a Variational Quantum Classifier (VQC), LightGBM, prototype-based kernel reduction, and probabilistic stacking. Experiments use the UNSW-NB15 benchmark under a leakage-aware preprocessing protocol and repeated evaluation across five random seeds. The experimental program covers 4- and 6-qubit representations, multiple training sizes, prototype budgets, and finite-shot configurations, yielding 260 experimental configurations/runs. The strongest quantum-assisted model, a 6-qubit QKA-VQC-LightGBM stack at 100 samples per class, obtains mean F1=0.8480, MCC=0.7092, ROC-AUC=0.9398, and PR-AUC=0.9302. Repaired QKA improves F1 from 0.8043 for the corresponding fixed kernel to 0.8089, while 50-prototype QKA attains F1=0.8257 with a more favorable kernel-workload trade-off than larger prototype budgets. Finite-shot experiments between 1,024 and 4,096 shots remain stable in simulation. However, full-data LightGBM remains stronger overall (F1=0.8957, MCC=0.8068, ROC-AUC=0.9755, PR-AUC=0.9704), and corrected statistical tests do not establish general quantum superiority. These findings motivate a Selective Quantum Intrusion Detection System (S-QIDS), in which classical inference handles high-confidence traffic and quantum processing is reserved for uncertain, novel, or high-risk observations. The study therefore reframes near-term quantum intrusion detection from unconditional quantum advantage toward measurable quantum utility, quantum-classical complementarity, and resource-aware quantum intervention.
The practical value of quantum machine learning for network anomaly detection remains unclear under controlled and comparable benchmarking conditions. This study evaluates a trash-qubit-based Quantum Autoencoder (QAE) against seven classical anomaly-detection methods on UNSW-NB15 using shared data partitions, preprocessing steps, model selection procedures, and threshold calibration protocols. The experimental design included five independent seeds, three training set sizes, two feature budgets, and 12 QAE architectures, together with low-FPR analysis, finite-shot and synthetic-noise evaluation, less-constrained classical reference settings, and a cross-dataset assessment on TON_IoT. The Angle-RY encoding with a Real-Amplitudes Ring ansatz at depth L = 2 achieved the highest mean validation-selection AUPRC. On UNSW-NB15, the QAE was competitive in AUPRC and AUROC but remained behind the strongest classical baselines in F1-score, and its attack recall declined sharply under low-FPR constraints. The TON_IoT results further showed that relative model performance depended on the dataset. Under finite-shot and synthetic-noise conditions, anomaly-score rankings were largely preserved, whereas threshold-based decisions were more sensitive. Overall, the QAE showed competitive continuous-score discrimination on UNSW-NB15, but achieving reliable detection at low false-alarm rates remains a key operational challenge.
There is a pressing need for anomaly detection algorithms that can handle large amounts of diverse traffic data due to the quick growth of networked systems and the sophistication of contemporary cyberattacks. Despite the widespread use of conventional machine learning techniques for network intrusion detection, feature representation constraints, dataset imbalance, and the computational expense of scaling to vast problem spaces sometimes restrict their efficacy. In the meantime, new developments in quantum-assisted computation have opened up exciting possibilities for using quantum state changes to improve the feature learning process. Using the NF-UNSWNB15-v2 benchmark, this research presents HybridQCNN, a unique quantum-classical computing framework for binary classification of network traffic.The proposed architecture combines standard preprocessing techniques with an 8-qubit Parameterized Quantum Circuit (PQC) featuring multiple variational layers, where IsingXX and IsingYY entangling operations are applied to encode interfeature correlations, and a subsequent fully connected classical layer handles the final binary decision. A rigorous leakage-free data partitioning protocol was enforced, ensuring that all preprocessing transformations—including feature encoding, normalization, and threshold computation—were derived exclusively from the training subset, thereby preventing any information leakage from held-out partitions during evaluation. Experimental validation on a class-balanced subset of 60,000 traffic records yielded a classification accuracy of 97.33%, an F1-score of 0.9730, and a malicious traffic detection precision of 98.38%. Furthermore, the model achieved an AUC-ROC of 0.9861, reflecting strong class-level discriminability. Despite this performance, the entire model contains only 489 trainable parameters, underscoring the parameter efficiency of hybrid architectures relative to conventional deep learning baselines. These results suggest that integrating variational quantum circuits with classical inference modules provides an effective and scalable solution for network anomaly detection.
Any algorithm execution on quantum computers requires several repeated and costly executions (known as shots) to obtain reliable results. In this work, we propose a closed-form accurate analytical expression to determine optimal number of shots required for reliable execution of any algorithm on a quantum computer. We also present a theoretically grounded technique to distribute fixed shot budget across different partitions in a quantum circuit minimizing the total error. Our proposed analytical model helps to reduce the shots associated with reliable execution of quantum algorithms by about 58\% compared to current practice, in turn reducing the energy consumption by upto 62\%. Furthermore, our proposed optimal shot allocation technique across different partitions reduces total error by up to 73\% compared to conventional approaches.