SPATE: Spiking-Phase Adaptive Temporal Encoding for Quantum Machine Learning

• URL: http://arxiv.org/abs/2604.11022v1
• Date: Mon, 13 Apr 2026 05:41:03 GMT
• Title: SPATE: Spiking-Phase Adaptive Temporal Encoding for Quantum Machine Learning
• Abstract summary: This paper uses spike-based data representation as an effective encoding mechanism that incorporates temporal structure into quantum feature preparation.<n>A novel spike-driven temporal encoding method is proposed that converts real-valued tabular features into leaky-and-fire spike trains and maps spike statistics to quantum rotations.<n>Under stratified cross-validation, SPATE yields stronger representations across multiple datasets.
• Score: 3.1061484260786014
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Most quantum machine learning (QML) pipelines still rely on static encodings such as angle and amplitude maps, and this limits their ability to handle temporal information. To address this limitation, this paper uses spike-based data representation as an effective encoding mechanism that incorporates temporal structure into quantum feature preparation. Specifically, we propose Spiking-Phase Adaptive Temporal Encoding (SPATE), a novel spike-driven temporal encoding method that converts real-valued tabular features into leaky integrate-and-fire spike trains and maps spike statistics to quantum rotations, augmented with a small set of temporal qubits through controlled phase operations. An encoding-centric evaluation protocol is also introduced to assess representation quality independently of the classifier, covering centered kernel-target alignment (CKTA), Fisher-style separability, inter/intra-class distance ratios, silhouette score, normalized entropy, and pairwise total-variation (TVpair) collapse indicators. Under stratified cross-validation, SPATE yields stronger representations across multiple datasets. For example, SPATE reaches a CKTA of 0.966 and a Fisher score of 7.37 on Blobs, compared with a CKTA of 0.632 and a Fisher score of 0.70 using angle encoding, and achieves a CKTA of 0.506 on Moons, compared with 0.015 using angle or amplitude encoding. These gains translate into stronger hybrid quantum neural network performance within a fixed qubit budget across several tasks, including an accuracy of 0.826 and an AUC of 0.978 for Wine, as well as an accuracy of 0.840 and an AUC of 0.923 for Moons. These results demonstrate that SPATE provides a practical spike-to-phase interface for building more informative quantum feature representations under constrained resources.

Related papers

• EventShiftFlow: Towards Hardware-efficient FPGA-based Flow Estimation [43.77587889970362]
  Event-based vision sensors offer asynchronous, high-temporal-resolution measurements.<n>Many event-based motion estimation methods are computationally intensive and difficult to map to FPGA hardware.<n>We present a streaming velocity estimator that discretizes asynchronous events into fixed-duration time bins, constructs a 1-bit spatial occupancy grid, and evaluates multiple velocity hypotheses in parallel.
  arXiv  Detail & Related papers  (2026-05-27T11:13:58Z)
• UTOPYA: A Multimodal Deep Learning Framework for Physics-Informed Anomaly Detection and Time-Series Prediction [42.532335022354545]
  Anomaly detection in batch processes is hindered by transient dynamics, scarce fault labels, and reliance on singlemodality sensor data.<n>This work introduces UTOPYA, a multimodal framework that jointly addresses anomaly detection, time-series prediction, and phase classification in batch distillation.<n>A physics-informed regularisation scheme introduced in this work enforces temporal smoothness and thermodynamic monotonicity.
  arXiv  Detail & Related papers  (2026-05-18T10:28:15Z)
• Post-Cut Metadata Inference Attacks on Quantum Circuit Cutting Pipelines [3.9890357781493595]
  Quantum circuit cutting enables near-term quantum devices to execute workloads exceeding their qubit capacity by decomposing circuits into runnable fragments.<n>This creates a previously unexplored confidentiality surface: the fragment-level execution transcript observable by a semi-honest cloud provider.<n>We formalise this surface and demonstrate that post-cut transcripts constitute a practical metadata side channel.
  arXiv  Detail & Related papers  (2026-04-12T11:51:05Z)
• CAWN: Continuous Acoustic Wave Networks for Autoregressive Language Modeling [46.16066322190728]
  We introduce the Continuous Acoustic Wave Network (CAWN), a fully continuous sequence-mixing architecture.<n>Instead of discrete matrix-based attention, CAWN projects hidden states into multi-headed complex-domain phasors.<n>To prevent signal degradation over ultra-long contexts, we introduce a dual-gated Selective Phase Resonance mechanism.
  arXiv  Detail & Related papers  (2026-04-05T20:13:22Z)
