arXiv subjects

Lina Jaurigue

Publications and source records attributed to Lina Jaurigue.

At least 19 recordsLinked to original sources

arXiv2026

Reconstructing the information processing capacity of physical systems from noisy observations

Driven dynamical systems can compute when their transient states encode complex transformations of past inputs. The information processing capacity (IPC) framework allows for a detailed accounting of these computational properties, however its interpretation in noisy systems has remained incomplete. In this work, we clarify how noise affects the IPC and how one can reconstruct the noiseless IPC. First, we show how to distinguish the dynamics of an unperturbed system from the noise-free component of the stochastic dynamics: The IPC measured for responses averaged over noise realizations is in general not the same as the IPC of the unperturbed system. We explicitly demonstrate that noise can redistribute computational capacity and sometimes even enhance performance on particular tasks, rather than merely degrading a fixed computation. We then introduce covariance reconstruction by orthogonal projection (CROP), which reconstructs the covariance and IPC of the noise-free component directly from noisy observations, without requiring a detailed model of either the system or the noise. At fixed total measurement budget, numerical tests on a classical nonlinear reservoir show that CROP estimates the noise-free IPC more accurately than the standard practice of ensemble averaging over repeated trials. We find the same advantage in a quantum reservoir subject to unavoidable measurement noise. Our results provide a general route to recovering the computational structure of noisy physical systems from finite observations.

nlin.AO↗

arXiv2026

Optically Writable Atomic Vapor Memory as a Substrate for Optical Reservoir Computing

We present an optical random access memory (ORAM) based on warm cesium (Cs) atomic vapor and demonstrate its operation as the physical substrate of a reservoir computer. Information is stored in the hyperfine population distribution of a Cs ensemble via optical pumping and retrieved through differential probe absorption. Spatial multiplexing via acousto-optic deflection provides eight addressable memory rails able to store up to 3.8 bits of information per rail. Employing this platform as a temporally multiplexed reservoir, we achieve a kernel rank ($\mathrm{KR}= 8.8 \pm 0.4$), and a minimum bit error rate of $0.02 \pm 0.01$ on the Exclusive-or (XOR) benchmark. We find the limited memory lifetime constrains the achievable temporal depth, encouraging further research into fast addressable memories. This constitutes the first demonstration of a free-space, optically writable atomic RAM as a substrate in an optical reservoir computing system.

physics.atom-ph↗

arXiv2026

Disentangling Memory and Nonlinearity in Time-Multiplexed Optical Reservoir Computing

We analyze and disentangle the individual and combined roles of nonlinearity, transient dynamics, and delayed feedback, and investigate how these mechanisms contribute to different task requirements in photonic reservoir computing. This is achieved using a passive linear photonic reservoir in which a photodiode at the optical-to-electrical interface provides the sole source of nonlinearity. We demonstrate how the requirements of different tasks can be quantified and compared to the dynamics provided by the reservoir by explicitly calculating and comparing the contributing monomials. Our findings include that a reservoir with uncoupled virtual nodes and a quadratic nonlinearity can already achieve good performance for tasks derived from dynamical systems with quadratic nonlinearities, such as the Lorenz63 system. Furthermore, transient coupling and delayed feedback significantly enhance the computational capabilities by compensating for missing higher-order monomials through an effective multi-step integration scheme, given the minimum nonlinearity required for the task is present in the reservoir.

nlin.CD↗

arXiv2025

Prediction performance of random reservoirs with different topology for nonlinear dynamical systems with different number of degrees of freedom

Reservoir computing (RC) is a powerful framework for predicting nonlinear dynamical systems, yet the role of reservoir topology$-$particularly symmetry in connectivity and weights$-$remains not adequately understood. This work investigates how the structure of the network influences the performance of RC in four systems of increasing complexity: the Mackey-Glass system with delayed-feedback, two low-dimensional thermal convection models, and a three-dimensional shear flow model exhibiting transition to turbulence. Using five reservoir topologies in which connectivity patterns and edge weights are controlled independently, we evaluate both direct- and cross-prediction tasks. The results show that symmetric reservoir networks substantially improve prediction accuracy for the convection-based systems, especially when the input dimension is smaller than the number of degrees of freedom. In contrast, the shear-flow model displays almost no sensitivity to topological symmetry due to its strongly chaotic high-dimensional dynamics. These findings reveal how structural properties of reservoir networks affect their ability to learn complex dynamics and provide guidance for designing more effective RC architectures.

