A 4-qubit quantum predicate head in CFEN achieves 57.25% mR@100 on Visual Genome 150 long-tailed predicates versus 41.1% classical, using 96 parameters and 256x feature compression.
SPATE: Spiking-Phase Adaptive Temporal Encoding for Quantum Machine Learning
3 Pith papers cite this work. Polarity classification is still indexing.
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.
years
2026 3representative citing papers
A hybrid quantum-classical temporal graph network with adaptive amplitude encoding claims strong link-prediction results on five TGBL benchmarks, but the evaluation is undermined by a below-random baseline and missing code.
A quantum-enhanced spiking Q-network is reported to outperform classical, spiking, and quantum-dense baselines in small grid-world navigation, with gains that are small relative to the reported error bars.
citing papers explorer
-
QPredSGG: Hybrid Quantum Predicate Learning for Long-Tailed Scene Graph Generation
A 4-qubit quantum predicate head in CFEN achieves 57.25% mR@100 on Visual Genome 150 long-tailed predicates versus 41.1% classical, using 96 parameters and 256x feature compression.
-
A2QTGN: Adaptive Amplitude Quantum-Integrated Temporal Graph Network for Dynamic Link Prediction
A hybrid quantum-classical temporal graph network with adaptive amplitude encoding claims strong link-prediction results on five TGBL benchmarks, but the evaluation is undermined by a below-random baseline and missing code.
-
Q-SpiRL: Quantum Spiking Reinforcement Learning for Adaptive Robot Navigation
A quantum-enhanced spiking Q-network is reported to outperform classical, spiking, and quantum-dense baselines in small grid-world navigation, with gains that are small relative to the reported error bars.