SearcharxivSearch

arXiv · 2604.11022

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

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Nouhaila Innan, Rachmad Vidya Wicaksana Putra, Muhammad Shafique. 2026-04-13. SPATE: Spiking-Phase Adaptive Temporal Encoding for Quantum Machine Learning. https://arxiv.org/abs/2604.11022

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph