Entanglement for Pattern Learning in Temporal Data with Logarithmic Complexity: Benchmarking on IBM Quantum Hardware
Mostafizur Rahaman Laskar, Richa Goel

TL;DR
This paper introduces a quantum entanglement-based framework for time series forecasting that achieves logarithmic complexity and demonstrates practical performance on IBM quantum hardware, highlighting entanglement as a valuable resource.
Contribution
It presents a novel quantum-native model for temporal data that leverages entanglement, enabling efficient learning with fewer data points and hardware resources.
Findings
QTS captures temporal patterns with fewer data points.
Experimental validation on IBM hardware shows practical feasibility.
Entanglement enhances temporal modelling in quantum computing.
Abstract
Time series forecasting is foundational in scientific and technological domains, from climate modelling to molecular dynamics. Classical approaches have significantly advanced sequential prediction, including autoregressive models and deep learning architectures such as temporal convolutional networks (TCNs) and Transformers. Yet, they remain resource-intensive and often scale poorly in data-limited or hardware-constrained settings. We propose a quantum-native time series forecasting framework that harnesses entanglement-based parameterized quantum circuits to learn temporal dependencies. Our Quantum Time Series (QTS) model encodes normalized sequential data into single-qubit rotations and embeds temporal structure through structured entanglement patterns. This design considers predictive performance with logarithmic complexity in training data and parameter count. We benchmark QTS…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
