Evaluation of Variational Quantum Classifiers (VQC) for Cyberattack Detection in the NISQ Era

• URL: http://arxiv.org/abs/2606.21715v1
• Date: Fri, 19 Jun 2026 20:00:48 GMT
• Title: Evaluation of Variational Quantum Classifiers (VQC) for Cyberattack Detection in the NISQ Era
• Abstract summary: Variational Quantums (VQC) can detect network anomalies in the era of Noisy Intermediate-Scale Quantum (NISQ) systems.<n>Model was trained on a class-balanced set spanning the 22 raw NSL-KDD attack categories and evaluated as a probe of representational capacity.<n>We interpret this behavior as consistent with the loss of linear separability induced by excessive compression.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper investigates the effectiveness and structural limits of Variational Quantum Classifiers (VQC) for detecting network anomalies in the era of Noisy Intermediate-Scale Quantum (NISQ) systems. Using the official 20\% research subset of the NSL-KDD dataset, a 4-qubit classifier featuring a 24-parameter trainable ansatz was developed, utilizing amplitude encoding to embed 16 principal components. On a held-out partition of this subset, the model achieved a consistent binary-classification accuracy of 88\%. A comparative evaluation with two fundamentally different optimizers, COBYLA and SPSA, found that the observed performance plateau is not attributable to convergence to local minima, a result we interpret as consistent with an encoding-related expressibility limit rather than an optimization artifact. An architectural parity comparison with a classical neural network (a Tiny MLP with four nodes, achieving 97\% accuracy) highlighted the expressiveness gap associated with data overcompression into restricted quantum states. The model was trained on a class-balanced set spanning the 22 raw NSL-KDD attack categories and evaluated in-sample as a probe of representational capacity: under this configuration the VQC reached only 9\% accuracy and exhibited a degenerate mode collapse onto a small subset of classes. We interpret this behavior as consistent with the loss of linear separability induced by excessive compression in the quantum probability space, while explicitly noting that our experiments do not isolate the encoding from the ansatz depth, optimizer budget, and measurement-decoding scheme (see Limitations). Motivated by these observations and by Cover's theorem, we outline an alternative paradigm: a 16-qubit VQC with angle encoding that expands the Hilbert-space representation rather than relying on aggressive classical dimensionality reduction.

Related papers

• Hybrid Quantum-Classical NLP Classification with Compact Semantic Representations: An Experimental Analysis of Representation Compression [4.18874340076966]
  Large language and sentence-embedding models provide rich semantic representations, but their high dimensionality poses a challenge for machine learning.<n>We investigate a hybrid quantum-classical pipeline that transforms high-dimensional sentence embeddings into compact representations for variational quantum classification.<n>We show that supervised dimensionality reduction can preserve task-relevant information far more effectively than variance-based compression.
  arXiv  Detail & Related papers  (2026-09-09T12:09:50Z)
• Discretization-Aware Fine-Tuning for Quantum Machine Learning with Chemical Foundation Models [0.0]
  Key challenge in practical quantum machine learning (QML) is the limited capacity of near-term quantum devices to encode high-dimensional classical data into small quantum registers.<n>We introduce discretization-aware fine-tuning (DAFT), a method that adapts a pre-trained chemical foundation model to produce representations that remain informative after quantization.<n>We evaluate both quantum and classical models under a controlled setting in which they receive identical discretized bit-string inputs.
  arXiv  Detail & Related papers  (2026-09-02T23:36:29Z)
• Quantum-Inspired Hybrid Neural Networks for Neural Decoding: A Controlled Ablation Study of Learnable Quantum Sidecar Integration [5.2726003549534655]
  We study parameterized quantum circuits (PQCs) integrated as residual sidecar modules within a ResNet-50 backbone for neural population decoding.<n>We compare four model variants: baseline, quantum sidecar with frozen input projection, quantum sidecar with backbone-gradient-trained projection, and a measurement-guided variant that aligns angle encodings with circuit measurement outcomes.
  arXiv  Detail & Related papers  (2026-08-23T15:55:43Z)
• EQE-QAOA: An Equivalence-Preserving Qubit Efficient Framework for Combinatorial Optimization [54.05451096499336]
  Existing techniques rely on qubit reduction at the cost of information loss, leading to degraded computational performance.<n>We propose the Equivalence-preserving Qubit Efficient QAOA, which significantly reduces the required number of qubits without degrading performance.<n>We show that it is broadly applicable to large-scale optimization problems, excluding only unconstrained problems with completely independent variables.
  arXiv  Detail & Related papers  (2026-04-20T13:57:49Z)
