A Programmable Linear Optical Quantum Reservoir with Measurement Feedback for Time Series Analysis

• URL: http://arxiv.org/abs/2602.17440v1
• Date: Thu, 19 Feb 2026 15:08:32 GMT
• Title: A Programmable Linear Optical Quantum Reservoir with Measurement Feedback for Time Series Analysis
• Abstract summary: We investigate a linear-optical quantum reservoir architecture for time-series processing based on multiphoton interference.<n>By sweeping the feedback strength, we identify three dynamical regimes and find that memory performance peaks near the stability boundary.<n>The proposed architecture is compatible with current photonic technology and lowers the experimental barrier to feedback-driven QRC for time-series analysis.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Feedback-driven quantum reservoir computing has so far been studied primarily in gate-based architectures, motivating alternative scalable, hardware-friendly physical platforms. Here we investigate a linear-optical quantum reservoir architecture for time-series processing based on multiphoton interference in a reconfigurable interferometer network equipped with threshold detectors and measurement-conditioned feedback. The reservoir state is constructed from coarse-grained coincidence features, and the feedback updates only a structured, budgeted subset of programmable phases, enabling recurrence without training internal weights. By sweeping the feedback strength, we identify three dynamical regimes and find that memory performance peaks near the stability boundary. We quantify temporal processing via linear memory capacity and validate nonlinear forecasting on benchmarks, namely Mackey-Glass series, NARMA$-n$ and non-integrable Ising dynamics. The proposed architecture is compatible with current photonic technology and lowers the experimental barrier to feedback-driven QRC for time-series analysis with competitive accuracy.

Related papers

• General theory of monitored Quantum Reservoir Computing [0.47248250311484113]
  We develop a theory of monitored quantum reservoir computing based on indirect quantum measurements.<n>We derive general criteria under which monitored dynamics satisfy the echo-state property, fading memory, and input separability.
  arXiv  Detail & Related papers  (2026-07-15T19:18:07Z)
• Temporal processing of quantum states with hybrid quantum-classical reservoirs [0.5161531917413708]
  A quantum-classical hybrid architecture combines a qubit quantum reservoir with a classical echo state network (ESN)<n>We show that the hybrid system outperforms its standalone components in both linear and nonlinear tasks.<n>These results establish hybrid quantum-classical reservoir computing as a practical and scalable route for enhanced quantum machine learning on near-term qubit hardware.
  arXiv  Detail & Related papers  (2026-06-19T11:14:13Z)
• Digital Quantum Reservoir Computing for ATM Time Series Prediction [0.0]
  We investigate a digital quantum reservoir computing framework for multi-step forecasting of ATM cash demand time series.<n>The proposed approach uses parametrized four-qubit reservoirs with a fixed structure exploiting partial measurement and reset.<n>Experiments are performed with noiseless simulation, noise-aware emulation, and a real IQM Spark quantum processor.
  arXiv  Detail & Related papers  (2026-06-03T10:11:07Z)