physics.flu-dyn↗

arXiv2025

Engineering Quantum Reservoirs through Krylov Complexity, Expressivity and Observability

This study employs Krylov-based information measures to understand task performance in quantum reservoir computing, a sub-field of quantum machine learning. In our study we show that fidelity and spread complexity can only explain the task performance for short time evolutions of the quantum systems. We then discuss two measures, Krylov expressivity and Krylov observability, and compare them to task performance and the information processing capacity. Our results show that Krylov observability exhibits almost identical behavior to information processing capacity, while being three orders of times faster to compute. In the case when the system is undersampled Krylov observability best captures the behavior of the task performance.

quant-ph↗

arXiv2025

From Krylov Complexity to Observability: Capturing Phase Space Dimension with Applications in Quantum Reservoir Computing

We demonstrate that time-evolved operators can construct a Krylov space to compute Operator complexity and introduce Krylov observability as a measure of effective phase space dimension in quantum systems. We test Krylov observability in the framework of quantum reservoir computing and show that it closely mirrors information processing capacity, a data-driven expressivity metric, while achieving computation times that are orders of magnitude faster. Our results validate Operator complexity and give the interpretation that data in a quantum reservoir is mapped onto the Krylov space.

quant-ph↗

arXiv2025

Data-Driven Performance Measures using Global Properties of Attractors for Black-Box Surrogate Models of Chaotic Systems

In climate systems, physiological models, optics, and many more, surrogate models are developed to reconstruct chaotic dynamical systems. We introduce four data-driven measures using global attractor properties to evaluate the quality of the reconstruction of a given surrogate time series. The measures are robust against the initial position of the chaotic system as they are based on empirical approximations of the correlation integral and the probability density function, both of which are global properties of the attractor. In contrast to previous methods, we do not need a manual fitting procedure, making the measures straightforward to evaluate. Using a hypothesis testing framework, we can systematically find and reject surrogate models whose reconstructions significantly differ from the true system. Further, we show that the measures can be used as a statistical ranking metric, which in practice allows for hyperparameter optimization. Applying our measures to reservoir computing with a low number of nodes, we demonstrate how the measures can be used to reject poor reconstructions and use them as a tool to find an optimal spectral radius for which considerably fewer solutions are rejected and the overall quality of the solution improves.

physics.comp-ph↗

arXiv2025

Influence of noise-induced modulations on the timing stability of passively mode-locked semiconductor laser subject to optical feedback

We show that passively mode-locked lasers subject to feedback from a single external cavity can exhibit large timing fluctuations on short time scales despite having a relatively small long-term timing jitter, meaning that the commonly used von Linde and Kéfélian techniques of experimentally estimating the timing jitter can lead to large errors in the estimation of the arrival time of pulses. We also show that adding a second feedback cavity of the appropriate length can significantly suppress noise-induced modulations that are present in the single feedback system. This reduces the short time scale fluctuations of the interspike interval time and at the same time improves the variance of the fluctuation of the pulse arrival times on long time scales.

physics.optics↗

arXiv2025

Utilizing rate-independent hysteresis for analog computing

Physical systems exhibiting hysteresis are increasingly being used in neuromorphic and in-memory computing research. Generally, the resistance switching of devices with rate-independent hysteresis are being investigated for their use as trainable weights in neural networks, whereas the dynamics of devices showing rate-dependent hysteresis are being investigate for their potential as nodes in, for example in reservoir computing systems. In our work we instead show the computing potential of a simple rate-independent hysteresis system. We show that by driving a system of only two linear branches with time-multiplexed inputs it is possible to generate nonlinear transforms and perform timeseries prediction tasks.

physics.comp-ph↗

arXiv2025

Roadmap on Neuromorphic Photonics