• Towards Joint Quantization and Token Pruning of Vision-Language Models [53.978753457744055]
  Token pruning and low-bit quantization are complementary for reducing inference costs.<n>We present a collaborative quantization-and-pruning framework that unifies low-bit inference and deterministic visual-token pruning.<n> Experiments on standard VLM benchmarks show improved robustness over stage-wise baselines under the same low-bit regime.
  arXiv  Detail & Related papers  (2026-04-19T08:18:29Z)
• Cluster-Adaptive Sample-Based Quantum Diagonalization for Strongly Correlated Systems [0.0]
  Strongly correlated electronic systems exhibit inherently multiconfigurational wave functions.<n>Quantum computing has emerged as a promising route to alleviate these limitations.<n>We introduce cluster-adaptive SQD, which clusters measurement samples via unsupervised learning.
  arXiv  Detail & Related papers  (2026-03-10T08:24:08Z)
• CR-QAT: Curriculum Relational Quantization-Aware Training for Open-Vocabulary Object Detection [2.751147407342378]
  We propose curriculum relational quantization-aware training (CR-QAT)<n>CR-QAT mitigates error accumulation by partitioning the model for progressive quantization, ensuring stable optimization via error isolation.<n>Experiments on LVIS and zero-shot benchmarks demonstrate that CR-QAT consistently outperforms existing QAT baselines under aggressive low-bit settings.
  arXiv  Detail & Related papers  (2026-03-06T06:57:55Z)
• Noise-adaptive hybrid quantum convolutional neural networks based on depth-stratified feature extraction [7.6371555592843565]
  We propose a noise-adaptive hybrid QCNN that improves classification under noise by exploiting depth-stratified intermediate measurements.<n>This hybrid hierarchical design enables noise-adaptive inference by integrating quantum intermediate measurements with classical post-processing.
  arXiv  Detail & Related papers  (2026-02-25T14:34:52Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Quantum Convolution for Structure-Based Virtual Screening [0.0]
  Structure-based virtual screening (SBVS) is a key computational strategy for identifying potential drug candidates.<n>This study proposes a quantum convolutional neural network (QCNN) framework to estimate delta G_bind efficiently.
  arXiv  Detail & Related papers  (2025-07-13T15:03:43Z)
• Towards a tailored mixed-precision sub-8-bit quantization scheme for Gated Recurrent Units using Genetic Algorithms [39.979007027634196]
  Gated Recurrent Units (GRU) are difficult to tune due to their dependence on an internal state. We propose a modular integer quantization scheme for GRUs where the bit width of each operator can be selected independently.
  arXiv  Detail & Related papers  (2024-02-19T16:24:20Z)
• You Only Train Once: A Unified Framework for Both Full-Reference and No-Reference Image Quality Assessment [45.62136459502005]
  We propose a network to perform full reference (FR) and no reference (NR) IQA. We first employ an encoder to extract multi-level features from input images. A Hierarchical Attention (HA) module is proposed as a universal adapter for both FR and NR inputs. A Semantic Distortion Aware (SDA) module is proposed to examine feature correlations between shallow and deep layers of the encoder.
  arXiv  Detail & Related papers  (2023-10-14T11:03:04Z)
• Quantum machine learning for image classification [39.58317527488534]
  This research introduces two quantum machine learning models that leverage the principles of quantum mechanics for effective computations. Our first model, a hybrid quantum neural network with parallel quantum circuits, enables the execution of computations even in the noisy intermediate-scale quantum era. A second model introduces a hybrid quantum neural network with a Quanvolutional layer, reducing image resolution via a convolution process.
  arXiv  Detail & Related papers  (2023-04-18T18:23:20Z)
• Compact representations of convolutional neural networks via weight pruning and quantization [63.417651529192014]
  We propose a novel storage format for convolutional neural networks (CNNs) based on source coding and leveraging both weight pruning and quantization. We achieve a reduction of space occupancy up to 0.6% on fully connected layers and 5.44% on the whole network, while performing at least as competitive as the baseline.
  arXiv  Detail & Related papers  (2021-08-28T20:39:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.