Hybrid Quantum–Classical Models for Forecasting and Anomaly Detection on Edge IoT Devices
Bibliographic record
Abstract
The growing complexity of Internet of Things (IoT) networks has generated massive multivariate time-series data at the edge, challenging traditional forecasting and anomaly-detection models due to limited computation, memory, and energy on edge devices. Quantum machine learning (QML) provides a promising solution through expressive, parameter-efficient models that align with these constraints. This study proposes two distinct quantum-classical approaches for edge-based IoT analytics. The first combines a Quantum Neural Network (QNN) with a Quantum Autoencoder (QAE) to deliver lightweight forecasting and anomaly detection. The second employs Quantum Long Short-Term Memory (QLSTM) networks, exploring multiple variants and introducing optimization strategies to enable efficient deployment on a Raspberry Pi 5 using PennyLane simulators. Both approaches are evaluated on two real-world IoT datasets Bker (weather parameters) and ETTm1 (transformer temperature) and with a unified preprocessing pipeline incorporating normalization and PCA-based dimensionality reduction. Results show that QLSTM variants achieve superior forecasting accuracy, while QNN+QAE ensures robust anomaly detection with minimal resource overhead. A lightweight QLSTM variant strikes the best balance between accuracy and inference latency, enabling real-time edge deployment. To our knowledge, this is among the first practical demonstrations of QML-based forecasting and anomaly detection directly on edge hardware, highlighting a feasible pathway toward quantum-enhanced IoT intelligence.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".