This roadmap consolidates recent advances while exploring emerging applications, reflecting the remarkable diversity of hardware platforms, neuromorphic concepts, and implementation philosophies reported in the field. It emphasizes the critical role of cross-disciplinary collaboration in this rapidly evolving field.

cs.ET↗

arXiv2024

High-Speed Time Series Prediction with a GHz-rate Photonic Spiking Neural Network built with a single VCSEL

Photonic technologies hold significant potential for creating innovative, high-speed, efficient and hardware-friendly neuromorphic computing platforms. Neuromorphic photonic methods leveraging ubiquitous, technologically mature and cost-effective Vertical-Cavity Surface Emitting Lasers (VCSELs) are of notable interest. VCSELs have demonstrated the capability to replicate neuronal optical spiking responses at ultrafast rates. These characteristics have triggered research into applying these key-enabling devices in spike-based photonic computing. Here, a GHz-rate photonic Spiking Neural Network (p-SNN) using a single VCSEL is reported, and its application to a complex time-series prediction task is demonstrated for the first time. The VCSEL p-SNN combined with a technique to induce network memory, is applied to perform multi-step-ahead predictions of a chaotic time-series. By providing the feedforward p-SNN with only two temporally separated inputs excellent accuracy is experimentally demonstrated over a range of prediction horizons. VCSEL-based p-SNNs therefore offer ultrafast, efficient operation in complex predictive tasks whilst enabling hardware implementations. The inherent attributes and performance of VCSEL p-SNNs hold great promise for use in future light-enabled neuromorphic computing hardware.

physics.comp-ph↗

arXiv2024

Time-multiplexed Reservoir Computing with Quantum-Dot Lasers: Does more complexity lead to better performance?

Reservoir computing with optical devices offers an energy-efficient approach for time-series forecasting. Quantum dot lasers with feedback are modelled in this paper to explore the extent to which increased complexity in the charge carrier dynamics within the nanostructured semiconductor can enhance the prediction performance. By tuning the scattering interactions, the laser's dynamics and response time can be finely adjusted, allowing for a systematic investigation. It is found that both system response time and task requirements need to be considered to find optimal operation conditions. Further, lasers with pronounced relaxation oscillations outperform those with strongly damped dynamics, even if the underlying charge carrier dynamics is more complex. This demonstrates that optimal reservoir computing performance relies not only on internal complexity but also on the effective utilization of these dynamics through the output sampling process.

physics.comp-ph↗

arXiv2024

Measurable Krylov Spaces and Eigenenergy Count in Quantum State Dynamics

In this work, we propose a quantum-mechanically measurable basis for the computation of spread complexity. Current literature focuses on computing different powers of the Hamiltonian to construct a basis for the Krylov state space and the computation of the spread complexity. We show, through a series of proofs, that time-evolved states with different evolution times can be used to construct an equivalent space to the Krylov state space used in the computation of the spread complexity. Afterwards, we introduce the effective dimension, which is upper-bounded by the number of pairwise distinct eigenvalues of the Hamiltonian. The computation of the spread complexity requires knowledge of the Hamiltonian and a classical computation of the different powers of the Hamiltonian. The computation of large powers of the Hamiltonian becomes increasingly difficult for large systems. The first part of our work addresses these issues by defining an equivalent space, where the original basis consists of quantum-mechanically measurable states. We demonstrate that a set of different time-evolved states can be used to construct a basis. We subsequently verify the results through numerical analysis, demonstrating that every time-evolved state can be reconstructed using the defined vector space. Based on this new space, we define an upper-bounded effective dimension and analyze its influence on finite-dimensional systems. We further show that the Krylov space dimension is equal to the number of pairwise distinct eigenvalues of the Hamiltonian, enabling a method to determine the number of eigenenergies the system has experimentally. Lastly, we compute the spread complexities of both basis representations and observe almost identical behavior, thus enabling the computation of spread complexities through measurements.

quant-ph↗

arXiv2024

Chaotic attractor reconstruction using small reservoirs -- the influence of topology