• BiGain: Unified Token Compression for Joint Generation and Classification [47.040577759493004]
  BiGain is a training-free, plug-and-play framework that preserves generation quality while improving classification in accelerated diffusion models.<n>Our key insight is frequency separation, which disentangles fine detail from global semantics, enabling compression that respects both generative fidelity and discriminative utility.<n>Our analyses indicate that balanced spectral retention, preserving high-frequency detail and low/mid-frequency semantics, is a reliable design rule for token compression in diffusion models.
  arXiv  Detail & Related papers  (2026-03-12T17:55:53Z)
• LiQSS: Post-Transformer Linear Quantum-Inspired State-Space Tensor Networks for Real-Time 6G [85.58816960936069]
  Proactive and agentic control in Sixth-Generation (6G) Open Radio Access Networks (O-RAN) requires control-grade prediction under stringent Near-Time (Near-RT) latency and computational constraints.<n>This paper investigates a post-Transformer paradigm for efficient radio telemetry forecasting.<n>We propose a quantum-inspired state-space tensor network that replaces self-attention with stable structured state-space dynamics kernels.
  arXiv  Detail & Related papers  (2026-01-18T12:08:38Z)
• Noise-Adaptive Quantum Circuit Mapping for Multi-Chip NISQ Systems via Deep Reinforcement Learning [0.0]
  We present DeepQMap, a deep reinforcement learning framework that integrates a bidirectional Long Short-Term Memory based Dynamic Noise Adaptation network.<n>Our method continuously adapts to hardware dynamics through learned temporal representations of quantum system behavior.<n>DeepQMap achieves mean circuit fidelity of $0.920 pm 0.023$, representing a statistically significant 49.3% improvement over state-of-the-art QUBO methods.
  arXiv  Detail & Related papers  (2025-11-22T14:27:55Z)
• The CHASM-SWPC Dataset for Coronal Hole Detection & Analysis [2.0515802800471485]
  Coronal holes (CHs) are low-activity, low-density solar coronal regions with open magnetic field lines.<n>We developed a semi-automated pipeline to digitize SWPC maps into binary segmentation masks.<n>The resulting masks constitute the CHASM-SWPC dataset to train and test automated CH detection models.
  arXiv  Detail & Related papers  (2025-11-18T01:51:13Z)
• Identification of Capture Phases in Nanopore Protein Sequencing Data Using a Deep Learning Model [0.0]
  We develop a lightweight one-dimensional convolutional neural network (1D CNN) to detect capture phases in down-sampled signal windows.<n>Our best model, CaptureNet-Deep, achieved an F1 score of 0.94 and precision of 93.39% on held-out test data.<n>These results show that efficient, real-time capture detection is possible using simple, interpretable architectures.
  arXiv  Detail & Related papers  (2025-11-03T06:51:53Z)
• Decoding Correlated Errors in Quantum LDPC Codes [41.04211723135311]
  We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise.<n>The core of our approach is a graph augmentation and rewiring for interference (GARI) method, which modifies the correlated detector error model.<n>Preliminary FPGA implementation results show that such high accuracy can be achieved in real time, with a per-round average decoding latency of 273 ns and sub-microsecond latency in 99.99% of the decoding instances.
  arXiv  Detail & Related papers  (2025-10-15T19:59:05Z)
• TCUQ: Single-Pass Uncertainty Quantification from Temporal Consistency with Streaming Conformal Calibration for TinyML [0.0]
  TCUQ is a single pass, label free uncertainty monitor for streaming TinyML.<n>It converts short horizon temporal consistency captured via lightweight signals on posteriors.<n>A streaming conformal layer turns this score into a budgeted accept/abstain rule.
  arXiv  Detail & Related papers  (2025-08-18T13:12:14Z)
• NAF: Neural Attenuation Fields for Sparse-View CBCT Reconstruction [79.13750275141139]
  This paper proposes a novel and fast self-supervised solution for sparse-view CBCT reconstruction. The desired attenuation coefficients are represented as a continuous function of 3D spatial coordinates, parameterized by a fully-connected deep neural network. A learning-based encoder entailing hash coding is adopted to help the network capture high-frequency details.
  arXiv  Detail & Related papers  (2022-09-29T04:06:00Z)
• Convex Hull Prediction for Adaptive Video Streaming by Recurrent Learning [38.574550778712236]
  We propose a deep learning based method of content aware convex hull prediction. We employ a recurrent convolutional network (RCN) to implicitly analyze the complexity of video shots in order to predict their convex hulls. Our proposed model better approximations of the optimal convex hulls, and offers competitive time savings as compared to existing approaches.
  arXiv  Detail & Related papers  (2022-06-10T05:11:02Z)
• FastFlowNet: A Lightweight Network for Fast Optical Flow Estimation [81.76975488010213]
  Dense optical flow estimation plays a key role in many robotic vision tasks. Current networks often occupy large number of parameters and require heavy computation costs. Our proposed FastFlowNet works in the well-known coarse-to-fine manner with following innovations.
  arXiv  Detail & Related papers  (2021-03-08T03:09:37Z)

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.