• An Analytical Approach to Design Space Exploration for Cavity-Mediated Quantum State Transfer in Multi-core Architectures [1.2965006649422552]
  We derive exact analytical expressions for the state transfer dynamics of a two-qubit system coupled via a waveguide.<n>Our framework provides a significant computational speedup compared to standard numerical solvers.<n>We propose a simplified latency model and an efficiency-based function to enable rapid identification of optimal operating points.
  arXiv  Detail & Related papers  (2026-04-30T10:01:24Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Quantum reservoir computing using Jaynes-Cummings model [0.6308539010172308]
  We investigate quantum reservoir computing using a hybrid qubit-boson system described by the Jaynes-Cummings (JC) Hamiltonian and its dispersive limit (DJC)<n>These models provide high-dimensional Hilbert spaces and intrinsic nonlinear dynamics, making them powerful substrates for temporal information processing.<n>We benchmark both reservoirs through linear and nonlinear memory tasks, demonstrating that they exhibit an unusual superior nonlinear over linear memory capacity.
  arXiv  Detail & Related papers  (2025-09-30T18:46:20Z)
• Quantum reservoir computing for predicting and characterizing chaotic maps [0.3966519779235704]
  Quantum reservoir computing has emerged as a promising paradigm for harnessing quantum systems to process temporal data efficiently.<n>We demonstrate the capability of this approach to predict and characterize chaotic dynamics in discrete nonlinear maps.<n>Results highlight quantum reservoir computing as a scalable and noise-resilient tool for modeling complex dynamical systems.
  arXiv  Detail & Related papers  (2025-09-15T15:55:59Z)
• Multivariate Long-term Time Series Forecasting with Fourier Neural Filter [42.60778405812048]
  We introduce FNF as the backbone and DBD as architecture to provide excellent learning capabilities and optimal learning pathways for spatial-temporal modeling.<n>We show that FNF unifies local time-domain and global frequency-domain information processing within a single backbone that extends naturally to spatial modeling.
  arXiv  Detail & Related papers  (2025-06-10T18:40:20Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• Hardware-Efficient Large-Scale Universal Linear Transformations for Optical Modes in the Synthetic Time Dimension [0.6384650391969042]
  We introduce a hardware-efficient time-domain photonic processor that achieves at least an exponential reduction in component count.<n>Our results establish a practical pathway toward near-term, scalable, and reconfigurable photonic processors.
  arXiv  Detail & Related papers  (2025-05-01T21:14:48Z)
• Generative System Dynamics in Recurrent Neural Networks [56.958984970518564]
  We investigate the continuous time dynamics of Recurrent Neural Networks (RNNs)<n>We show that skew-symmetric weight matrices are fundamental to enable stable limit cycles in both linear and nonlinear configurations.<n> Numerical simulations showcase how nonlinear activation functions not only maintain limit cycles, but also enhance the numerical stability of the system integration process.
  arXiv  Detail & Related papers  (2025-04-16T10:39:43Z)
• Feedback-enhanced quantum reservoir computing with weak measurements [1.474723404975345]
  We develop a feedback-enhanced quantum reservoir computing framework.<n>We show that our model outperforms conventional QRC approaches in many cases.<n>These findings highlight the potential of feedback-enhanced QRC for next-generation quantum machine learning applications.
  arXiv  Detail & Related papers  (2025-03-23T04:47:06Z)
• Fast and Reliable Probabilistic Reflectometry Inversion with Prior-Amortized Neural Posterior Estimation [73.81105275628751]
  Finding all structures compatible with reflectometry data is computationally prohibitive for standard algorithms. We address this lack of reliability with a probabilistic deep learning method that identifies all realistic structures in seconds. Our method, Prior-Amortized Neural Posterior Estimation (PANPE), combines simulation-based inference with novel adaptive priors.
  arXiv  Detail & Related papers  (2024-07-26T10:29:16Z)
• Feedback-driven quantum reservoir computing for time-series analysis [1.1920094285063136]
  Quantum reservoir computing (QRC) is a promising computational paradigm that leverages quantum systems as a computational resource for nonlinear information processing. We propose a feedback-driven QRC framework for time-series analysis. We demonstrate that our QRC successfully acquires the fading-memory property through the feedback connections.
  arXiv  Detail & Related papers  (2024-06-22T08:28:08Z)
• Spatio-Temporal Recurrent Networks for Event-Based Optical Flow Estimation [47.984368369734995]
  We introduce a novel recurrent encoding-decoding neural network architecture for event-based optical flow estimation. The network is end-to-end trained with self-supervised learning on the Multi-Vehicle Stereo Event Camera dataset. We have shown that it outperforms all the existing state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2021-09-10T13:37:37Z)
• Lipschitz Recurrent Neural Networks [100.72827570987992]
  We show that our Lipschitz recurrent unit is more robust with respect to input and parameter perturbations as compared to other continuous-time RNNs. Our experiments demonstrate that the Lipschitz RNN can outperform existing recurrent units on a range of benchmark tasks.
  arXiv  Detail & Related papers  (2020-06-22T08:44:52Z)
• Supporting Optimal Phase Space Reconstructions Using Neural Network Architecture for Time Series Modeling [68.8204255655161]
  We propose an artificial neural network with a mechanism to implicitly learn the phase spaces properties. Our approach is either as competitive as or better than most state-of-the-art strategies.
  arXiv  Detail & Related papers  (2020-06-19T21:04:47Z)

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.