Forecasting timeseries based upon measured data is needed in a wide range of applications and has been the subject of extensive research. A particularly challenging task is the forecasting of timeseries generated by chaotic dynamics. In recent years reservoir computing has been shown to be an effective method of forecasting chaotic dynamics and reconstructing chaotic attractors from data. In this work strides are made toward smaller and lower complexity reservoirs with the goal of improved hardware implementability and more reliable production of adequate surrogate models. We show that a reservoir of uncoupled nodes more reliably produces long term timeseries predictions than complex reservoir topologies. We then link the improved attractor reconstruction of the uncoupled reservoir with smaller spectral radii of the resulting surrogate systems. These results indicate that, the node degree plays an important role in determining whether the desired dynamics will be stable in the autonomous surrogate system which is attained via closed-loop operation of the trained reservoir. In terms of hardware implementability, uncoupled nodes would allow for greater freedom in the hardware architecture because no complex coupling setups are needed and because, for uncoupled nodes, the system response is equivalent for space and time multiplexing.

cs.LG↗

arXiv2024

Efficient Optimisation of Physical Reservoir Computers using only a Delayed Input

We present an experimental validation of a recently proposed optimization technique for reservoir computing, using an optoelectronic setup. Reservoir computing is a robust framework for signal processing applications, and the development of efficient optimization approaches remains a key challenge. The technique we address leverages solely a delayed version of the input signal to identify the optimal operational region of the reservoir, simplifying the traditionally time-consuming task of hyperparameter tuning. We verify the effectiveness of this approach on different benchmark tasks and reservoir operating conditions.

cs.ET↗

arXiv2023

Solving the time-complexity problem and tuning the performance of quantum reservoir computing by artificial memory restriction

Quantum reservoir computing is a computing approach which aims at utilising the complexity and high-dimensionality of small quantum systems, together with the fast trainability of reservoir computing, in order to solve complex tasks. The suitability of quantum reservoir computing for solving temporal tasks is hindered by the collapse of the quantum system when measurements are made. This leads to the erasure of the memory of the reservoir. Hence, for every output, the entire input signal is needed to reinitialise the reservoir, leading to quadratic time complexity. Overcoming this issue is critical to the hardware implementation of quantum reservoir computing. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs to reinitialise the reservoir after measurements are performed, leading to linear time complexity. This not only substantially reduces the number of quantum operations needed to perform timeseries prediction tasks, it also provides a means of tuning the nonlinearity of the response of the reservoir, which can lead to significant performance improvement. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model. We find that our proposed linear algorithm not only significantly reduces the computational cost but also provides an experimental accessible means to optimise the task specific reservoir computing performance.

quant-ph↗

arXiv2021

The role of delay-times in delay-based Photonic Reservoir Computing

Delay-based reservoir computing has gained a lot of attention due to the relative simplicity with which this concept can be implemented in hardware. However,there is still an misconception about the relationship between the delay-time and the input clock-cycle which has noticeable consequences for the performance. We review the existing literature on this subject and introduce the concept of delay-based reservoir computing in a manner that demonstrates that there is no predefined relationship between these two times-scales. Further, we discuss ways to improve the computing performance of a reservoir formed by delay-coupled oscillators and show the crucial impact of delay-time tuning in those multi-delay systems.

physics.comp-ph↗

arXiv2016

Double quantum dot Cooper-pair splitter at finite couplings

We consider the sub-gap physics of a hybrid double-quantum dot Cooper-pair splitter with large single-level spacings, in the presence of tunnelling between the dots and finite Coulomb intra- and inter-dot Coulomb repulsion. In the limit of a large superconducting gap, we treat the coupling of the dots to the superconductor exactly. We employ a generalized master-equation method which easily yields currents, noise and cross-correlators. In particular, for finite inter- and intra-dot Coulomb interaction, we investigate how the transport properties are determined by the interplay between local and nonlocal tunneling processes between the superconductor and the dots. We examine the effect of inter-dot tunneling on the particle-hole symmetry of the currents with and without spin-orbit interaction. We show that spin-orbit interaction in combination with finite Coulomb energy opens the possibility to control the nonlocal entanglement and its symmetry (singlet/triplet). We demonstrate that the generation of nonlocal entanglement can be achieved even without any direct nonlocal coupling to the superconducting lead.

cond-mat.mes-hall↗